-
Notifications
You must be signed in to change notification settings - Fork 0
/
bulgarian.c
128 lines (127 loc) · 2.4 KB
/
bulgarian.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
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
#include "io.inc"
// Target: Simulate a Bulgarian-solitaire game.
// Possible opitimization: Dead code elimination, common expression, inline
// function, loop unrolling, etc. REMARKS: A funny game. If you like, you can
// try to prove that when n=1+2+..+i(i>0), the game will always stop
// and converge to the only solution: {1,2,...i}. :)
int n;
int h;
int now;
int a[100];
int A = 48271;
int M = 2147483647;
int Q;
int R;
int seed = 1;
int random() {
int tempseed = A * (seed % Q) - R * (seed / Q);
if (tempseed >= 0)
seed = tempseed;
else
seed = tempseed + M;
return seed;
}
void initialize(int val) { seed = val; }
void swap(int x, int y) {
int temp = a[x];
a[x] = a[y];
a[y] = temp;
}
int pd(int x) {
for (; h <= x; ++h)
if (x == h * (h + 1) / 2)
return 1;
return 0;
}
void show() {
int i;
for (i = 0; i < now; ++i) {
printInt(a[i]);
}
}
int win() {
int i;
int j;
int b[100];
int temp;
if (now != h)
return 0;
for (j = 0; j < now; ++j)
b[j] = a[j];
for (i = 0; i < now - 1; ++i)
for (j = i + 1; j < now; ++j)
if (b[i] > b[j]) {
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
for (i = 0; i < now; ++i)
if (b[i] != i + 1)
return 0;
return 1;
}
void merge() {
int i;
for (i = 0; i < now; ++i)
if (a[i] == 0) {
int j;
for (j = i + 1; j < now; ++j)
if (a[j] != 0) {
swap(i, j);
break;
}
}
for (i = 0; i < now; ++i)
if (a[i] == 0) {
now = i;
break;
}
}
void move() {
int i = 0;
for (; i < now;) {
--a[i];
i = i + 1;
}
a[now] = now;
now++;
}
int main() {
int i = 0;
int temp = 0;
int count = 0;
n = 3 * 7 * 10;
h = 0;
Q = M / A;
R = M % A;
if (!pd(n)) {
// println("Sorry, the number n must be a number s.t. there exists i "
// "satisfying n=1+2+...+i");
return 1;
}
// println("Let's start!");
initialize(3654898);
now = random() % 10 + 1;
printInt(now);
for (; i < now - 1; ++i) {
a[i] = random() % 10 + 1;
while (a[i] + temp > n)
a[i] = random() % 10 + 1;
temp = temp + a[i];
}
a[now - 1] = n - temp;
show();
merge();
while (!win()) {
// print("step ");
printInt(++count);
// println(":");
move();
merge();
show();
}
// print("Total: ");
printInt(count);
// println(" step(s)");
return judgeResult % Mod; // 159
}