Codeforces Round #243 (Div. 2) Problem B - Sereja and Mirroring 题解
2014-04-28 08:16
309 查看
http://codeforces.com/contest/426/problem/B
题意大概就是对称有关,要注意的是,当行数为奇数的时候,答案就是行数本身
题意大概就是对称有关,要注意的是,当行数为奇数的时候,答案就是行数本身
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define maxn 1005 using namespace std; char a[maxn][maxn]; int ans; void solve(int r) { if(r % 2) return; for(int i = 1, j = r; i <= r / 2; i ++, j --) { if(strcmp(a[i], a[j])) return; } ans /= 2; solve (r / 2); } int main() { int row, lie; scanf("%d%d", &row, &lie); getchar(); int i; for(i = 1; i <= row; i ++) { gets(a[i]); // cout << i << endl; } ans = row; solve(row); cout << ans << endl; return 0; }
相关文章推荐
- Codeforces Round #243 (Div. 2)——Sereja and Swaps
- Codeforces Round #243 (Div. 1)——Sereja and Two Sequences
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- 【题解】[codeforces round #198 div2]Tourists problem
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps 解题报告
- Codeforces Round #243 (Div. 2)——Sereja and Table
- Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) ABCD题解
- Codeforces Round #360 (Div. 1) 题解(待续)
- Codeforces Round #127 (Div. 1), problem: (C) Fragile Bridges 优先队列
- Codeforces Round #235 (Div. 2)B. Sereja and Contests
- Codeforces Round #405 (rated, Div. 1, based on VK Cup 2017 Round 1) 题解(待续)
- Codeforces Round #258 (Div. 2)题解(ALL)
- Codeforces Round #376 (Div. 2) 题解
- Codeforces Round #187 (Div. 2) A. Sereja and Bottles
- Codeforces Round #394 (Div. 2) 题解
- Codeforces Round #292 DIV2 题解
- Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) ABCD题解
- Codeforces Round #313 (Div. 2) Problem D - Equivalent Strings
- Codeforces Round #Pi (Div. 2) (ABCD题解)