Submission #4392492

---

Source Code Expand

#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <iomanip>
#include <map>
#include <stack>
#include <queue>
    
using namespace std;

typedef long long ll;

int main() {
    int deg, dis;
    cin >> deg >> dis;
    
    deg = (deg * 10 + 1125) % 36000;
    int i = deg / 2250;
    
    string d[16];
    d[0] = "N";
    d[1] = "NNE";
    d[2] = "NE";
    d[3] = "ENE";
    d[4] = "E";
    d[5] = "ESE";
    d[6] = "SE";
    d[7] = "SSE";
    d[8] = "S";
    d[9] = "SSW";
    d[10] = "SW";
    d[11] = "WSW";
    d[12] = "W";
    d[13] = "WNW";
    d[14] = "NW";
    d[15] = "NNW";
    
    int w;
    if (dis < 15) w = 0;
    else if (dis < 93) w=1;
    else if (dis < 201) w=2;
    else if (dis < 327) w=3;
    else if (dis < 477) w=4;
    else if (dis < 645) w=5;
    else if (dis < 831) w=6;
    else if (dis < 1029) w=7;
    else if (dis < 1245) w=8;
    else if (dis < 1467) w=9;
    else if (dis < 1707) w=10;
    else if (dis < 1959) w=11;
    else w=12;
    
    string dir;
    if (!w) dir = "C";
    else dir = d[i];
    
    cout << dir << ' ' << w << endl;
}

Submission Info

Judge Result