Submission #1964641
Source Code Expand
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <numeric>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
/*************** using variables ***************/
int a,b;
/**********************************************/
int main(){
cin >> a >> b;
cout << b << " " << a <<endl;
}
Submission Info
Submission Time |
|
Task |
A - スワップ |
User |
wheson |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1008 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, test_13_69.txt, test_16_44.txt, test_40_40.txt, test_49_31.txt, test_51_74.txt, test_83_60.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
test_13_69.txt |
AC |
1 ms |
256 KB |
test_16_44.txt |
AC |
1 ms |
256 KB |
test_40_40.txt |
AC |
1 ms |
256 KB |
test_49_31.txt |
AC |
1 ms |
256 KB |
test_51_74.txt |
AC |
1 ms |
256 KB |
test_83_60.txt |
AC |
1 ms |
256 KB |