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