oj.uz

Submission #15400

# Submission time Handle Problem Language Result Execution time Memory
15400 2015-07-12T07:07:14 Z cki86201 님 무기가 좀 나쁘시네여 (kriii3_S) C++
29 / 29
 0 ms 1084 KB 
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<algorithm>
using namespace std;

double p[4][5];
double Get(double a, double b, double c, double d, double e){
	return a * (1 + b / 100.0) * ((1 - min(c, 1.0)) + min(c, 1.0) * d) * (1 + e);
}

double ABS(double x){
	return x > 0 ? x : -x;
}

void print(double x, double y){
	if (ABS(x - y) < 1e-10)printf("0\n");
	else if (x < y)printf("+\n");
	else printf("-\n");
}

int main(){
	for (int i = 0; i < 4; i++){
		for (int j = 0; j < 5; j++)scanf("%lf", p[i] + j);
		p[i][2] /= 100;
		p[i][3] /= 100;
		p[i][4] /= 100;
	}
	double q[5];
	for (int i = 0; i < 5; i++)q[i] = p[2][i] - p[3][i];
	double K1 = Get(p[0][0], p[0][1], p[0][2], p[0][3], p[0][4]);
	double K2 = Get(p[0][0] - q[0], p[0][1] - q[1], p[0][2] - q[2], p[0][3] - q[3], p[0][4] - q[4]);
	double K3 = Get(p[1][0], p[1][1], p[1][2], p[1][3], p[1][4]);
	double K4 = Get(p[1][0] + q[0], p[1][1] + q[1], p[1][2] + q[2], p[1][3] + q[3], p[1][4] + q[4]);
	print(K1, K2);
	print(K3, K4);
	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