File tree Expand file tree Collapse file tree 1 file changed +72
-0
lines changed Expand file tree Collapse file tree 1 file changed +72
-0
lines changed Original file line number Diff line number Diff line change
1
+ /*每输入一个1或0后回车,1代表X,0代表O,注意:填充顺序是一行填完三个后,继续下一行如:
2
+ 1
3
+ 0
4
+ 1
5
+ 0
6
+ 1
7
+ 0
8
+ 0
9
+ 1
10
+ 0
11
+ 表示:101
12
+ 010
13
+ 010 */
14
+ //代码如下:
15
+ #include <stdio.h>
16
+ int main(){
17
+ const int size = 3;
18
+ int board[size][size];
19
+ int i,j;
20
+ int numOfX,numOfO;
21
+ int numOfXX,numOfOO;
22
+ int result = -1; // -1:没人赢,1:X赢,0:O赢。
23
+ //读入矩阵
24
+ for (i = 0;i<size;i++){
25
+ for(j=0;j<size;j++){
26
+ scanf("%d",&board[i][j]);
27
+ }
28
+ }
29
+ for(i=0;i<size && result == -1;i++){
30
+ numOfO = numOfX = numOfOO = numOfXX = 0;
31
+ for (j=0;j<size;j++){
32
+ if (board[i][j]==1){
33
+ numOfX ++;
34
+ } else if(board [i][j] == 0) {
35
+ numOfO ++;
36
+ }
37
+ if (board[j][i]==1){
38
+ numOfXX++;
39
+ } else if (board[j][i]==0){
40
+ numOfOO++;
41
+ }
42
+ }
43
+ if (numOfO == size || numOfOO == size){
44
+ result = 0;
45
+ } else if(numOfX == size || numOfXX == size){
46
+ result = 1;
47
+ }
48
+ }
49
+ if (result == -1){
50
+ numOfX = numOfO = numOfOO = numOfXX = 0;
51
+ for(i=0;i<size;i++){
52
+ if (board[i][i] == 1){
53
+ numOfX ++;
54
+ } else if(board[i][i]==0){
55
+ numOfO ++;
56
+ }
57
+ if (board[i][size-i-1] == 1){
58
+ numOfXX ++;
59
+ } else if (board[i][size-i-1] == 0){
60
+ numOfOO ++;
61
+ }
62
+
63
+ }
64
+ if (numOfO == size || numOfOO == size){
65
+ result = 0;
66
+ } else if(numOfX == size || numOfXX == size){
67
+ result = 1;
68
+ }
69
+ }
70
+ printf("%d",result);
71
+ return 0;
72
+ }
You can’t perform that action at this time.
0 commit comments