Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <stdlib.h>
- using namespace std;
- char map[3][3]={{'-','-','-'},
- {'-','-','-'},
- {'-','-','-'}};
- int r,c,p1_count,p2_count,win,loss;
- string p1,p2;
- int main (){
- p1="test";
- p2="test1";
- p1_count=p2_count=win=0;
- for(int i=0;i<3;i++){
- for(int j=0;j<3;j++)
- cout <<map[i][j]<<"|";
- cout<<endl;
- }
- //Get coordinates
- do{
- do{
- cout<<p1<< " Turn\n\n"<<endl;
- do{
- cout << "Riga p1: " ;
- cin >> r;
- // check for valid input
- if (r > 2 || r < 0)
- cout << "scegli riga tra 0, 1, or 2 : " ;
- }while (r > 2 || r < 0);
- do{
- cout<<"Colonna p1: " ;
- cin >> c;
- // check for valid input
- if (c > 2 || c < 0)
- cout << "Scegli colonna tra 0, 1, or 2: ";
- } while (c > 2 || c < 0);
- if(map[r][c]=='-')
- map[r][c]='X';
- else
- cout<< "Field Already Full. Reinsert"<<endl;
- }while(!map[r][c]=='X');
- for(int i=0;i<3;i++){
- for(int j=0;j<3;j++)
- cout <<map[i][j]<<"|";
- cout<<endl;
- }
- cout<<"\n\n"<<endl;
- if((map[0][0]== 'X' && map[0][1]== 'X' && map[0][2] == 'X')||
- (map[1][0]== 'X' && map[1][1]== 'X' && map[1][2] == 'X')||
- (map[2][0]== 'X' && map[2][1]== 'X' && map[2][2] == 'X')||
- (map[0][0]== 'X' && map[1][0]== 'X' && map[2][0] == 'X')||
- (map[0][1]== 'X' && map[1][1]== 'X' && map[2][1] == 'X')||
- (map[0][2]== 'X' && map[1][2]== 'X' && map[2][2] == 'X')||
- (map[0][0]== 'X' && map[1][1]== 'X' && map[2][2] == 'X')||
- (map[0][2]== 'X' && map[1][1]== 'X' && map[2][0] == 'X' )){
- cout<<p1<<" Won"<<endl;
- p1_count=1;
- break;
- }
- do{
- cout<<p2<< " Turn\n\n"<<endl;
- do{
- cout << "Riga p2: " ;
- cin >> r;
- // check for valid input
- if (r > 2 || r < 0)
- cout << "scegli riga tra 0, 1, or 2 : " ;
- }while (r > 2 || r < 0);
- do{
- cout<<"Colonna p2: " ;
- cin >> c;
- // check for valid input
- if (c > 2 || c < 0)
- cout << "Scegli colonna tra 0, 1, or 2: ";
- } while (c > 2 || c < 0);
- if(map[r][c]=='-')
- map[r][c]='o';
- else
- cout<< "Field Already Full. Reinsert"<<endl;
- }while(map[r][c]=='X');
- for(int i=0;i<3;i++){
- for(int j=0;j<3;j++)
- cout <<map[i][j]<<"|";
- cout<<endl;
- }
- cout<<"\n\n"<<endl;
- if((map[0][0]== 'o' && map[0][1]== 'o' && map[0][2] == 'o')||
- (map[1][0]== 'o' && map[1][1]== 'o' && map[1][2] == 'o')||
- (map[2][0]== 'o' && map[2][1]== 'o' && map[2][2] == 'o')||
- (map[0][0]== 'o' && map[1][0]== 'o' && map[2][0] == 'o')||
- (map[0][1]== 'o' && map[1][1]== 'o' && map[2][1] == 'o')||
- (map[0][2]== 'o' && map[1][2]== 'o' && map[2][2] == 'o')||
- (map[0][0]== 'o' && map[1][1]== 'o' && map[2][2] == 'o')||
- (map[0][2]== 'o' && map[1][1]== 'o' && map[2][0] == 'o' )){
- cout<<p2<<" Won"<<endl;
- p2_count=1;
- break;
- }
- cout<<win<<endl;
- }while(!(win==1));
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment