Algorithm

A. Valera and X
time limit per test
1 second
memory limit per test
256 megabytes
Problem link- https://codeforces.com/contest/404/problem/A
input
standard input
output
standard output

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
Copy
5
xooox
oxoxo
soxoo
oxoxo
xooox
output
Copy
NO
input
Copy
3
wsw
sws
wsw
output
Copy
YES
input
Copy
3
xpx
pxp
xpe
output
Copy
NO



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int n;
string s[301];
set<int> s1, s2;

int main() {
  cin >> n;
  for(int i = 0; i < n; ++i)
    cin >> s[i];
  
  for(int i = 0; i < n; ++i) {
    for(int j = 0; j < n; ++j) {
      if(i == j || (i + j) == s[0].length() - 1)
        s1.insert(s[i][j]);
      else
        s2.insert(s[i][j]);
    }
  }

  if(s1.size() == 1 && s2.size() == 1 && *s1.begin() != *s2.begin())
    puts("YES");
  else
    puts("NO");

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
5
xooox
oxoxo
soxoo
oxoxo
xooox

Output

x
–
+
cmd
NO
Advertisements

Demonstration

Codeforces Solution-Valera and X-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+