Algorithm
According to a new ISO standard, a flag of every country should have a chequered field n × m, each square should be of one of 10 colours, and the flag should be «striped»: each horizontal row of the flag should contain squares of the same colour, and the colours of adjacent horizontal rows should be different. Berland's government asked you to find out whether their flag meets the new ISO standard.
The first line of the input contains numbers n and m (1 ≤ n, m ≤ 100), n — the amount of rows, m — the amount of columns on the flag of Berland. Then there follows the description of the flag: each of the following n lines contain m characters. Each character is a digit between 0 and 9, and stands for the colour of the corresponding square.
Output YES, if the flag meets the new ISO standard, and NO otherwise.
3 3
000
111
222
YES
3 3
000
000
111
NO
3 3
000
111
002
NO
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <cstdio>
#include <iostream>
int main(){
int n(0), m(0); scanf("%d %d\n", &n, &m);
std::string currentLine("");
int currentColor = -1;
bool output(1);
for(int row = 0; row < n; row++){
getline(std::cin, currentLine);
if(currentLine[0] == currentColor || output == 0){output = 0; break;}
else{currentColor = currentLine[0];
for(int col = 1; col < m; col++){if(currentLine[col] != currentColor){output = 0; break;}}
}
}
if(output){puts("YES");} else {puts("NO");}
return 0;
}Input
000
111
222
Output
Demonstration
Codeforces Solution-A. Flag-Solution in C, C++, Java, Python