#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
double battle(int *a)
{
double ret;
double attack = a[0];
double power = a[1];
double crit_per = a[2] / 100.0;
double crit_pow = a[3] / 100.0;
double speed = a[4] / 100.0;
ret = attack * (1.0 + (power / 100.0)) * ((1.0 - min(crit_per, 1.0)) + min(crit_per, 1.0) * crit_pow) * (1.0 + speed);
return ret;
}
int main()
{
int a[2][5];
for(int i=0; i < 2; i++)
for(int j=0; j < 5; j++)
cin >> a[i][j];
int b[2][5];
for(int i=0; i < 2; i++)
for(int j=0; j < 5; j++)
cin >> b[i][j];
for(int i=0; i < 2; i++)
{
double before = battle(a[i]);
for(int j=0; j < 5; j++)
{
a[i][j] -= b[i][j];
a[i][j] += b[i^1][j];
}
double after = battle(a[i]);
if(after < before)
cout << "-" << "\n";
else if(after - before < 1e-6)
cout << "0" << "\n";
else
cout << "+" << "\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
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 |