#include<cstdio>
#include<algorithm>
long long calc(long long a,long long b,long long c,long long d,long long e)
{
c=std::min(100LL,c);
return a*(100+b)*((100-c)*100+c*d)*(100+e);
}
int main()
{
long long KA,KB,KC,KD,KE;
long long FA,FB,FC,FD,FE;
long long nA,nB,nC,nD,nE;
long long mA,mB,mC,mD,mE;
scanf("%lld%lld%lld%lld%lld",&KA,&KB,&KC,&KD,&KE);
scanf("%lld%lld%lld%lld%lld",&FA,&FB,&FC,&FD,&FE);
scanf("%lld%lld%lld%lld%lld",&nA,&nB,&nC,&nD,&nE);
scanf("%lld%lld%lld%lld%lld",&mA,&mB,&mC,&mD,&mE);
long long A=calc(KA,KB,KC,KD,KE);
long long B=calc(FA,FB,FC,FD,FE);
long long C=calc(KA-nA+mA,KB-nB+mB,KC-nC+mC,KD-nD+mD,KE-nE+mE);
long long D=calc(FA-mA+nA,FB-mB+nB,FC-mC+nC,FD-mD+nD,FE-mE+nE);
if(A>C) puts("-");
else if(A==C) puts("0");
else puts("+");
if(B>D) puts("-");
else if(B==D) puts("0");
else puts("+");
return 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 |