Submission #109341

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>

using namespace std;


const string arstr[] = {"N","NNE","NE","ENE","E","ESE","SE","SSE",
	"S","SSW","SW","WSW","W","WNW","NW","NNW","N"};
const double ardou[] = {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, 999};
const double ardou2[] = {0.2, 1.5 ,3.3, 5.4, 7.9, 10.7, 13.8, 17.1, 20.7, 24.4, 28.4, 32.6, 999};

bool solve(){
	string dir; int w;
	
	double a, b;
	cin>> a>> b;
	a = a/10;
	b = b/60;
	double b2 = b*10;
	int b3 = (int)b2;
	b = (double)(b3 + (b2-b3 < 0.5 ? 0 : 1) ) / 10;
	
	for(int i=0;i<17;i++){
		if(a < ardou[i]){
			dir = arstr[i];
			break;
		}
	}
	
	for(int i=0;i<13;i++){
		if(b <= ardou2[i]){
			w = i;
			break;
		}
	}
	
	if(w == 0){
		cout<< "C 0"<< endl;
	}else{
		cout<< dir<< " "<< w<< endl;
	}
	
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	solve();

	return 0;
}

 

Submission Info

Judge Result