#include<cstdio>
#include<algorithm>
int a[4][5];
int t[4][5];
long long calc(int x[])
{
return 1LL*x[0]*(100+x[1])*((100-std::min(x[2],100))*100+std::min(x[2],100)*x[3])*(100+x[4]);
}
int main()
{
int i,j;
for(i=0;i<4;i++)for(j=0;j<5;j++)scanf("%d",&a[i][j]);
for(j=0;j<5;j++)t[2][j]=a[0][j]-a[2][j]+a[3][j];
for(j=0;j<5;j++)t[3][j]=a[1][j]-a[3][j]+a[2][j];
if(calc(a[0])<calc(t[2]))puts("+");
else if(calc(a[0])>calc(t[2]))puts("-");
else puts("0");
if(calc(a[1])<calc(t[3]))puts("+");
else if(calc(a[1])>calc(t[3]))puts("-");
else puts("0");
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
6 |
Correct |
0 ms |
1084 KB |
Output is correct |
7 |
Correct |
0 ms |
1084 KB |
Output is correct |
8 |
Correct |
0 ms |
1084 KB |
Output is correct |
9 |
Correct |
0 ms |
1084 KB |
Output is correct |
10 |
Correct |
0 ms |
1084 KB |
Output is correct |
11 |
Correct |
0 ms |
1084 KB |
Output is correct |
12 |
Correct |
0 ms |
1084 KB |
Output is correct |
13 |
Correct |
0 ms |
1084 KB |
Output is correct |
14 |
Correct |
0 ms |
1084 KB |
Output is correct |
15 |
Correct |
0 ms |
1084 KB |
Output is correct |
16 |
Correct |
0 ms |
1084 KB |
Output is correct |
17 |
Correct |
0 ms |
1084 KB |
Output is correct |
18 |
Correct |
0 ms |
1084 KB |
Output is correct |
19 |
Correct |
0 ms |
1084 KB |
Output is correct |
20 |
Correct |
0 ms |
1084 KB |
Output is correct |
21 |
Correct |
0 ms |
1084 KB |
Output is correct |
22 |
Correct |
0 ms |
1084 KB |
Output is correct |
23 |
Correct |
0 ms |
1084 KB |
Output is correct |
24 |
Correct |
0 ms |
1084 KB |
Output is correct |
25 |
Correct |
0 ms |
1084 KB |
Output is correct |
26 |
Correct |
0 ms |
1084 KB |
Output is correct |
27 |
Correct |
0 ms |
1084 KB |
Output is correct |
28 |
Correct |
0 ms |
1084 KB |
Output is correct |
29 |
Correct |
0 ms |
1084 KB |
Output is correct |
30 |
Correct |
0 ms |
1084 KB |
Output is correct |
31 |
Correct |
0 ms |
1084 KB |
Output is correct |
32 |
Correct |
0 ms |
1084 KB |
Output is correct |
33 |
Correct |
0 ms |
1084 KB |
Output is correct |
34 |
Correct |
0 ms |
1084 KB |
Output is correct |
35 |
Correct |
0 ms |
1084 KB |
Output is correct |
36 |
Correct |
0 ms |
1084 KB |
Output is correct |
37 |
Correct |
0 ms |
1084 KB |
Output is correct |
38 |
Correct |
0 ms |
1084 KB |
Output is correct |
39 |
Correct |
0 ms |
1084 KB |
Output is correct |
40 |
Correct |
0 ms |
1084 KB |
Output is correct |
41 |
Correct |
0 ms |
1084 KB |
Output is correct |
42 |
Correct |
0 ms |
1084 KB |
Output is correct |
43 |
Correct |
0 ms |
1084 KB |
Output is correct |
44 |
Correct |
0 ms |
1084 KB |
Output is correct |
45 |
Correct |
0 ms |
1084 KB |
Output is correct |
46 |
Correct |
0 ms |
1084 KB |
Output is correct |