Valera and X CodeForces - 404A

35 篇文章 1 订阅
7 篇文章 0 订阅

题目链接

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.

Examples
Input
5
xooox
oxoxo
soxoo
oxoxo
xooox
Output
NO
Input
3
wsw
sws
wsw
Output
YES
Input
3
xpx
pxp
xpe
Output
NO

题目大意:判断是否符合以下条件:
1.两条对角线上的元素相同
2.其余元素相同,且与对角线上的元素不同。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
    int n;
    char c[305][305];
    while(cin>>n&&n!=EOF)
    {
        int flag=0;
        char s1,s2;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                cin>>c[i][j];
                if(i==0&&j==0)
                    s1=c[i][j];
                else if(i==0&&j==1)
                    s2=c[i][j];
                if((i==j||i==n-1-j)&&c[i][j]!=s1)
                    flag=1;
                else if(!(i==j||i==n-1-j)&&c[i][j]!=s2)
                    flag=1;
            }
        }
        if(s1==s2)
            flag=1;
        if(flag==0)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值