Submission #535589
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 = 1000000007; int[] dx = { 1, 0, 0, -1 }; int[] dy = { 0, 1, -1, 0 }; void run() { double a = sc.nextDouble(); double b = sc.nextDouble(); double c = sc.nextDouble(); double d = sc.nextDouble(); double A = b / a; double B = d / c; if (A == B) { System.out.println("DRAW"); } else { System.out.println(A > B ? "TAKAHASHI" : "AOKI"); } } 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
Submission Time | |
---|---|
Task | A - 勝率計算 |
User | suigingin |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 3415 Byte |
Status | AC |
Exec Time | 452 ms |
Memory | 24060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | 0.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0.txt | AC | 439 ms | 23988 KB |
1.txt | AC | 435 ms | 24032 KB |
10.txt | AC | 440 ms | 24020 KB |
11.txt | AC | 435 ms | 24004 KB |
12.txt | AC | 435 ms | 24036 KB |
13.txt | AC | 443 ms | 24060 KB |
14.txt | AC | 440 ms | 24004 KB |
15.txt | AC | 434 ms | 24000 KB |
16.txt | AC | 427 ms | 23956 KB |
17.txt | AC | 452 ms | 17980 KB |
18.txt | AC | 408 ms | 19292 KB |
19.txt | AC | 408 ms | 19264 KB |
2.txt | AC | 408 ms | 19288 KB |
20.txt | AC | 403 ms | 19236 KB |
21.txt | AC | 412 ms | 19332 KB |
22.txt | AC | 403 ms | 19256 KB |
23.txt | AC | 409 ms | 19216 KB |
24.txt | AC | 406 ms | 19392 KB |
25.txt | AC | 404 ms | 19260 KB |
26.txt | AC | 403 ms | 19320 KB |
27.txt | AC | 414 ms | 19340 KB |
28.txt | AC | 410 ms | 19300 KB |
29.txt | AC | 409 ms | 19328 KB |
3.txt | AC | 406 ms | 19240 KB |
4.txt | AC | 408 ms | 19280 KB |
5.txt | AC | 408 ms | 19220 KB |
6.txt | AC | 412 ms | 19320 KB |
7.txt | AC | 411 ms | 19264 KB |
8.txt | AC | 401 ms | 19244 KB |
9.txt | AC | 403 ms | 19280 KB |
subtask0_sample_01.txt | AC | 405 ms | 19240 KB |
subtask0_sample_02.txt | AC | 410 ms | 19320 KB |
subtask0_sample_03.txt | AC | 402 ms | 19224 KB |