Submission #1050381

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

//#define int long long
#define DBG 1
#define dump(o) if(DBG){cerr<<#o<<" "<<(o)<<" ";}
#define dumpl(o) if(DBG){cerr<<#o<<" "<<(o)<<endl;}
#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);

signed main() {
	double d = 22.5;
	string D[] = { "N","NNE","NE","ENE","E","ESE","SE","SSE","S","SSW","SW","WSW","W","WNW","NW","NNW" };
	int W[] = { 15, 93, 201, 327, 477, 645, 831, 1029, 1245, 1467, 1707, 1959 };

	int a, b; cin >> a >> b;
	a = (((a * 10 + 1125) % 36000) / 2250);
	int w = upper_bound(all(W), b) - begin(W);
	if (w == 0)cout << "C " << w << endl;
	else cout << D[a] << " " << w << endl;
	return 0;
}

Submission Info

Judge Result