Submission #108814

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;

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

const int INF = (int)(1e9);
const int WP[] = {2, 15, 33, 54, 79, 107, 138, 171, 207, 244, 284, 326, INF};
    
int Deg, Dis;

void solve()
{
    int v = ((Dis*100)/60+5)/10;
    int W;
    REP(i, 13) if (v <= WP[i]) {
        W = i;
        break;
    }
    Deg *= 10;
    string Dir;
    if (W == 0) Dir = "C";
    else {
        if (Deg < 1125 || Deg >= 34875) Dir = "N";
        else if (Deg < 3375) Dir = "NNE";
        else if (Deg < 5625) Dir = "NE";
        else if (Deg < 7875) Dir = "ENE";
        else if (Deg < 10125) Dir = "E";
        else if (Deg < 12375) Dir = "ESE";
        else if (Deg < 14625) Dir = "SE";
        else if (Deg < 16875) Dir = "SSE";                        
        else if (Deg < 19125) Dir = "S";
        else if (Deg < 21375) Dir = "SSW";                        
        else if (Deg < 23625) Dir = "SW";
        else if (Deg < 25875) Dir = "WSW";
        else if (Deg < 28125) Dir = "W";                                
        else if (Deg < 30375) Dir = "WNW";
        else if (Deg < 32625) Dir = "NW";
        else if (Deg < 34875) Dir = "NNW";
    }
    cout << Dir << ' ' << W << endl;
}

int main()
{
    cin >> Deg >> Dis;
    solve();
    return 0;
}

Submission Info

Judge Result