Submission #1049775

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>

using namespace std;

#define REP(i, b, e) for(int i = (int)(b); i < (int)(e); i++)
#define rep(i, n) REP(i, 0, n)

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

double d[] = {337.5, 562.5, 787.5, 1012.5, 1237.5, 1462.5, 1687.5, 1912.5, 2137.5, 2362.5, 2587.5, 2812.5, 3037.5, 3262.5, 3487.5};
string t[] = {"NNE", "NE", "ENE", "E", "ESE", "SE", "SSE", "S", "SSW", "SW", "WSW", "W", "WNW", "NW", "NNW"};

double e[] = {0.2, 1.5, 3.3, 5.4, 7.9, 10.7, 13.8, 17.1, 20.7, 24.4, 28.4, 32.6};

int main(){
	double a, b;
	cin>>a>>b;
	string s = "N";
	if(a < 112.5);
	else{
		rep(i, 15) if(a < d[i]){
			s = t[i];
			break;
		}
	}
	b /= 60.0;
	b = (int)((b*100.0+5.0+1e-12)/10.0);
	b /= 10.0;
	int f = 12;
	rep(i, 12) if(b < e[i] + 1e-12) {
		f = i;
		break;
	}
	if(f == 0) s = "C";

	cout<<s<<" "<<f<<endl;
}

Submission Info

Judge Result