Solution to the problem number 619 of AceptaelReto - 619.

Any questions do not hesitate to contact.


#include <bits/stdc++.h>
using namespace std;

int n,m;
char matrix[50][50];

bool check(int start,int end){
    set<char> S;
    //cout<<start<<" "<<end<<endl;
    for(int i=start; i<m && i<start+8;i++){
        for(int j=end; j<n && j<end+8;j++){
            S.insert(matrix[i][j]);
            //cout<<i<<" "<<j<<" ";
            if(S.size()>2) return false;
        }
        //cout<<endl;
    }
    return true;
}

int main(){
    while(scanf("%d %d",&n,&m)==2 && (n!=0 || m!=0)){
      cin.ignore();
      for(int i=0; i<m;i++){
          for(int j=0; j<n;j++){
              scanf("%c",&matrix[i][j]);
          }
          cin.ignore();
      }
      bool flag=true;
      for(int i=0; i<m && flag;i+=8)
          for(int j=0; j<n && flag;j+=8)
              flag=check(i,j);

      if(flag) printf("SI\n");
      else printf("NO\n");
    }
    return 0;
}

/*
16 8
AAAAAAAIBBCCCBBC
AAIIIAAICBBCBBCC
AIIIAAIICCBBBCCC
IIIAAIIICCBBBCCC
IIAAIIAICBBCBBCC
IAAIIAAIBBCCCBBC
AAAAAAAIBBCCCBBC
IIIIIIIICCCCCCCC
8 8
AAAAAAAI
AAIIIAAI
AIIIAAII
IIIAAIII
IIAAIIAI
IAAIIAAI
AAAAAAAI
IIIIIIII
16 16
AAAAAAAIBBCCCBBC
AAIIIAAICBBCBBCC
AIIIAAIICCBBBCCC
IIIAAIIICCBBBCCC
IIAAIIAICBBCBBCC
IAAIIAAIBBCCCBBC
AAAAAAAIBBCCCBBC
IIIIIIIICCCCCCCC
AAAAAAAIBBCCCBBC
AAIIIAAICBBCBBCC
AIIIAAIICCBBBCCC
IIIAAIIICCBBBCCC
IIAAIIAICBBCBBCC
IAAIIAAIBBCCCBBC
AAAAAAAIBBCCCBBC
IIIIIIIICCCCCCCC
46 46
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
0 0

Todas las soluciones son SI
*/

Don't miss anything.

Keep in touch with Isaac Lozano Osorio!