Submission #2850864
Source Code Expand
#include<iostream> using namespace std; #define ll long long int main(){ int i,j; int n,a; int ans; bool f; cin >> n ; ans =n; char s[n][n]; for(i=0;i<n;i++){ for(j=0;j<n;j++){ cin >> s[i][j]; } } for(a=0;a<n;a++){ f=true; for(i=0;i<n;i++){ for(j=0;j<n;j++){ if(s[i][(j+n-a)%n]!=s[j][(i+n-a)%n]){ ans--; f=false; break; } } if(!f){ break; } } } cout << ans*n << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Find Symmetries |
User | o_kai |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 672 Byte |
Status | AC |
Exec Time | 94 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 | 6 ms | 384 KB |
subtask_1_04.txt | AC | 5 ms | 256 KB |
subtask_1_05.txt | AC | 5 ms | 256 KB |
subtask_1_06.txt | AC | 19 ms | 256 KB |
subtask_1_07.txt | AC | 5 ms | 256 KB |
subtask_1_08.txt | AC | 82 ms | 384 KB |
subtask_1_09.txt | AC | 94 ms | 384 KB |
subtask_1_10.txt | AC | 50 ms | 384 KB |
subtask_1_11.txt | AC | 32 ms | 384 KB |
subtask_1_12.txt | AC | 18 ms | 384 KB |
subtask_1_13.txt | AC | 16 ms | 384 KB |
subtask_1_14.txt | AC | 47 ms | 384 KB |
subtask_1_15.txt | AC | 6 ms | 384 KB |
subtask_1_16.txt | AC | 16 ms | 384 KB |
subtask_1_17.txt | AC | 8 ms | 384 KB |
subtask_1_18.txt | AC | 7 ms | 384 KB |
subtask_1_19.txt | AC | 47 ms | 384 KB |
subtask_1_20.txt | AC | 8 ms | 384 KB |
subtask_1_21.txt | AC | 24 ms | 384 KB |
subtask_1_22.txt | AC | 21 ms | 384 KB |
subtask_1_23.txt | AC | 50 ms | 384 KB |
subtask_1_24.txt | AC | 94 ms | 384 KB |
subtask_1_25.txt | AC | 21 ms | 384 KB |
subtask_1_26.txt | AC | 28 ms | 384 KB |
subtask_1_27.txt | AC | 94 ms | 384 KB |
subtask_1_28.txt | AC | 94 ms | 384 KB |
subtask_1_29.txt | AC | 50 ms | 384 KB |
subtask_1_30.txt | AC | 50 ms | 384 KB |