Submission #3602066

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
const int MAX_C = 100010;
void abcc() {
	int g,s;
	cin >> g >> s;
	string a[16] = { "N","NNE","NE","ENE","E","ESE","SE","SSE","S","SSW","SW","WSW","W","WNW","NW","NNW" };
	int b = ((g * 10) + 1125) / (36000 / 16);

	int c[12] = { 2,15,33,54,79,107,138,171,207,244,284,326 };
	int v = -1;
	for (size_t i = 0; i < 12; i++)
	{
		if ((int)(((double)s / 6.0) + 0.5)<= c[i]) {
			v = i;
			break;
		}
	}
	if (v == -1) v = 12;
	if (v == 0) cout << "C " << v << endl;
	if (v == 16) cout << a[15] << " " << v << endl;
	else cout << a[b] << " " << v << endl;
}
int main() {
	abcc();
	return 0;
}

Submission Info

Judge Result