#include <iostream>
#include <algorithm>
#define SUB(X) X[i]-X[2+i]+X[3-i]
using namespace std;
double cal(double a, double b, double c, double d, double e) {
return a * (1 + b / 100) * ((1 - min(c / 100, 1.0)) + min(c / 100, 1.0) * d / 100) * (1 + e / 100);
}
int main() {
double att[4], str[4], crt[4], crtr[4], spd[4];
double bt[4];
for (int i = 0; i < 4; i++) {
cin >> att[i] >> str[i] >> crt[i] >> crtr[i] >> spd[i];
}
for (int i = 0; i < 2; i++)
bt[i] = cal(att[i], str[i], crt[i], crtr[i], spd[i]);
for (int i = 0; i < 2; i++) {
bt[2 + i] = cal(SUB(att), SUB(str), SUB(crt), SUB(crtr), SUB(spd));
}
cout << (bt[0] == bt[2] ? "0" : bt[0] < bt[2] ? "+" : "-") << endl;
cout << (bt[1] == bt[3] ? "0" : bt[1] < bt[3] ? "+" : "-") << endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1720 KB |
Output is correct |
2 |
Correct |
0 ms |
1720 KB |
Output is correct |
3 |
Correct |
0 ms |
1720 KB |
Output is correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Correct |
0 ms |
1720 KB |
Output is correct |
6 |
Correct |
0 ms |
1720 KB |
Output is correct |
7 |
Correct |
0 ms |
1720 KB |
Output is correct |
8 |
Correct |
0 ms |
1720 KB |
Output is correct |
9 |
Correct |
0 ms |
1720 KB |
Output is correct |
10 |
Correct |
0 ms |
1720 KB |
Output is correct |
11 |
Correct |
0 ms |
1720 KB |
Output is correct |
12 |
Correct |
0 ms |
1720 KB |
Output is correct |
13 |
Correct |
0 ms |
1720 KB |
Output is correct |
14 |
Correct |
0 ms |
1720 KB |
Output is correct |
15 |
Correct |
0 ms |
1720 KB |
Output is correct |
16 |
Correct |
0 ms |
1720 KB |
Output is correct |
17 |
Correct |
0 ms |
1720 KB |
Output is correct |
18 |
Correct |
0 ms |
1720 KB |
Output is correct |
19 |
Correct |
0 ms |
1720 KB |
Output is correct |
20 |
Correct |
0 ms |
1720 KB |
Output is correct |
21 |
Correct |
0 ms |
1720 KB |
Output is correct |
22 |
Correct |
0 ms |
1720 KB |
Output is correct |
23 |
Correct |
0 ms |
1720 KB |
Output is correct |
24 |
Correct |
0 ms |
1720 KB |
Output is correct |
25 |
Correct |
0 ms |
1720 KB |
Output is correct |
26 |
Correct |
0 ms |
1720 KB |
Output is correct |
27 |
Correct |
0 ms |
1720 KB |
Output is correct |
28 |
Correct |
0 ms |
1720 KB |
Output is correct |
29 |
Correct |
0 ms |
1720 KB |
Output is correct |
30 |
Correct |
0 ms |
1720 KB |
Output is correct |
31 |
Correct |
0 ms |
1720 KB |
Output is correct |
32 |
Correct |
0 ms |
1720 KB |
Output is correct |
33 |
Correct |
0 ms |
1720 KB |
Output is correct |
34 |
Correct |
0 ms |
1720 KB |
Output is correct |
35 |
Correct |
0 ms |
1720 KB |
Output is correct |
36 |
Correct |
0 ms |
1720 KB |
Output is correct |
37 |
Correct |
0 ms |
1720 KB |
Output is correct |
38 |
Correct |
0 ms |
1720 KB |
Output is correct |
39 |
Correct |
0 ms |
1720 KB |
Output is correct |
40 |
Correct |
0 ms |
1720 KB |
Output is correct |
41 |
Correct |
0 ms |
1720 KB |
Output is correct |
42 |
Correct |
0 ms |
1720 KB |
Output is correct |
43 |
Correct |
0 ms |
1720 KB |
Output is correct |
44 |
Correct |
0 ms |
1720 KB |
Output is correct |
45 |
Correct |
0 ms |
1720 KB |
Output is correct |
46 |
Correct |
0 ms |
1720 KB |
Output is correct |