FLAG

• Problem Description

  
  "According to a new ISO standard, a flag of every country should have a chequered field nm, 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.
  
  Input
  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
  Output YES, if the flag meets the new ISO standard, and NO otherwise."
  

• CODING ARENA::

• #include<stdio.h>

  int n,m;

  int main()

  {

  int i,j;

  char fln ,flm,flag,t;

  while(~scanf("%d%d",&n,&m)){

  flag=1;fln=-1;getchar();

  for(i=0;i<n;i++)

  {

  scanf("%c",&flm);

  if(fln==flm)flag=0;

  for(j=1;j<m;j++)

  {

  scanf("%c",&t);

  if(t!=flm)flag=0;

  }

  fln=flm;

  getchar();

  }

  if(flag)printf("YES\n");

  else printf("NO\n");

  }

  return 0;

  }

• Test Case 1

  
  Input (stdin)

  3 3
  
  000
  
  111
  
  222
  
  

  Expected Output

  YES

• Test Case 2

  
  Input (stdin)

  3 3
  
  000
  
  000
  
  111
  
  

  Expected Output

  NO