# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15187 | kyma123 | 님 무기가 좀 나쁘시네여 (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>
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |