Submission #1694255
Source Code Expand
#include <iostream> #include <iomanip> #include <vector> #include <valarray> #include <map> #include <set> #include <list> #include <queue> #include <stack> #include <bitset> #include <utility> #include <numeric> #include <algorithm> #include <functional> #include <complex> #include <string> #include <sstream> #include <cstdio> #include <cstdlib> #include <cctype> #include <cstring> #include <cmath> using namespace std; #define all(c) c.begin(),c.end() #define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++) #define debug(x) #x << "=" << (x) #define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl typedef long long ll; typedef vector<int> vi; template<typename T> ostream& operator<<(ostream& os, const vector<T>& vec){ os << "["; for(int i = 0; i < vec.size(); i++){ os << vec[i] << ","; } os << "]"; return os; } template<typename T> T input(){ T t; cin >> t; return t; } template<typename T> vector<T> input(const int N){ vector<T> v(N); repeat(i,N) cin >> v[i]; return v; } long long gcd(long long a, long long b){ if(b == 0){ return a; } return gcd(b, a % b); } long long lcm(long long a, long long b){ return (a / gcd(a, b)) * b; } int main(){ char field[4][4]; repeat (y,4) { repeat(x,4) { cin >> field[y][x]; } } repeat (y,2) { repeat(x,4) { int x_mirror = 4 - x - 1; int y_mirror = 4 - y - 1; char tmp = field[y_mirror][x_mirror]; field[y_mirror][x_mirror] = field[y][x]; field[y][x] = tmp; } } repeat (y, 4) { repeat(x, 4) { if (x == 3) { cout << field[y][x]; } else { cout << field[y][x] << " "; } } cout << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 回転 |
User | xeonics |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1875 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 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 | 3 ms | 384 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 |