Submission #1887642

---

Source Code Expand

#include <utility> // pair make_pair
using std::swap; // c++11
using std::pair;
using std::make_pair;
#include <tuple> // tuple(c++11) make_tuple(c++11)
using std::tuple; // get<address>(variable)
using std::make_tuple;
#include <string> // string stoi(c++11) stoll(c++11) to_string(c++11)
using std::string;
using std::stoi;
using std::stoll;
using std::to_string;
#include <queue> // queue priority_queue
using std::queue;
using std::priority_queue;
#include <stack> // stack
using std::stack;
#include <vector> // vector
using std::vector;
#include <map> // map
using std::map;
#include <set> // set
using std::set; // insert erase find count
#include <algorithm> // min max
using std::sort;
using std::lower_bound; // iterator,  >=
using std::upper_bound; // iterator,  >
using std::min;
using std::max;
using std::min_element; // iterator
using std::max_element; // iterator
#include <complex> // complex
using std::complex; // real imag
#include <iostream> // cin cout
using std::cin;
using std::cout;
using std::endl;
#include <iomanip> // setprecision fixed(manipulator)
using std::setprecision;
using std::fixed;
#include <cmath>
#include <cstdio>

#define lli long long int
#define INF (int)1e09
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define EFOR(i, m, n) for (int i = m; i <= n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REFOR(i, m, n) for (int i = m; i >= n; i--)
#define VSORT(v) sort((v).begin(), (v).end()) // sort vector
typedef pair<int, int> PI;
typedef tuple<int, int, int> TI;
template <typename T> using Vec = vector<T>; // c++11

string dir (int deg) {
    string ret;
    deg -= 112;
    string dir_store[17] = {"N","NNE","NE","ENE","E","ESE","SE","SSE","S","SSW","SW","WSW","W","WNW","NW","NNW","N"};
    FOR (i, 0, 17) {
        if (deg <= i * 225) {
            ret = dir_store[i];
            break;
        }
    }
    return ret;
}

int wind_power(int dis) {
    int wind[12] = {93, 201, 327, 477, 645, 831, 1029, 1245, 1467, 1707, 1959, 12000};
    int ret;
    FOR (i, 0, 12) {
        if (dis < wind[i]) {
            ret = i + 1;
            break;
        }
    }
    return ret;
}

int main(void) {
    int deg;
    int dis;
    cin >> deg >> dis;
    if (dis < 15) {
        cout << "C 0" << endl;
    } else {
        cout << dir(deg) << " " << wind_power(dis) << endl;
    }
    return 0;
}

Submission Info

Judge Result