Submission #5440602

---

Source Code Expand

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

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>


string s[16] = { "N","NNE","NE","ENE","E","ESE","SE","SSE","S","SSW","SW","WSW","W","WNW","NW","NNW" };
double ss[13]= { 0.25,1.55,3.35,5.45,7.95,10.75,13.85,17.15,20.75,24.45,28.45,32.65,1000000000.0 };

int main() {
	ll a, b, c;
	cin >> a >> b;
	double aa = (double)(a + 112.5) / 225;
	a = aa;
	REP(i, 13) {
		if (ss[i] * 60 > (double)b) {
			if (i == 0) {
				cout << "C " << i << endl;
				return 0;
			}
			c = i;
			break;
		}
	}
	cout << s[a] << " " << c << endl;

}

Submission Info

Judge Result