답안 #15556

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
15556	2015-07-12T12:39:08 Z	comet	님 무기가 좀 나쁘시네여 (kriii3_S)	C++	29 / 29	0 ms	1712 KB

relay

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
double a[4][5];
int main(){
	ios::sync_with_stdio(0);
	for(int i=0;i<4;i++)
		for(int j=0;j<5;j++)cin>>a[i][j];
	double x,y,t[5];
	for(int i=0;i<5;i++){
		t[i]=a[0][i];
		if(i>1)t[i]/=100.0;
	}
	x=t[0]*(1+t[1]/100.0)*((1-min(1.0,t[2]))+min(1.0,t[2])*t[3])*(1+t[4]);
	for(int i=0;i<5;i++){
		if(i>1)t[i]+=(-a[2][i]+a[3][i])/100.0;
		else t[i]+=-a[2][i]+a[3][i];
	}
	y=t[0]*(1+t[1]/100.0)*((1-min(1.0,t[2]))+min(1.0,t[2])*t[3])*(1+t[4]);
	if(fabs(x-y)<1e-9)cout<<"0"<<endl;
	else if(x+1e-9<y)cout<<"+"<<endl;
	else cout<<"-"<<endl;

	for(int i=0;i<5;i++){
		t[i]=a[1][i];
		if(i>1)t[i]/=100.0;
	}
	x=t[0]*(1+t[1]/100.0)*((1-min(1.0,t[2]))+min(1.0,t[2])*t[3])*(1+t[4]);
	for(int i=0;i<5;i++){
		if(i>1)t[i]+=(a[2][i]-a[3][i])/100.0;
		else t[i]+=a[2][i]-a[3][i];
	}
	y=t[0]*(1+t[1]/100.0)*((1-min(1.0,t[2]))+min(1.0,t[2])*t[3])*(1+t[4]);
	if(fabs(x-y)<1e-9)cout<<"0"<<endl;
	else if(x+1e-9<y)cout<<"+"<<endl;
	else cout<<"-"<<endl;
}

Subtask #1

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1712 KB	Output is correct
2	Correct	0 ms	1712 KB	Output is correct
3	Correct	0 ms	1712 KB	Output is correct
4	Correct	0 ms	1712 KB	Output is correct
5	Correct	0 ms	1712 KB	Output is correct
6	Correct	0 ms	1712 KB	Output is correct
7	Correct	0 ms	1712 KB	Output is correct
8	Correct	0 ms	1712 KB	Output is correct
9	Correct	0 ms	1712 KB	Output is correct
10	Correct	0 ms	1712 KB	Output is correct
11	Correct	0 ms	1712 KB	Output is correct
12	Correct	0 ms	1712 KB	Output is correct
13	Correct	0 ms	1712 KB	Output is correct
14	Correct	0 ms	1712 KB	Output is correct
15	Correct	0 ms	1712 KB	Output is correct
16	Correct	0 ms	1712 KB	Output is correct
17	Correct	0 ms	1712 KB	Output is correct
18	Correct	0 ms	1712 KB	Output is correct
19	Correct	0 ms	1712 KB	Output is correct
20	Correct	0 ms	1712 KB	Output is correct
21	Correct	0 ms	1712 KB	Output is correct
22	Correct	0 ms	1712 KB	Output is correct
23	Correct	0 ms	1712 KB	Output is correct
24	Correct	0 ms	1712 KB	Output is correct
25	Correct	0 ms	1712 KB	Output is correct
26	Correct	0 ms	1712 KB	Output is correct
27	Correct	0 ms	1712 KB	Output is correct
28	Correct	0 ms	1712 KB	Output is correct
29	Correct	0 ms	1712 KB	Output is correct
30	Correct	0 ms	1712 KB	Output is correct
31	Correct	0 ms	1712 KB	Output is correct
32	Correct	0 ms	1712 KB	Output is correct
33	Correct	0 ms	1712 KB	Output is correct
34	Correct	0 ms	1712 KB	Output is correct
35	Correct	0 ms	1712 KB	Output is correct
36	Correct	0 ms	1712 KB	Output is correct
37	Correct	0 ms	1712 KB	Output is correct
38	Correct	0 ms	1712 KB	Output is correct
39	Correct	0 ms	1712 KB	Output is correct
40	Correct	0 ms	1712 KB	Output is correct
41	Correct	0 ms	1712 KB	Output is correct
42	Correct	0 ms	1712 KB	Output is correct
43	Correct	0 ms	1712 KB	Output is correct
44	Correct	0 ms	1712 KB	Output is correct
45	Correct	0 ms	1712 KB	Output is correct
46	Correct	0 ms	1712 KB	Output is correct