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
|
int arr1[10][2][3][4][5][6][2];
int arr2[10][2][3][2][4][8][7];
void loop1(int x, int y) {
int a, b, c, d, e, f, g;
a = 0;
while (a < x && a < y) {
b = 0;
while (b < 2) {
c = 0;
while (c < 3) {
d = 0;
while (d < 4) {
e = 0;
while (e < 5) {
f = 0;
while (f < 6) {
g = 0;
while (g < 2) {
arr1[a][b][c][d][e][f][g] = a + b + c + d + e + f + g + x + y;
g = g + 1;
}
f = f + 1;
}
e = e + 1;
}
d = d + 1;
}
c = c + 1;
}
b = b + 1;
}
a = a + 1;
}
}
void loop2() {
int a, b, c, d, e, f, g;
a = 0;
while (a < 10) {
b = 0;
while (b < 2) {
c = 0;
while (c < 3) {
d = 0;
while (d < 2) {
e = 0;
while (e < 4) {
f = 0;
while (f < 8) {
g = 0;
while (g < 7) {
arr2[a][b][c][d][e][f][g] = a + b + d + g;
g = g + 1;
}
f = f + 1;
}
e = e + 1;
}
d = d + 1;
}
c = c + 1;
}
b = b + 1;
}
a = a + 1;
}
}
int loop3(int h, int i, int j, int k, int l, int m, int n) {
int a, b, c, d, e, f, g;
int ans = 0;
a = 0;
while (a < 10) {
b = 0;
while (b < 100) {
c = 0;
while (c < 1000) {
d = 0;
while (d < 10000) {
e = 0;
while (e < 100000) {
f = 0;
while (f < 1000000) {
g = 0;
while (g < 10000000) {
ans = ans % 817 + arr1[a][b][c][d][e][f][g] + arr2[a][b][c][d][e][f][g];
g = g + 1;
if (g >= n) break;
}
f = f + 1;
if (f >= m) break;
}
e = e + 1;
if (e >= l) break;
}
d = d + 1;
if (d >= k) break;
}
c = c + 1;
if (c >= j) break;
}
b = b + 1;
if (b >= i) break;
}
a = a + 1;
if (a >= h) break;
}
return ans;
}
int main() {
int x = getint();
int y = getint();
int h = getint();
int i = getint(), j = getint();
int k = getint();
int l = getint();
int m = getint();
int n = getint();
loop1(x, y);
loop2();
return loop3(h, i, j, k, l, m, n);
}
|
