-
Notifications
You must be signed in to change notification settings - Fork 0
/
cell.c
89 lines (73 loc) · 1.16 KB
/
cell.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
void idup(int *head, int *next, const int WIDTH)
{
int i;
for(i = 0; i < WIDTH; i++){
head[i] = next[i];
}
}
void pp(int head[], const int WIDTH)
{
int i;
for(i = 0; i < WIDTH; i++){
if(head[i])
{
printf("#");
}
else
{
printf(" ");
}
//printf("%d ", head[i]);
}
printf("\n");
}
void generation(int *head, int *next, const int *RULES, const int WIDTH)
{
int i;
int idx;
int x,y,z;
for(i = 1; i < WIDTH-1; i++)
{
x = 4*head[i-1];
y = 2*head[i];
z = head[i+1];
idx = z + x + y;
//printf("%d \n",head[i+1] );
next[i] = RULES[7-idx];
continue;
}
}
int main(int argc, char *argv[])
{
size_t age;
if(argc == 2)
{
char *a = argv[1];
age = atoi(a);
}
else
{
age = 50;
}
const int WIDTH = 2*age +1;
const int RULES[] = {1,0,1,1,0,1,1,1};
int head[WIDTH];
int i;
for(i = 0; i < WIDTH; i++){
head[i] = 0;
}
head[((WIDTH)/2)] = 1;
int next[WIDTH];
idup(next, head, WIDTH);
for(i = 0; i < age; i++)
{
pp(head, WIDTH);
generation(head, next, RULES, WIDTH);
idup(head, next, WIDTH);
}
return 0;
}