Submission #201099

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <sys/time.h>
/*
#include <unordered_map>
#include <unordered_set>
*/
#include <unistd.h>
#include <utility>
#include <vector>
using namespace std;
#define i64         int64_t
#define rep(i, n)   for(i64 i = 0; i < ((i64)(n)); ++i)
#define sz(v)       ((i64)((v).size()))
#define bit(n)      (((i64)1)<<((i64)(n)))
#define all(v)      (v).begin(), (v).end()






int main()
{
  i64 n;
  i64 a[1000];
  // cin >> n; rep(i, n) cin >> a[i];
  rep(i, 2) cin >> a[i];
  cout << a[1] << " " << a[0] << endl;
  return 0;
  
  i64 ans = 0;
  
  while(true){
    ans = a[0];
    ans = a[1];
    ans = a[2];
    ans = a[3];
    ans = a[4];
    ans = a[5];
    break;
  }
  
  cout << ans << endl;
}

Submission Info

Judge Result