-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathheader.c
51 lines (42 loc) · 1.13 KB
/
header.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <stdio.h>
#include "header.h"
#include <sys/msg.h>
#include <stdlib.h>
#include <string.h>
void display(shared * data)
{
printf("\n\n");
printf(" %c | %c | %c\n", data->grid[0][0], data->grid[0][1], data->grid[0][2]);
printf("---|---|---\n");
printf(" %c | %c | %c\n", data->grid[1][0], data->grid[1][1], data->grid[1][2]);
printf("---|---|---\n");
printf(" %c | %c | %c\n", data->grid[2][0], data->grid[2][1], data->grid[2][2]);
}
void initialize(shared* data)
{
int i=0,j=0,c=0;
for ( i=0 ; i < 3 ; i++ )
{
for ( j=0 ; j < 3 ; j++ )
{
data->grid[i][j] = 49 + c++;
}
}
data->count = 0;
}
int check(shared* data)
{
int i;
if (data->grid[0][0] == data->grid[1][1] && data->grid[0][0] == data->grid[2][2] ||
(data->grid[0][2] == data->grid[1][1] && data->grid[0][2] == data->grid[2][0]))
return 1;
for (i = 0; i < 3; i++)
if (data->grid[i][0] == data->grid[i][1] && data->grid[i][0] == data->grid[i][2] ||
(data->grid[0][i] == data->grid[1][i] && data->grid[0][i] == data->grid[2][i]))
return 1;
return 0;
}
void clear()
{
printf("\e[1;1H\e[2J");
}