Submission #4024303

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30; 
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int deg, w;
    int wp, idir;
    int wpt[] = {2, 15, 33, 54, 79, 107, 138, 171, 207, 244, 284, 326};
    string dir[] = {"N", "NNE", "NE", "ENE", "E", "ESE", "SE", "SSE", "S", "SSW", "SW", "WSW", "W", "WNW", "NW", "NNW", "C"};
    cin >> deg >> w;
    w = round(w / 60.0 * 10);
    int answ, ansd;
    for(answ = 0; answ < 12; answ++)
    {
        if(w <= wpt[answ]) break;
    }
    if(answ == 0)
    {
        cout << "C 0" << endl;
    }
    else
    {
        ansd = (deg * 10 + 1125) / 2250;
        if(ansd == 16) ansd = 0;
        cout << dir[ansd] << " " << answ << endl;
    }
    return 0;
}

Submission Info

Judge Result