oj.uz

답안 #15277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15277 2015-07-12T05:13:53 Z skeksk91 님 무기가 좀 나쁘시네여 (kriii3_S) C++
29 / 29
 0 ms 1084 KB 
#include<stdio.h>

double min(double a, double b) {
	if (a < b) {
		return a;
	}
	return b;
}


struct node {
	double a;
	double b;
	double c;
	double d;
	double e;
	node(double a=0, double b=0, double c=0, double d=0, double e=0) :a(a), b(b), c(c), d(d), e(e) {}
	node operator+(const node& p){
		return node(a + p.a, b + p.b, c + p.c, d + p.d, e + p.e);
	}
	node operator-(const node& p) {
		return node(a - p.a, b - p.b, c - p.c, d - p.d, e - p.e);
	}
	double ju() {
		return a*(1 + (b / 100))*((1 - min(c/100, 1)) + min(c/100, 1)*d/100)*(1 + e/100);
	}
};

int main() {
	node cri, pabu, criW, pabuW;
	scanf("%lf%lf%lf%lf%lf", &cri.a, &cri.b, &cri.c, &cri.d, &cri.e);
	scanf("%lf%lf%lf%lf%lf", &pabu.a, &pabu.b, &pabu.c, &pabu.d, &pabu.e);
	scanf("%lf%lf%lf%lf%lf", &criW.a, &criW.b, &criW.c, &criW.d, &criW.e);
	scanf("%lf%lf%lf%lf%lf", &pabuW.a, &pabuW.b, &pabuW.c, &pabuW.d, &pabuW.e);
	if ((cri - criW + pabuW).ju()>cri.ju()) {
		printf("+\n");
	}
	else if ((cri - criW + pabuW).ju()<cri.ju()) {
		printf("-\n");
	}
	else {
		printf("0\n");
	}
	if ((pabu - pabuW + criW).ju()>pabu.ju()) {
		printf("+\n");
	}
	else if ((pabu - pabuW + criW).ju()<pabu.ju()) {
		printf("-\n");
	}
	else {
		printf("0\n");
	}
}

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