Submission #2542063
Source Code Expand
#include<bits/stdc++.h> #include<assert.h> using namespace std; int main() { int n; string s[300]; cin >> n; for(int i = 0; i < n; i++)cin >> s[i]; int ans = 0; for(int mx = 0; mx < n; mx++) { bool ok = true; for(int x = 0; x < n; x++) { for(int y = 0; y < n; y++) { if(s[(x + mx) % n][y] != s[(y + mx) % n][x])ok = false; } } if(ok)ans++; } cout << ans * n << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Find Symmetries |
User | ecto0310 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 443 Byte |
Status | AC |
Exec Time | 189 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 162 ms | 384 KB |
subtask_1_04.txt | AC | 143 ms | 384 KB |
subtask_1_05.txt | AC | 112 ms | 384 KB |
subtask_1_06.txt | AC | 73 ms | 256 KB |
subtask_1_07.txt | AC | 106 ms | 384 KB |
subtask_1_08.txt | AC | 164 ms | 384 KB |
subtask_1_09.txt | AC | 189 ms | 384 KB |
subtask_1_10.txt | AC | 189 ms | 384 KB |
subtask_1_11.txt | AC | 189 ms | 384 KB |
subtask_1_12.txt | AC | 189 ms | 384 KB |
subtask_1_13.txt | AC | 189 ms | 384 KB |
subtask_1_14.txt | AC | 189 ms | 384 KB |
subtask_1_15.txt | AC | 189 ms | 384 KB |
subtask_1_16.txt | AC | 189 ms | 384 KB |
subtask_1_17.txt | AC | 189 ms | 384 KB |
subtask_1_18.txt | AC | 189 ms | 384 KB |
subtask_1_19.txt | AC | 189 ms | 384 KB |
subtask_1_20.txt | AC | 189 ms | 384 KB |
subtask_1_21.txt | AC | 189 ms | 384 KB |
subtask_1_22.txt | AC | 189 ms | 384 KB |
subtask_1_23.txt | AC | 189 ms | 384 KB |
subtask_1_24.txt | AC | 189 ms | 384 KB |
subtask_1_25.txt | AC | 189 ms | 384 KB |
subtask_1_26.txt | AC | 189 ms | 384 KB |
subtask_1_27.txt | AC | 189 ms | 384 KB |
subtask_1_28.txt | AC | 189 ms | 384 KB |
subtask_1_29.txt | AC | 189 ms | 384 KB |
subtask_1_30.txt | AC | 189 ms | 384 KB |