Skip to content

Instantly share code, notes, and snippets.

@henrybear327
Last active August 29, 2015 14:18
Show Gist options
  • Select an option

  • Save henrybear327/809a1b88a169cf2d57a5 to your computer and use it in GitHub Desktop.

Select an option

Save henrybear327/809a1b88a169cf2d57a5 to your computer and use it in GitHub Desktop.
ITSA problem 2.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
while(1) {
int data[3][3];
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 3; j++) {
if(scanf("%d", &data[i][j]) == EOF) {
return 0;
}
}
}
char *map = "*YX";
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 3; j++) {
printf("%c", map[data[i][j]]);
}
printf("\n");
}
if((data[0][0] == data[1][1] && data[1][1] == data[2][2]) || (data[0][2] == data[1][1] && data[1][1] == data[2][0])) {
if(data[1][1] != 0) {
printf("%c bingle\n", map[data[1][1]]);
continue;
}
}
int flag = 0;
for(int i = 0; i < 3; i++) {
if(data[i][0] == data[i][1] && data[i][1] == data[i][2]) {
if(data[i][0] != 0) {
printf("%c bingle\n", map[data[i][0]]);
flag = 1;
break;
}
}
}
if(flag == 1)
continue;
for(int i = 0; i < 3; i++) {
if(data[0][i] == data[1][i] && data[1][i] == data[2][i]) {
if(data[0][i] != 0) {
printf("%c bingle\n", map[data[1][i]]);
flag = 1;
break;
}
}
}
if(flag == 1)
continue;
printf("Tie\n");
}
return 0;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment