-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLife.cpp
More file actions
140 lines (129 loc) · 2.87 KB
/
Life.cpp
File metadata and controls
140 lines (129 loc) · 2.87 KB
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include <iostream>
#include <ctime>
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
//entering numbers
int size;
cin >> size;
int n;
cin >> n;
int steps;
cin >> steps;
//create a field
int**field = new int*[size + 4];
for (int i = 0; i <= size + 3; ++i) {
field[i] = new int[size + 4];
}
for (int i = 0; i <= size + 3; ++i) {
for (int j = 0; j <= size + 3; ++j) {
field[i][j] = 0;
}
}
srand(time(0));
int *source = new int[size*size];
for (int i = 0; i < size*size; ++i) {
source[i] = i;
}
for (int i = 0; i < size*size; ++i) {
int j = rand() % (i + 1);
int t = source[i];
source[i] = source[j];
source[j] = t;
}
for (int i = 0; i < n; ++i) {
int x = source[i] % size;
int y = source[i] / size;
field[y + 2][x + 2] = 1;
}
delete[] source;
//simulation
int born = 0;
int death = 0;
int population = n;
int number = -1;
bool f2 = true;
int prev = -1;
for (int k = 1; k <= steps; ++k) {
bool f = false;
int x0 = 0;
int y0 = 0;
int**ChField = new int*[size + 4];
for (int i = 0; i <= size + 3; ++i) {
ChField[i] = new int[size + 4];
}
for (int i = 0; i <= size + 3; ++i) {
for (int j = 0; j <= size + 3; ++j) {
ChField[i][j] = field[i][j];
}
}
for (int j = 1; j <= size + 2; ++j) {
for (int i = 1; i <= size + 2; ++i) {
int count = field[j - 1][i] + field[j - 1][i - 1] + field[j][i - 1]
+ field[j + 1][i - 1] + field[j + 1][i] + field[j + 1][i + 1] + field[j][i + 1] + field[j - 1][i + 1];
if ((field[j][i] == 1) && (count != 2) && (count != 3)) {
ChField[j][i] = 0;
death++;
population--;
}
if ((field[j][i] == 0) && (count == 3)) {
ChField[j][i] = 1;
born++;
population++;
if ((i == 1) || (j == 1) || (i == size + 2) || (j == size + 2)) {
f = true;
}
}
}
}
int oldsize = size;
if (f) {
x0 = size / 2;
y0 = size / 2;
size *= 2;
}
delete[] field;
field = new int*[size + 4];
for (int i = 0; i <= size + 3; ++i) {
field[i] = new int[size + 4];
}
for (int i = 0; i <= size + 3; ++i) {
for (int j = 0; j <= size + 3; ++j) {
field[i][j] = 0;
}
}
for (int i = 1; i <= oldsize + 2; ++i) {
for (int j = 1; j <= oldsize + 2; ++j) {
field[j + y0][i + x0] = ChField[j][i];
}
}
delete[] ChField;
if (k % 10 == 0) {
cout << "Step " << k << endl;
if (death != 0)
{
cout << "born/death:" << (double)born / (double)death << endl;
}
else
{
cout << "born/death:" << 0 << endl;
}
born = 0;
death = 0;
cout << "population:" << population << endl;
}
if (prev != population) {
f2 = true;
number = -1;
}
if ((prev == population) && (f2)) {
f2 = false;
number = k;
}
prev = population;
}
cout << "total population:" << population << endl;
if (number != -1) cout << "is not changed after " << number;
delete[] field;
return 0;
}