結果
問題 | No.726 Tree Game |
ユーザー | tutuz |
提出日時 | 2018-08-27 08:37:05 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,104 bytes |
コンパイル時間 | 2,245 ms |
コンパイル使用メモリ | 77,860 KB |
実行使用メモリ | 51,212 KB |
最終ジャッジ日時 | 2024-07-01 04:05:38 |
合計ジャッジ時間 | 4,558 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
50,312 KB |
testcase_01 | AC | 56 ms
50,552 KB |
testcase_02 | AC | 55 ms
50,276 KB |
testcase_03 | AC | 56 ms
50,392 KB |
testcase_04 | AC | 56 ms
49,972 KB |
testcase_05 | AC | 57 ms
50,148 KB |
testcase_06 | AC | 55 ms
50,396 KB |
testcase_07 | AC | 55 ms
50,424 KB |
testcase_08 | AC | 56 ms
50,416 KB |
testcase_09 | WA | - |
testcase_10 | AC | 56 ms
50,252 KB |
testcase_11 | AC | 55 ms
50,336 KB |
testcase_12 | AC | 56 ms
49,876 KB |
testcase_13 | AC | 57 ms
50,176 KB |
testcase_14 | AC | 55 ms
50,192 KB |
testcase_15 | AC | 55 ms
50,212 KB |
testcase_16 | AC | 66 ms
50,756 KB |
testcase_17 | AC | 72 ms
51,180 KB |
testcase_18 | AC | 65 ms
50,812 KB |
testcase_19 | AC | 73 ms
50,868 KB |
testcase_20 | AC | 73 ms
50,960 KB |
testcase_21 | AC | 78 ms
51,212 KB |
testcase_22 | AC | 98 ms
51,180 KB |
testcase_23 | AC | 81 ms
51,176 KB |
testcase_24 | AC | 76 ms
51,080 KB |
ソースコード
import static java.lang.Math.*; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.OutputStream; import java.io.PrintWriter; import java.util.InputMismatchException; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { public void solve(int testNumber, InputReader in, PrintWriter out) { long x = in.nextLong(); long y = in.nextLong(); boolean xp = isPrime(x); boolean yp = isPrime(y); int d = 0; if (xp && yp) { out.println("Second"); return; } else if (xp) { x++; d++; } else if (yp) { y++; d++; } long nx = x, ny = y; for (long i = x+1;; i++) { if (isPrime(i)) { nx = max(i-1, nx); break; } } for (long i = y+1;; i++) { if (isPrime(i)) { ny = max(i-1, ny); break; } } long move = nx - x + ny - y + d; out.println(move % 2 == 0 ? "Second" : "First"); } boolean isPrime(long n) { if (n == 1L) return false; if (n == 2L) return true; boolean ret = true; for (int i = 2; i <= Math.sqrt(n); i++) { if (n % i == 0) { ret = false; } } return ret; } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } }