Submission #7068269
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
using namespace std;
typedef long long ll;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
#define EPS (1e-7)
#define INF (1e15)
#define PI (acos(-1))
#define MOD 1000000007
#define REP(i,n) for(int i=0;i<n;i++)
#define REPS(i,f,n) for(int i=(f);i<(n);i++)
#define EACH(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define arrdump(n,a) for(int i=0;i<n;i++) {cout<<((i>0)? " ":"")<<a[i];}cout<<"\n";
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy4[]={0, 0, 1, -1};
int dx4[]={1, -1, 0, 0};
int dx8[]={0, 0, 1, -1, 1, 1, -1, -1};
int dy8[]={1, -1, 0, 0, 1, -1, -1, 1};
// https://atcoder.jp/contests/abc004/tasks/abc004_2
int main() {
char c[4][4];
REP(i, 4) {
REP(j, 4) {
cin >> c[3-i][3-j];
}
}
REP(i, 4) {
REP(j, 4) {
if (j) cout << " ";
cout << c[i][j];
}
cout << "\n";
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - 回転 |
User |
wakamenod |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1526 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 |