Submission #1349403

---

Source Code Expand

#include <algorithm>
#include <iomanip>
#include <istream>
#include <map>
#include <numeric>
#include <ostream>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>

using namespace std;

class Solution {
public:
    string dir[16] = {
        "NNE", "NE", "ENE", "E",
        "ESE", "SE", "SSE", "S",
        "SSW", "SW", "WSW", "W",
        "WNW", "NW", "NNW", "N"
    };
    int rangeDir[16] = {
         1125,  3375,  5625,  7875,
        10125, 12375, 14625, 16875,
        19125, 21375, 23625, 25875,
        28125, 30375, 32625, 34875
    };
    int rangeW[25] = {
        0,2,
        3,15,
        16,33,
        34,54,
        55,79,
        80,107,
        108,138,
        139,171,
        172,207,
        208,244,
        245,284,
        285,326,
        327
    };
    void solve(std::istream& in, std::ostream& out) {
        int deg, dis;
        in >> deg >> dis;
        
        int i;
        for (i = 0; i < 12; i++)
        {
            int l = 6 * rangeW[2 * i] - 3;
            int r = 6 * rangeW[2 * (i + 1)] - 3;
            if (l <= dis && dis < r)
            {
                break;
            }
        }

        int j;
        for (j = 0; j < 15; j++)
        {
            if (rangeDir[j] <= 10 * deg && 10 * deg < rangeDir[j + 1])
            {
                break;
            }
        }

        out << (i == 0 ? "C" : dir[j]) << " " << i << endl;
    }
};

void solve(std::istream& in, std::ostream& out)
{
    out << std::setprecision(12);
    Solution solution;
    solution.solve(in, out);
}

#include <fstream>
#include <iostream>

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    istream& in = cin;
    ostream& out = cout;
    solve(in, out);
    return 0;
}

Submission Info

Judge Result