# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15254 | jeapi | 님 무기가 좀 나쁘시네여 (kriii3_S) | C++98 | 0 ms | 1720 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#define min(a,b) (a)<(b)?(a):(b)
using namespace std;
double power(double A, double B, double C, double D, double E){
double K = A;
double b, c, d;
K = K*(1 + (B / 100));
K = K*(1 + (E/100));
K = K*((1 - min((C / 100), 1)) + (min((C / 100), 1)*(D / 100)));
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);
int e, f, g, h, i;
int 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 |
---|---|---|---|---|
Fetching results... |