Submission #2008304
Source Code Expand
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
#include <exception>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef pair<int,int> P;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << endl
const ll INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[100000],dp[100][100];
int main(){
vs vec;
rep(i,0,4){
rep(i,0,4){
cin >> s;
vec.pb(s);
}
}
rep(i,0,8)swap(vec[i],vec[15-i]);
rep(i,0,16){
if(i % 4 == 0 && i != 0)puts("");
cout << vec[i] << " ";
}
puts("");
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 回転 |
User |
shadowlink_0122 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1164 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 |