Submission #3981586

---

Source Code Expand

#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <stdio.h>
#include <vector>
#include <thread>
#include <atomic>
#include <mutex>
#include <future>
#define int long long
#define endre getchar();getchar();return 0
#define INF 1000000007
#define rep(i,n) for(int i=0;i<n;i++)
#define input() for(int i=0;i<n;i++)cin>>a[i];
#define P pair<int,int>
#define prique priority_queue<int,vector<int>,greater<int>>
#define vecunique(vec) sort(vec.begin(), vec.end());decltype(vec)::iterator result = std::unique(vec.begin(), vec.end());vec.erase(result, vec.end())
using namespace std;
bool prime(int n) {
	for (int i = 2; i <= sqrt(n); i++) {
		if (n%i == 0)return false;
	}
	return n != 1;
}
int gcd(int x, int y) {
	if (x < y)swap(x, y);
	if (y == 0)return x;
	return (y, x%y);
}
int lcm(int x, int y) {
	return x * y / gcd(x, y);
}
int kai(int n) {
	if (n == 0)return 1;
	return (kai(n - 1)*n) % INF;
}
int mod_pow(int x, int y, int mod) {
	int res = 1;
	while (y > 0) {
		if (y & 1) {
			res = res * x%mod;
		}
		x = x * x%mod;
		y >>= 1;
	}
	return res;
}
int mystoi(string s) {
	int cnt = 0;
	for (int i = 0; i < s.size(); i++) {
		cnt += (int)(s[i] - '0') * pow(10, s.size() - i - 1);
	}
	return cnt;
}

signed main() {
	double a, b;
	cin >> a >> b;
	b /= 60.;
	a /= 10.;
	if (b < 0.25)cout << "C" << " ";
	else if (a < 11.25)cout << "N" << " ";
	else if (a < 33.75)cout << "NNE" << " ";
	else if (a < 56.25)cout << "NE" << " ";
	else if (a < 78.75)cout << "ENE" << " ";
	else if (a < 101.25)cout << "E" << " ";
	else if (a < 123.75)cout << "ESE" << " ";
	else if (a < 146.25)cout << "SE" << " ";
	else if (a < 168.75)cout << "SSE" << " ";
	else if (a < 191.25)cout << "S" << " ";
	else if (a < 213.75)cout << "SSW" << " ";
	else if (a < 236.25)cout << "SW" << " ";
	else if (a < 258.75)cout << "WSW" << " ";
	else if (a < 281.25)cout << "W" << " ";
	else if (a < 303.75)cout << "WNW" << " ";
	else if (a < 326.25)cout << "NW" << " ";
	else if (a < 348.75)cout << "NNW" << " ";
	else cout << "N" << " ";
	if (b < 0.25)cout << 0 << endl;
	else if (b < 1.55)cout << 1 << endl;
	else if (b < 3.35)cout << 2 << endl;
	else if (b < 5.45)cout << 3 << endl;
	else if (b < 7.95)cout << 4 << endl;
	else if (b < 10.75)cout << 5 << endl;
	else if (b < 13.85)cout << 6 << endl;
	else if (b < 17.15)cout << 7 << endl;
	else if (b < 20.75)cout << 8 << endl;
	else if (b < 24.45)cout << 9 << endl;
	else if (b < 28.45)cout << 10 << endl;
	else if (b < 32.65)cout << 11 << endl;
	else cout << 12 << endl;
	endre;
}

Submission Info

Judge Result