# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18564 | eaststar | 님 무기가 좀 나쁘시네여 (kriii3_S) | C++14 | 0 ms | 1084 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 <stdio.h>
#include <algorithm>
using namespace std;
double a[4][5],s,t;
int main(){
int i,j;
for(i=0;i<4;++i){
for(j=0;j<5;++j)scanf("%lf",a[i]+j),a[i][j]/=100;
a[i][0]*=100;
}
s=a[0][0]*(1+a[0][1])*((1-min(a[0][2],1.0))+min(a[0][2],1.0)*a[0][3])*(1+a[0][4]);
for(i=0;i<5;++i)a[0][i]-=a[2][i]-a[3][i];
t=a[0][0]*(1+a[0][1])*((1-min(a[0][2],1.0))+min(a[0][2],1.0)*a[0][3])*(1+a[0][4]);
puts(s>t?"-":(s<t?"+":"0"));
s=a[1][0]*(1+a[1][1])*((1-min(a[1][2],1.0))+min(a[1][2],1.0)*a[1][3])*(1+a[1][4]);
for(i=0;i<5;++i)a[1][i]-=a[3][i]-a[2][i];
t=a[1][0]*(1+a[1][1])*((1-min(a[1][2],1.0))+min(a[1][2],1.0)*a[1][3])*(1+a[1][4]);
puts(s>t?"-":(s<t?"+":"0"));
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |