oj.uz

Submission #15179

# Submission time Handle Problem Language Result Execution time Memory
15179 2015-07-12T03:22:08 Z sujin 님 무기가 좀 나쁘시네여 (kriii3_S) C++
29 / 29
 0 ms 1084 KB 
#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <math.h>
#include <algorithm>

using namespace std;

struct stats{
	int atk;
	int str;
	int crt;
	int crd;
	int spd;

	stats(){}
	stats(int a, int s1, int c1, int c2, int s2) :
		atk(a), str(s1), crt(c1), crd(c2), spd(s2){}

	stats operator+(stats s){
		return stats(atk + s.atk, str + s.str,
			crt + s.crt, crd + s.crd, spd + s.spd);
	}

	stats operator-(stats s){
		return stats(atk - s.atk, str - s.str,
			crt - s.crt, crd - s.crd, spd - s.spd);
	}

	void get(){
		scanf("%d %d %d %d %d", &atk, &str, &crt, &crd, &spd);
	}

	double power(){
		return atk * (1 + str / 100.0) * ((1 - min(crt / 100.0, 1.0)) + min(crt / 100.0, 1.0) * crd / 100.0) * (1 + spd / 100.0);
	}
};

int main(){
	stats kriii, pabu;
	stats nkriii, npabu;

	kriii.get();
	pabu.get();
	nkriii.get();
	npabu.get();

	double pPk = kriii.power();
	double pPp = pabu.power();

	kriii = kriii - nkriii + npabu;
	pabu = pabu - npabu + nkriii;

	double nPk = kriii.power();
	double nPp = pabu.power();

	printf("%c\n", pPk == nPk ? '0' : (pPk > nPk ? '-' : '+'));
	printf("%c\n", pPp == nPp ? '0' : (pPp > nPp ? '-' : '+'));

	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