Submission #410219

---

Source Code Expand

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	MyScanner sc = new MyScanner();
	Scanner sc2 = new Scanner(System.in);
	long start = System.currentTimeMillis();
	long fin = System.currentTimeMillis();
	final int MOD = 1000000000;
	int[] dx = { 1, 0, 0, -1 };
	int[] dy = { 0, 1, -1, 0 };

	void run() {
		double deg = sc.nextDouble() / 10;
		double dis = sc.nextDouble() / 60;
		String Dir = "N";
		int W = 0;
		if (deg < 11.25) {

		} else if (deg < 33.75) {
			Dir = "NNE";
		} else if (deg < 56.25) {
			Dir = "NE";
		} else if (deg < 78.75) {
			Dir = "ENE";
		} else if (deg < 101.25) {
			Dir = "E";
		} else if (deg < 123.75) {
			Dir = "ESE";
		} else if (deg < 146.25) {
			Dir = "SE";
		} else if (deg < 168.75) {
			Dir = "SSE";
		} else if (deg < 191.25) {
			Dir = "S";
		} else if (deg < 213.75) {
			Dir = "SSW";
		} else if (deg < 236.25) {
			Dir = "SW";
		} else if (deg < 258.75) {
			Dir = "WSW";
		} else if (deg < 281.25) {
			Dir = "W";
		} else if (deg < 303.75) {
			Dir = "WNW";
		} else if (deg < 326.25) {
			Dir = "NW";
		} else if (deg < 348.75) {
			Dir = "NNW";
		}

		int tmp = (int) Math.round(dis * 10);
		if (tmp <= 2) {
			W = 0;
		} else if (tmp <= 15) {
			W = 1;
		} else if (tmp <= 33) {
			W = 2;
		} else if (tmp <= 54) {
			W = 3;
		} else if (tmp <= 79) {
			W = 4;
		} else if (tmp <= 107) {
			W = 5;
		} else if (tmp <= 138) {
			W = 6;
		} else if (tmp <= 171) {
			W = 7;
		} else if (tmp <= 207) {
			W = 8;
		} else if (tmp <= 244) {
			W = 9;
		} else if (tmp <= 284) {
			W = 10;
		} else if (tmp <= 326) {
			W = 11;
		} else {
			W = 12;
		}

		System.out.println((W == 0 ? 'C' : Dir) + " " + W);
	}

	public static void main(String[] args) {
		new Main().run();
	}

	void debug(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	void debug2(char[][] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array[i].length; j++) {
				System.out.print(array[i][j]);
			}
			System.out.println();
		}
	}

	boolean inner(int h, int w, int limH, int limW) {
		return 0 <= h && h < limH && 0 <= w && w < limW;
	}

	void swap(int[] x, int a, int b) {
		int tmp = x[a];
		x[a] = x[b];
		x[b] = tmp;
	}

	// find minimum i (a[i] >= border)
	int lower_bound(int a[], int border) {
		int l = -1;
		int r = a.length;
		while (r - l > 1) {
			int mid = (l + r) / 2;
			if (border <= a[mid]) {
				r = mid;
			} else {
				l = mid;
			}
		}
		// r = l + 1
		return r;
	}

	boolean palindrome(String s) {
		for (int i = 0; i < s.length() / 2; i++) {
			if (s.charAt(i) != s.charAt(s.length() - 1 - i)) {
				return false;
			}
		}
		return true;
	}

	class MyScanner {
		int nextInt() {
			try {
				int c = System.in.read();
				while (c != '-' && (c < '0' || '9' < c))
					c = System.in.read();
				if (c == '-')
					return -nextInt();
				int res = 0;
				do {
					res *= 10;
					res += c - '0';
					c = System.in.read();
				} while ('0' <= c && c <= '9');
				return res;
			} catch (Exception e) {
				return -1;
			}
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		String next() {
			try {
				StringBuilder res = new StringBuilder("");
				int c = System.in.read();
				while (Character.isWhitespace(c))
					c = System.in.read();
				do {
					res.append((char) c);
				} while (!Character.isWhitespace(c = System.in.read()));
				return res.toString();
			} catch (Exception e) {
				return null;
			}
		}

		int[] nextIntArray(int n) {
			int[] in = new int[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextInt();
			}
			return in;
		}

		int[][] nextInt2dArray(int n, int m) {
			int[][] in = new int[n][m];
			for (int i = 0; i < n; i++) {
				in[i] = nextIntArray(m);
			}
			return in;
		}

		double[] nextDoubleArray(int n) {
			double[] in = new double[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextDouble();
			}
			return in;
		}

		long[] nextLongArray(int n) {
			long[] in = new long[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextLong();
			}
			return in;
		}

		char[][] nextCharField(int n, int m) {
			char[][] in = new char[n][m];
			for (int i = 0; i < n; i++) {
				String s = sc.next();
				for (int j = 0; j < m; j++) {
					in[i][j] = s.charAt(j);
				}
			}
			return in;
		}
	}
}

Submission Info

Judge Result