Submission #1815558
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rept(i,n) for(int (i)=0;(i)<=(int)(n);(i)++)
#define reps(i,s,n) for(int (i)=(s);(i)<(int)(n);(i)++)
#define repst(i,s,n) for(int (i)=(s);(i)<=(int)(n);(i)++)
#define repr(i,n) for(int (i)=(n);(i)>=0;(i)--)
#define each(itr,v) for(auto (itr):(v))
#define all(c) c.begin(),c.end()
#define pb push_back
#define fi first
#define se second
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define ln << "\n"
#define show(x) cout << #x << " = " << x ln
#define dbg(x) cout<<#x"="<<x ln
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;
struct edge {
int to,cost;
edge(int t, int c):to(t),cost(c) {}
};
const int inf = (int)1e9;
const ll linf = (ll)1e18;
const int mod = (int)(1e9+7);
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
//--------------------------------------------------
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string c[4][4];
rep(y,4) rep(x,4) cin >> c[3-x][3-y];
rep(y,4) {
rep(x,3) cout << c[x][y] << " ";
cout << c[3][y] ln;
}
}
Submission Info
Submission Time |
|
Task |
B - 回転 |
User |
creep04 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1280 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 |
00_sample_00.txt, 00_sample_01.txt, 01_all_dot.txt, 02_all_o.txt, 03_all_x.txt, rand_0.txt, rand_1.txt, rand_10.txt, rand_11.txt, rand_12.txt, rand_13.txt, rand_14.txt, rand_15.txt, rand_16.txt, rand_17.txt, rand_18.txt, rand_19.txt, rand_2.txt, rand_20.txt, rand_21.txt, rand_22.txt, rand_23.txt, rand_24.txt, rand_3.txt, rand_4.txt, rand_5.txt, rand_6.txt, rand_7.txt, rand_8.txt, rand_9.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_00.txt |
AC |
1 ms |
256 KB |
00_sample_01.txt |
AC |
1 ms |
256 KB |
01_all_dot.txt |
AC |
1 ms |
256 KB |
02_all_o.txt |
AC |
1 ms |
256 KB |
03_all_x.txt |
AC |
1 ms |
256 KB |
rand_0.txt |
AC |
1 ms |
256 KB |
rand_1.txt |
AC |
1 ms |
256 KB |
rand_10.txt |
AC |
1 ms |
256 KB |
rand_11.txt |
AC |
1 ms |
256 KB |
rand_12.txt |
AC |
1 ms |
256 KB |
rand_13.txt |
AC |
1 ms |
256 KB |
rand_14.txt |
AC |
1 ms |
256 KB |
rand_15.txt |
AC |
1 ms |
256 KB |
rand_16.txt |
AC |
1 ms |
256 KB |
rand_17.txt |
AC |
1 ms |
256 KB |
rand_18.txt |
AC |
1 ms |
256 KB |
rand_19.txt |
AC |
1 ms |
256 KB |
rand_2.txt |
AC |
1 ms |
256 KB |
rand_20.txt |
AC |
1 ms |
256 KB |
rand_21.txt |
AC |
1 ms |
256 KB |
rand_22.txt |
AC |
1 ms |
256 KB |
rand_23.txt |
AC |
1 ms |
256 KB |
rand_24.txt |
AC |
1 ms |
256 KB |
rand_3.txt |
AC |
1 ms |
256 KB |
rand_4.txt |
AC |
1 ms |
256 KB |
rand_5.txt |
AC |
1 ms |
256 KB |
rand_6.txt |
AC |
1 ms |
256 KB |
rand_7.txt |
AC |
1 ms |
256 KB |
rand_8.txt |
AC |
1 ms |
256 KB |
rand_9.txt |
AC |
1 ms |
256 KB |