Submission #766872


Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b)-1);i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int, int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))

int main(void){
	int a, b;
	cin >> a >> b;
	
	a = a*10;
	
	if( b < 15 ) cout << "C" << " ";
	else if( 1125 <= a && a< 3375 ) cout << 	"NNE"	<< " ";
	else if( 3375 <= a && a< 5625 ) cout << 	"NE"	<< " ";
	else if( 5625 <= a && a< 7875 ) cout << 	"ENE"	<< " ";
	else if( 7875 <= a && a< 10125  ) cout << 	"E"	<< " ";
	else if( 10125 <= a && a< 12375 ) cout << 	"ESE"	<< " ";
	else if( 12375 <= a && a< 14625 ) cout << 	"SE"	<< " ";
	else if( 14625 <= a && a< 16875 ) cout << 	"SSE"	<< " ";
	else if( 16875 <= a && a< 19125 ) cout << 	"S"	<< " ";
	else if( 19125 <= a && a< 21375 ) cout << 	"SSW"	<< " ";
	else if( 21375 <= a && a< 23625 ) cout << 	"SW"	<< " ";
	else if( 23625 <= a && a< 25875 ) cout << 	"WSW"	<< " ";
	else if( 25875 <= a && a< 28125 ) cout << 	"W"	<< " ";
	else if( 28125 <= a && a< 30375 ) cout << 	"WNW"	<< " ";
	else if( 30375 <= a && a< 32625 ) cout << 	"NW"	<< " ";
	else if( 32625 <= a && a< 34875 ) cout << 	"NNW"	<< " ";
	else 		 cout << 	"N"	<< " ";

	if( 6*0  <= b && b <  2*6+3  ) cout << 	"0"	<< endl;
	else if( 6*3-3  <= b && b <  15*6+3  ) cout << 	"1"	<< endl;
	else if( 6*16-3  <= b && b <  33*6+3  ) cout << 	"2"	<< endl;
	else if( 6*34-3  <= b && b <  54*6+3  ) cout << 	"3"	<< endl;
	else if( 6*55-3  <= b && b <  79*6+3  ) cout << 	"4"	<< endl;
	else if( 6*80-3  <= b && b <  107*6+3  ) cout << 	"5"	<< endl;
	else if( 6*108-3  <= b && b <  138*6+3  ) cout << 	"6"	<< endl;
	else if( 6*139-3  <= b && b <  171*6+3  ) cout << 	"7"	<< endl;
	else if( 6*172-3  <= b && b <  207*6+3  ) cout << 	"8"	<< endl;
	else if( 6*208-3  <= b && b <  244*6+3  ) cout << 	"9"	<< endl;
	else if( 6*245-3  <= b && b <  284*6+3  ) cout << 	"10"	<< endl;
	else if( 6*285-3  <= b && b <  326*6+3  ) cout << 	"11"	<< endl;
	else if( 6*327 -3 <= b	) cout << 	"12"	<< endl;
	
	return 0;
}

Submission Info

Submission Time
Task C - 風力観測
User ktyshmt
Language C++ (G++ 4.6.4)
Score 100
Code Size 2594 Byte
Status AC
Exec Time 32 ms
Memory 1148 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 66
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 00_sample_06.txt, 00_sample_07.txt, 00_sample_08.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 30 ms 1056 KB
00_sample_02.txt AC 28 ms 928 KB
00_sample_03.txt AC 29 ms 984 KB
00_sample_04.txt AC 29 ms 924 KB
00_sample_05.txt AC 29 ms 928 KB
00_sample_06.txt AC 27 ms 932 KB
00_sample_07.txt AC 32 ms 924 KB
00_sample_08.txt AC 31 ms 928 KB
test_01.txt AC 29 ms 920 KB
test_02.txt AC 29 ms 984 KB
test_03.txt AC 29 ms 924 KB
test_04.txt AC 27 ms 920 KB
test_05.txt AC 29 ms 928 KB
test_06.txt AC 27 ms 924 KB
test_07.txt AC 29 ms 928 KB
test_08.txt AC 31 ms 928 KB
test_09.txt AC 30 ms 992 KB
test_10.txt AC 29 ms 928 KB
test_11.txt AC 30 ms 928 KB
test_12.txt AC 29 ms 924 KB
test_13.txt AC 28 ms 992 KB
test_14.txt AC 27 ms 928 KB
test_15.txt AC 30 ms 980 KB
test_16.txt AC 29 ms 924 KB
test_17.txt AC 30 ms 988 KB
test_18.txt AC 29 ms 924 KB
test_19.txt AC 29 ms 988 KB
test_20.txt AC 31 ms 924 KB
test_21.txt AC 29 ms 992 KB
test_22.txt AC 30 ms 984 KB
test_23.txt AC 30 ms 992 KB
test_24.txt AC 30 ms 988 KB
test_25.txt AC 30 ms 984 KB
test_26.txt AC 30 ms 992 KB
test_27.txt AC 30 ms 984 KB
test_28.txt AC 30 ms 980 KB
test_29.txt AC 30 ms 988 KB
test_30.txt AC 29 ms 924 KB
test_31.txt AC 27 ms 924 KB
test_32.txt AC 26 ms 1028 KB
test_33.txt AC 28 ms 924 KB
test_34.txt AC 27 ms 1052 KB
test_35.txt AC 27 ms 988 KB
test_36.txt AC 29 ms 988 KB
test_37.txt AC 27 ms 920 KB
test_38.txt AC 31 ms 976 KB
test_39.txt AC 26 ms 988 KB
test_40.txt AC 29 ms 984 KB
test_41.txt AC 28 ms 1048 KB
test_42.txt AC 28 ms 1044 KB
test_43.txt AC 26 ms 984 KB
test_44.txt AC 26 ms 984 KB
test_45.txt AC 28 ms 1040 KB
test_46.txt AC 28 ms 924 KB
test_47.txt AC 30 ms 924 KB
test_48.txt AC 29 ms 988 KB
test_49.txt AC 28 ms 920 KB
test_50.txt AC 26 ms 928 KB
test_51.txt AC 28 ms 1024 KB
test_52.txt AC 29 ms 988 KB
test_53.txt AC 28 ms 920 KB
test_54.txt AC 27 ms 988 KB
test_55.txt AC 27 ms 928 KB
test_56.txt AC 28 ms 924 KB
test_57.txt AC 27 ms 984 KB
test_58.txt AC 29 ms 1148 KB