Submission #15207

#TimeUsernameProblemLanguageResultExecution timeMemory
15207ggoh님 무기가 좀 나쁘시네여 (kriii3_S)C++98
0 / 29
0 ms1084 KiB
#include<cstdio> #include<algorithm> #include<vector> #include<cmath> long long a[5],b[5],c[5],x,y,d[5],e[5],i,j; long long min(long long X,long long Y){return X>Y?Y:X;} long long f(long long aa,long long bb,long long cc,long long dd,long long ee) { return aa*(100+bb)*(100+ee)*(100*(100-min(cc,100))+min(cc,100)*dd); } main() { for(i=0;i<4;i++)scanf("%lld%lld%lld%lld%lld",&a[i],&b[i],&c[i],&d[i],&e[i]); x=f(a[0],b[0],c[0],d[0],e[0]),y=f(a[0]-a[2]+a[3],b[0]-b[2]+b[3],c[0]-c[2]+c[3],d[0]-d[2]+d[3],e[0]+e[3]); if(x<y) { puts("+"); } else if(x>y)puts("-"); else puts("0"); x=f(a[1],b[1],c[1],d[1],e[1]),y=f(a[1]-a[3]+a[2],b[1]-b[3]+b[2],c[1]-c[3]+c[2],d[1]-d[3]+d[2],e[1]-e[3]+e[2]); if(x<y) { puts("+"); } else if(x>y)puts("-"); else puts("0"); }
#Verdict Execution timeMemoryGrader output
Fetching results...