| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 15492 | tonyjjw | 님 무기가 좀 나쁘시네여 (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<stdio.h>
long long int a[8][5];
long long int pavv[8];
int main(){
	int i,j;
	for(i=0;i<4;i++){
		for(j=0;j<5;j++){
			scanf("%lld",&a[i][j]);
		}
	}
	for(i=4;i<6;i++){
		for(j=0;j<5;j++){
			a[i][j]=a[i-4][j]-a[i-2][j];
		}
	}
	for(i=4;i<6;i++){
		for(j=0;j<5;j++){
			a[i][j]=a[i-4][j]-a[i-2][j];
		}
	}
	for(i=6;i<8;i++){
		for(j=0;j<5;j++){
			a[i][j]=a[i-2][j]+a[9-i][j];
		}
	}
	for(i=0;i<8;i++){
		if(a[i][2]>100)a[i][2]=100;
		pavv[i]=a[i][0]*(100+a[i][1])*((100-a[i][2])*100+a[i][2]*a[i][3])*(100+a[i][4]);
	}
	if(pavv[6]>pavv[0])puts("+");
	if(pavv[6]==pavv[0])puts("0");
	if(pavv[6]<pavv[0])puts("-");
	if(pavv[7]>pavv[1])puts("+");
	if(pavv[7]==pavv[1])puts("0");
	if(pavv[7]<pavv[1])puts("-");
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
