Submission #3921611

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define mkp make_pair
#define pr(num) cout << num << "\n"
#define max(a, b) ((a)>(b) ? (a):(b))
#define min(a, b) ((a)<(b) ? (a):(b))
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 200010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;

int main() {
    ll deg, dis;
    cin >> deg >> dis;
    dis*=100;
    dis/=60;
    
    if(dis%10>=5) dis+=10;
    dis/=10;
    
    double pow[]={0.2, 1.5, 3.3, 5.4, 7.9, 10.7, 13.8, 17.1, 20.7, 24.4, 28.4, 32.6};
    double kakudo[]={11.25, 33.75, 56.25, 78.75, 101.25, 123.75,
                     146.25, 168.75, 191.25, 213.75, 236.25,
                     258.75, 281.25, 303.75, 326.25, 348.75};
    string houi[]={"N", "NNE", "NE", "ENE", "E", "ESE",
                   "SE", "SSE", "S", "SSW", "SW", "WSW",
                   "W", "WNW", "NW", "NNW"};
    ll i;
    string a="N";
    for(i=0; i<=15; i++) {
        if(deg<kakudo[i]*10) {
            a=houi[i];
            break;
        }
    }
    
    ll b=12;
    for(i=0; i<12; i++) {
        if(dis<=pow[i]*10) {
            b=i;
            if(b==0) {
                a="C";
            }
            break;
        }
    }
    
    cout << a << " " << b << endl;
    
}

Submission Info

Judge Result