oj.uz

Submission #15445

# Submission time Handle Problem Language Result Execution time Memory
15445 2015-07-12T07:48:07 Z tlwpdus 님 무기가 좀 나쁘시네여 (kriii3_S) C++
29 / 29
 0 ms 1084 KB 
#include<stdio.h>
#include<math.h>

using namespace std;

double arr[4][5];
double cri, pab;

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

double calc(double a, double b, double c, double d, double e) {
	return a*(1 + b / 100)*(1 - mini(1, c) + mini(1, c)*d)*(1 + e);
}

void input() {
	int i, j;
	for (i = 0; i < 4; i++) {
		scanf("%lf %lf %lf %lf %lf",&arr[i][0],&arr[i][1],&arr[i][2],&arr[i][3],&arr[i][4]);
		arr[i][3] /= 100;
		arr[i][4] /= 100;
		arr[i][2] /= 100;
	}
		for (j = 0; j < 5; j++) {
			double t = arr[0][j] - arr[2][j] + arr[3][j];
			arr[3][j] = arr[1][j] - arr[3][j] + arr[2][j];
			arr[2][j] = t;
		}
	double a, b;
	a = calc(arr[0][0], arr[0][1], arr[0][2], arr[0][3], arr[0][4]), b = calc(arr[2][0], arr[2][1], arr[2][2], arr[2][3], arr[2][4]);
	if (a - b<1e-7&&a - b>-1e-7) printf("0\n");
	else if (a - b>1e-7) printf("-\n");
	else printf("+\n");
	a = calc(arr[1][0], arr[1][1], arr[1][2], arr[1][3], arr[1][4]), b = calc(arr[3][0], arr[3][1], arr[3][2], arr[3][3], arr[3][4]);
	if (a - b<1e-7&&a - b>-1e-7) printf("0\n");
	else if (a - b>1e-7) printf("-\n");
	else printf("+\n");
}

int main() {
	input();
	return 0;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory 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