# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
15264 |
2015-07-12T05:01:40 Z |
jeapi |
님 무기가 좀 나쁘시네여 (kriii3_S) |
C++ |
|
0 ms |
1720 KB |
#include<iostream>
using namespace std;
double power(double A, double B, double C, double D, double E){
double K = A;
B = B / 100;
C = C / 100;
if (C > 1)
C = 1.0;
D = D / 100;
E = E / 100;
K = A*(1 + B)*(1 + E)*((1-C)+(C*D));
return K;
}
void find(double x, double y){
if (x > y)
cout << '-' << endl;
else if (x == y)
cout << 0 << endl;
else
cout << '+' << endl;
}
int main(){
double a, b, c, d, x;
double A, B, C, D, X;
cin >> a >> b >> c >> d >> x;
cin >> A >> B >> C >> D >> X;
double cre = power(a, b, c, d, x);
double pu = power(A, B, C, D, X);
double e, f, g, h, i;
double E, F, G, H, I;
cin >> e >> f >> g >> h >> i;
cin >> E >> F >> G >> H >> I;
double recre = power(a - e + E, b - f + F, c - g + G, d - h + H, x - i + I);
double repu = power(A + e - E, B + f - F, C + g - G, D +h - H, X +i - I);
find(cre, recre);
find(pu, repu);
return 0;
}
# |
Verdict |
Execution time |
Memory |
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 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |