Submission #133242

---

Source Code Expand

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <stdio.h>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<vector<int> > mat;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define pb push_back
#define mp make_pair
#define INF 1e+9

char m[4][100];
string s[4];
int main()
{
	/*
	for(int i=0;i<4;i++){
		scanf("%c %c %c %c",&m[3-i][3],&m[3-i][2],&m[3-i][1],&m[3-i][0]);
	}
	*/
	rep(i,4)
		getline(cin,s[i]);

	rep(i,4){
		rep(j,7){
			/*if(j%2==0)
				printf("%c",ans[i][j/2]);
			else
				printf(" ");
			if(j==6)printf("\n");
			*/
			cout<<s[3-i][6-j];
			if(j==6)cout<<endl;
		}
	}
	return 0;
}

Submission Info

Judge Result