oj.uz

답안 #18564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18564 2016-02-09T06:49:45 Z eaststar 님 무기가 좀 나쁘시네여 (kriii3_S) C++14
29 / 29
 0 ms 1084 KB 
#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;
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 0 ms 1084 KB Output is correct
20 Correct 0 ms 1084 KB Output is correct
21 Correct 0 ms 1084 KB Output is correct
22 Correct 0 ms 1084 KB Output is correct
23 Correct 0 ms 1084 KB Output is correct
24 Correct 0 ms 1084 KB Output is correct
25 Correct 0 ms 1084 KB Output is correct
26 Correct 0 ms 1084 KB Output is correct
27 Correct 0 ms 1084 KB Output is correct
28 Correct 0 ms 1084 KB Output is correct
29 Correct 0 ms 1084 KB Output is correct
30 Correct 0 ms 1084 KB Output is correct
31 Correct 0 ms 1084 KB Output is correct
32 Correct 0 ms 1084 KB Output is correct
33 Correct 0 ms 1084 KB Output is correct
34 Correct 0 ms 1084 KB Output is correct
35 Correct 0 ms 1084 KB Output is correct
36 Correct 0 ms 1084 KB Output is correct
37 Correct 0 ms 1084 KB Output is correct
38 Correct 0 ms 1084 KB Output is correct
39 Correct 0 ms 1084 KB Output is correct
40 Correct 0 ms 1084 KB Output is correct
41 Correct 0 ms 1084 KB Output is correct
42 Correct 0 ms 1084 KB Output is correct
43 Correct 0 ms 1084 KB Output is correct
44 Correct 0 ms 1084 KB Output is correct
45 Correct 0 ms 1084 KB Output is correct
46 Correct 0 ms 1084 KB Output is correct