| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15201 |
2015-07-12T03:45:18 Z |
xhae |
님 무기가 좀 나쁘시네여 (kriii3_S) |
C++14 |
|
0 ms |
1084 KB |
#include <cstdio>
#include <algorithm>
using namespace std;
long long calc(long long a, long long p, long long cp, long long cr, long long ar) {
return a * (100 + p) * ( (100 - min(cp, 100ll))*100 + min(cp, 100ll) * (cr) ) * (100 + ar);
}
int main(){
int k1,k2,k3,k4,k5;
int p1,p2,p3,p4,p5;
int u1,u2,u3,u4,u5;
int v1,v2,v3,v4,v5;
scanf("%d%d%d%d%d",&k1,&k2,&k3,&k4,&k5);
scanf("%d%d%d%d%d",&p1,&p2,&p3,&p4,&p5);
scanf("%d%d%d%d%d",&u1,&u2,&u3,&u4,&u5);
scanf("%d%d%d%d%d",&v1,&v2,&v3,&v4,&v5);
long long korig = calc(k1, k2, k3, k4, k5);
long long porig = calc(p1, p2, p3, p4, p5);
long long knew = calc(k1-u1+v1, k2-u2+v2, k3-u3+v3, k4-u4+v4, k5-u5+v5);
long long pnew = calc(p1+u1-v1, p2+u2-v2, p3+u3-v3, p4+u4-v4, p5+u5-v5);
puts( korig == knew ? "0" : (korig < knew ? "+": "-"));
puts( porig == pnew ? "0" : (porig < pnew ? "+": "-"));
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 |
