Submission #15183

#TimeUsernameProblemLanguageResultExecution timeMemory
15183progressive님 무기가 좀 나쁘시네여 (kriii3_S)C++14
29 / 29
0 ms1084 KiB
#include<cstdio> #include<algorithm> long long calc(long long a,long long b,long long c,long long d,long long e) { c=std::min(100LL,c); return a*(100+b)*((100-c)*100+c*d)*(100+e); } int main() { long long KA,KB,KC,KD,KE; long long FA,FB,FC,FD,FE; long long nA,nB,nC,nD,nE; long long mA,mB,mC,mD,mE; scanf("%lld%lld%lld%lld%lld",&KA,&KB,&KC,&KD,&KE); scanf("%lld%lld%lld%lld%lld",&FA,&FB,&FC,&FD,&FE); scanf("%lld%lld%lld%lld%lld",&nA,&nB,&nC,&nD,&nE); scanf("%lld%lld%lld%lld%lld",&mA,&mB,&mC,&mD,&mE); long long A=calc(KA,KB,KC,KD,KE); long long B=calc(FA,FB,FC,FD,FE); long long C=calc(KA-nA+mA,KB-nB+mB,KC-nC+mC,KD-nD+mD,KE-nE+mE); long long D=calc(FA-mA+nA,FB-mB+nB,FC-mC+nC,FD-mD+nD,FE-mE+nE); if(A>C) puts("-"); else if(A==C) puts("0"); else puts("+"); if(B>D) puts("-"); else if(B==D) puts("0"); else puts("+"); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...