Codeforces Round #237 (Div. 2) A. Valera and X(模拟题)
来源：互联网 发布：好的枕头 知乎 编辑：程序博客网 时间：2024/05/17 18:17
#include<iostream>#include<cmath>#include<cstring>#include<algorithm>using namespace std;char a[305][305];int main(){int i,j,k,m,n,ans;while(cin>>k){ ans=0;int temp=0,s=0; for(i=1;i<=k;i++)for(j=1;j<=k;j++)cin>>a[i][j];for(i=2;i<=k;i++) if(a[i][i]==a[1][1]&&a[i][k-i+1]==a[1][k])continue; else {ans=1;break;}//判断对角线是否相等 for(i=1;i<=k;i++) for(j=1;j<=k;j++)if(i==j||i+j==k+1)continue;else if(a[i][j]!=a[1][2]){temp=1;}//对角线外的元素是否相等if(a[1][1]==a[1][2])s=1;//判断对角线和对角线外的元素是否一样if(ans||temp||s)cout<<"NO"<<endl;else if(ans==0&&temp==0&&s==0)cout<<"YES"<<endl; }}
0 0
- Codeforces Round #237 (Div. 2) A. Valera and X(模拟题)
- Codeforces Round #237 (Div. 2) A. Valera and X(模拟题)
- Codeforces Round #237 (Div. 2) A. Valera and X
- Codeforces Round #237 (Div. 2)A题Valera and X解题报告
- Codeforces Round #252 (Div. 2) B. Valera and Fruits(模拟)
- Codeforces Round #216 (Div. 2) A. Valera and Plates
- Codeforces Round #252 (Div. 2)A. Valera and Antique Items
- Codeforces Round #252 (Div. 2) A. Valera and Antique Items
- Codeforces Round #252 (Div. 2) 441A Valera and Antique Items
- Codeforces Round #252(Div. 2) 441A. Valera and Antique Items 水题
- Codeforces Round #216 (Div. 2) B. Valera and Contest
- Codeforces Round #216 (Div. 2) C. Valera and Elections
- Codeforces Round #216 (Div. 2) D. Valera and Fools
- Codeforces Round #216 (Div. 2) D. Valera and Fools
- Codeforces Round #216 (Div. 2) B. Valera and Contest
- Codeforces Round #252 (Div. 2) 441B. Valera and Fruits
- Codeforces Round #252 (Div. 2) C. Valera and Tubes
- Codeforces Round #252 (Div. 2) 441C. Valera and Tubes
- 我与编程
- 软件设计漫谈之三：30分钟掌握面向对象类的设计原则
- Android设计模式学习日记04--单例模式
- UVa:11987 Almost Union-Find（并查集）
- 面向用户的图片格式选择
- Codeforces Round #237 (Div. 2) A. Valera and X(模拟题)
- LeetCode Minimum Path Sum
- ubuntu与win7双系统，重装win7后的grub引导修复
- 杭电ACM 1297 Children’s Queue
- C++类型别名细节
- C/C++,C#,Java区别
- Win7_VS2012编译安装boost1.55笔记
- uva 718 - Skyscraper Floors（模拟优化）
- ubuntu下配置jdk1.6
