# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15171 | gs13068 | 님 무기가 좀 나쁘시네여 (kriii3_S) | C++98 | 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<cstdio>
#include<algorithm>
int a[4][5];
int t[4][5];
long long calc(int x[])
{
return 1LL*x[0]*(100+x[1])*((100-std::min(x[2],100))*100+std::min(x[2],100)*x[3])*(100+x[4]);
}
int main()
{
int i,j;
for(i=0;i<4;i++)for(j=0;j<5;j++)scanf("%d",&a[i][j]);
for(j=0;j<5;j++)t[2][j]=a[0][j]-a[2][j]+a[3][j];
for(j=0;j<5;j++)t[3][j]=a[1][j]-a[3][j]+a[2][j];
if(calc(a[0])<calc(t[2]))puts("+");
else if(calc(a[0])>calc(t[2]))puts("-");
else puts("0");
if(calc(a[1])<calc(t[3]))puts("+");
else if(calc(a[1])>calc(t[3]))puts("-");
else puts("0");
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |