tictaktoe game

-

 #include<bits/stdc++.h>

using namespace std;
int main(){
    int t; cin>>t;
    while(t--){
        char a[3][3]; int countx=0, counto=0, winx=0, wino=0, count_=0;
        for(int i=0; i<3; i++){
            for(int j=0; j<3; j++){
                cin>>a[i][j];
                if(a[i][j]=='X') countx++;
                else if(a[i][j]=='O') counto++;  // taking input && counting their number
                else if(a[i][j]=='_') count_++;
            }
        }
            
      for(int i=0; i<3; i++) {
           if(a[i][0]==a[i][1] && a[i][2]==a[i][1]){
              if(a[i][0]=='X') winx++;  // checking along the row
              else if(a[i][0]=='O') wino++;
          }
      } 


      for(int i=0; i<3; i++) {
           if(a[0][i]==a[1][i] && a[2][i]==a[1][i]){
              if(a[0][i]=='X') winx++;  // checking along the column
              else if(a[0][i]=='O') wino++;
          }
      } 

      if(a[0][0]==a[1][1] && a[2][2]==a[1][1]){
           if(a[1][1]=='X') winx++;  // checking along the diagonals
              else if(a[1][1]=='O') wino++;
      }

      if(a[0][2]==a[1][1] && a[2][0]==a[1][1]){
           if(a[1][1]=='X') winx++;  // checking along the other diagonals
              else if(a[1][1]=='O') wino++;
      }


     if(counto>countx) cout<<3<<endl;
     else if(countx-counto>1) cout<<3<<endl;          // unreachable state
     else if((countx>counto) && winx==1 && wino==0){  // unreachable state
          cout<<1<<endl;    
     } 
     else if((countx==counto) && wino==1 && winx==0){
         cout<<1<<endl;
     }
     
     else if(count_==0 && (winx+wino==0)){ // all the places fill no one win #Draw
         cout<<1<<endl;
     }
     else if(count_==0 && winx==2){
         cout<<1<<endl;   // special case discussed earlier
     }
     else if(count_>0 && (winx+wino==0)){
         cout<<2<<endl;   // game will continue
     }
     else{
         cout<<3<<endl;  // other unreachable state
     }


     


        
    }
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

priority_queue

-
  #include <iostream> #include <queue> #include <vector> using namespace std ; int main (){     // priority_queue<int> q;     // priority_queue<int, vector<int>, greater<int>> q;     auto cmp = []( int a , int b ){         return a < b ;     };     priority_queue < int , vector < int > , decltype (cmp) > q(cmp);         vector < int > v = { 8 , 1 , 6 , 4 , 0 , 7 , 2 , 9 };     for ( int x: v) q. push (x);     while ( ! q. empty ()){         cout << q. top () << " " ;         q. pop ();     }     cout << endl ;     return 0 ; }
Read more

Alignment in css

-
  <! DOCTYPE   html > < html   lang = "en" > < head >      < meta   charset = "UTF-8" >      < meta   http-equiv = "X-UA-Compatible"   content = "IE=edge" >      < meta   name = "viewport"   content = "width=device-width, initial-scale=1.0" >      < title > Alignment </ title >      < link   rel = "preconnect"   href = "https://fonts.gstatic.com" >      < link   href = "https://fonts.googleapis.com/css2?family=Ubuntu:wght@300&display=swap"   rel = "stylesheet" >      < style >          *  {              box-sizing :  border-box ;         }          body  {              font-family :  'Ubuntu' ,  sans-serif ;         }          .container  {              width :  900px ;              border :  3px   solid   purple ;              margin :  33px   auto ;              background-color :  rgb ( 248 ,  191 ,  141 );
Read more

Queue data structure in c++

-
  #include <iostream> using namespace std ; #define n 10 class queue {     int * arr;     int front;     int back;     public:       queue (){          arr = new int [ n ];          front =- 1 ;          back =- 1 ;      }       void push ( int x ){           if (back == n - 1 ){              cout << "queue is not empty " << endl ;               return ;          }          back ++ ;          arr[back] = x ;           if (front ==- 1 ){              front ++ ;          }      }       void pop (){           if (front > back || front ==- 1 ){              cout << "no element is in the queue " << endl ;               return ;          }          front ++ ;      }       int peek (){           if (front > back || front ==- 1 ){              cout << "no element in the queue" << endl ;               return - 1 ;          }           return arr[front];      }       bool empty (){           if (front &
Read more