oj.uz

Submission #15228

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


long long min(long long a,long long b){
        return a < b ? a : b;
}

long long get_power(long long attack, long long str, long long crit, long long critdmg, long long speed) {
        return attack * (100 + str) * (10000 - min(crit*100, 10000) + (min(crit, 100) * critdmg)) * (100 + speed);
}

int main()
{
        long long ka, kb, kc, kd, ke;
        long long pa, pb, pc, pd, pe;

        long long ia, ib, ic, id, ie;
        long long ja, jb, jc, jd, je;

        scanf("%lld %lld %lld %lld %lld", &ka, &kb, &kc, &kd, &ke);
        scanf("%lld %lld %lld %lld %lld", &pa, &pb, &pc, &pd, &pe);

        scanf("%lld %lld %lld %lld %lld", &ia, &ib, &ic, &id, &ie);
        scanf("%lld %lld %lld %lld %lld", &ja, &jb, &jc, &jd, &je);

        long long k1, k2;

        k1 = get_power(ka,kb,kc,kd,ke);
        k2 = get_power(ka-ia+ja,kb-ib+jb,kc-ic+jc,kd-id+jd,ke-ie+je);

        long long p1, p2;

        p1 = get_power(pa,pb,pc,pd,pe);
        p2 = get_power(pa+ia-ja,pb+ib-jb,pc+ic-jc,pd+id-jd,pe+ie-je);

        //printf("%lld\n%lld\n%lld\n%lld\n", k1, k2, p1, p2);
        if(k1 > k2) printf("-");
        else if(k1 < k2) printf("+");
        else printf("0");

        printf("\n");

        if(p1 > p2) printf("-");
        else if(p1 < p2) printf("+");
        else printf("0");
        printf("\n");

        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