Codeforces Round #243 (Div. 2) Problem B - Sereja and Mirroring 题解
来源:互联网 发布:淘宝店名名字 编辑:程序博客网 时间:2024/05/01 15:13
http://codeforces.com/contest/426/problem/B
题意大概就是对称有关,要注意的是,当行数为奇数的时候,答案就是行数本身
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define maxn 1005using 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;}
0 0
- Codeforces Round #243 (Div. 2) Problem B - Sereja and Mirroring 题解
- codeforces 426B - Sereja and Mirroring
- codeforces 426 B. Sereja and Mirroring(递归)
- Codeforces Round #243 (Div. 1) B Sereja and Table
- Codeforces Round #215 (Div. 2) -B. Sereja and Suffixes
- Codeforces Round #215 (Div. 2) -B. Sereja and Suffixes
- Codeforces Round #215 (Div. 2) B. Sereja and Suffixes
- Codeforces Round #223 (Div. 2) B. Sereja and Stairs
- Codeforces Round #235 (Div. 2)B. Sereja and Contests
- Codeforces Round #187 (Div. 2) B. Sereja and Array
- Codeforces Round #223 (Div. 2) B. Sereja and Stairs【模拟】
- Codeforces Sereja and Mirroring
- B. Sereja and Mirroring
- B. Sereja and Mirroring
- Codeforces Round #223 (Div. 2)A. Sereja and Dima&&B. Sereja and Stairs
- Codeforces Round #243 (Div. 2) C. Sereja and Swaps
- Codeforces Round #243 (Div. 2)——Sereja and Swaps
- Codeforces Round #243 (Div. 2)——Sereja and Table
- Struts2教程7:上传任意多个文件
- 黑马程序员—静态概述
- hdu 2686 Matrix (多线程dp)
- 一道SQL的面试题之联想
- leetcode day5 -- Reorder List && Linked List Cycle II
- Codeforces Round #243 (Div. 2) Problem B - Sereja and Mirroring 题解
- Shapefile文件组成,Shapefile文件的修复
- 蓝桥杯——奇怪的比赛
- 玛雅~终于开始勤奋了特闷
- 感觉很是不适应呢
- Linux的NPTL
- 犁称言缘剩狠挚棉1-2(25)
- Java连接mySql—简单JDBC连接数据库
- HTML中如何用CSS设置文本样式