oj.uz

Submission #15430

# Submission time Handle Problem Language Result Execution time Memory
15430 2015-07-12T07:35:50 Z pichulia 님 무기가 좀 나쁘시네여 (kriii3_S) C++
29 / 29
 0 ms 1084 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;
struct A{
	int a,b,c,d,e;
}p,q,r,s,t,u;
double cal(A x)
{
	long long int res;
	long long int xx = min(100,x.c);
	res = (100-xx)*100 + xx*x.d;
	res *= x.a * (100+x.b);
	res *= (100+x.e);
	return res;
}
int main()
{
	scanf("%d %d %d %d %d",&p.a,&p.b,&p.c,&p.d,&p.e);
	scanf("%d %d %d %d %d",&q.a,&q.b,&q.c,&q.d,&q.e);
	scanf("%d %d %d %d %d",&r.a,&r.b,&r.c,&r.d,&r.e);
	scanf("%d %d %d %d %d",&s.a,&s.b,&s.c,&s.d,&s.e);
	t.a = p.a - r.a + s.a;
	t.b = p.b - r.b + s.b;
	t.c = p.c - r.c+ s.c;
	t.d = p.d - r.d+ s.d;
	t.e = p.e - r.e+ s.e;
	u.a = q.a + r.a - s.a;
	u.b = q.b + r.b - s.b;
	u.c = q.c + r.c- s.c;
	u.d = q.d + r.d- s.d;
	u.e = q.e + r.e- s.e;
	long long int pk,ak;
	pk = cal(p); ak = cal(t);
	printf("%c\n",pk < ak ?'+':pk > ak?'-':'0');
	pk = cal(q); ak = cal(u);
	printf("%c\n",pk < ak ?'+':pk > ak?'-':'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