-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1G.c
38 lines (35 loc) · 773 Bytes
/
1G.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
#include<stdio.h>
int j(int a[]);
int main()
{
int a[8], i;
for(i = 0; i < 6; i++){
scanf("%d", &a[i]);
}
while(j(a)){
int sum = 0, r2, r1;
sum = a[5] + a[4] + a[3] + (a[2] + 3) / 4;
int si[] = {0, 5, 3, 1};
r2 = 5 * a[3] + si[a[2] % 4];
if(r2 < a[1]){
sum += (a[1] - r2 + 8) / 9;
}
r1 = 36 * sum - 36 * a[5] - 25 * a[4] - 16 * a[3] - 9 * a[2] - 4 * a[1];
if(a[0] > r1){
sum += (a[0] - r1 + 35) / 36;
}
printf("%d\n", sum);
for(i = 0; i < 6; i++){
scanf("%d", &a[i]);
}
}
return 0;
}
int j(int a[]){
for(int i = 0; i < 6; i++){
if(a[i]){
return 1;
}
}
return 0;
}