| Time Limit: 1000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
Description
Valera is a little boy. Yesterday he got a huge Math hometask at school, so Valera didn‘t have enough time to properly learn the English alphabet for his English lesson. Unfortunately, the English teacher decided to have a test on alphabet today. At the test Valera got a square piece of squared paper. The length of the side equals n squares (n is an odd number) and each unit square contains some small letter of the English alphabet.
Valera needs to know if the letters written on the square piece of paper form letter "X". Valera‘s teacher thinks that the letters on the piece of paper form an "X", if:
- on both diagonals of the square paper all letters are the same;
- all other squares of the paper (they are not on the diagonals) contain the same letter that is different from the letters on the diagonals.
Help Valera, write the program that completes the described task for him.
Input
The first line contains integer n (3 ≤ n < 300; n is odd). Each of the next n lines contains n small English letters — the description of Valera‘s paper.
Output
Print string "YES", if the letters on the paper form letter "X". Otherwise, print string "NO". Print the strings without quotes.
Sample Input
Input
5xoooxoxoxosoxoooxoxoxooox
Output
NO
Input
3wswswswsw
Output
YES
Input
3xpxpxpxpe
Output
NO
Source
Codeforces Round #237 (Div. 2)
题意：只有两种不同的字符，对角线一种，非对角线一种，判断对角线的所有字符是否一样，非对角线的所有字符是否一样。
#include <iostream>
using namespace std;
int main()
{
int i,j,n;
char c[305][305];
cin>>n;
for(i=0;i<n;i++)
cin>>c[i];
char tmp1=c[0][0];
char tmp2=c[0][1];
if(tmp1==tmp2)
{
cout<<"NO"<<endl;
return 0;
}
int flag=1;
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
{
if(i==j||i+j==n-1)
{
if(c[i][j]!=tmp1)
{
flag=0;
break;
}
}
else
{
if(c[i][j]!=tmp2)
{
flag=0;
break;
}
}if(!flag)
break;
}
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}