Submission #107689

---

Source Code Expand

#include<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<numeric>
#include<cmath>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
  int i;
  int p, q;
  cin >> p >> q;
  q = round((double)q / 60 * 10);
  if(false) {
  } else if(q <= 2) {
    q = 0;
  } else if(q <= 15) {
    q = 1;
  } else if(q <= 33) {
    q = 2;
  } else if(q <= 54) {
    q = 3;
  } else if(q <= 79) {
    q = 4;
  } else if(q <= 107) {
    q = 5;
  } else if(q <= 138) {
    q = 6;
  } else if(q <= 171) {
    q = 7;
  } else if(q <= 207) {
    q = 8;
  } else if(q <= 244) {
    q = 9;
  } else if(q <= 284) {
    q = 10;
  } else if(q <= 326) {
    q = 11;
  } else {
    q = 12;
  }
  p *= 10;
  for(i = 0; i < 15; ++i)
    if(i * 2250 + 1125 <= p && p < (i + 1) * 2250 + 1125) break;
  string s[] = { "NNE", "NE", "ENE", "E", "ESE", "SE", "SSE", "S", "SSW", "SW", "WSW", "W", "WNW", "NW", "NNW", "N" };
  cout << (!q ? "C" : s[i]) << ' ' << q << endl;
  return 0;
}

Submission Info

Judge Result