-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathp12157.cpp
34 lines (33 loc) · 854 Bytes
/
p12157.cpp
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
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int a[20], i, j, k, n, t, p1, p2, count, total1, total2;
scanf("%d", &t);
for(i=1; i<=t; i++) {
scanf("%d", &n);
p1 = p2 = 0;
for(j=0; j<n; j++) {
count = 1;
scanf("%d", &a[j]);
for(k=29; k<a[j]; k+=30) {
count++;
}
p1 += 10*count;
if(count%2==0) {
p2 += 15*(count/2);
}else if(count%2==1) {
p2 += 15*(count/2+1);
}
}
printf("Case %d: ", i);
if(p1==p2) {
printf("Mile Juice %d\n", p1);
}else if(p1>p2) {
printf("Juice %d\n", p2);
}else if(p2>p1) {
printf("Mile %d\n", p1);
}
}
}