Submission #131775

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
//#include <gmpxx.h> 
#include <iostream>
//#include <map>
#include <queue>
#include <unordered_map>
#include <utility>
#include <set>
#include <sstream>
#include <stack>
#include <string>
//#include <sys/time.h>
#include <vector>
using namespace std;
#define li          int64_t
#define rep(i, n)   for(li i = 0; i < ((li)(n)); ++i)
#define pb          push_back
#define sz(v)       ((li)((v).size()))
#define bit(n)      (((li)1)<<((li)(n)))
#define all(v)      (v).begin(), (v).end()
#define each(it, v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define MP          make_pair
#define F           first
#define S           second


int main()
{
  char c[16];
  rep(i, 16) cin >> c[i];
  rep(i, 4){ rep(j, 4) cout << c[(3 - i) * 4 + (3  - j)] << " "; cout << endl; }
}

Submission Info

Judge Result