結果
問題 | No.2 素因数ゲーム |
ユーザー | tutuz |
提出日時 | 2018-12-29 09:48:42 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 71 ms / 5,000 ms |
コード長 | 4,391 bytes |
コンパイル時間 | 2,762 ms |
コンパイル使用メモリ | 96,200 KB |
実行使用メモリ | 38,140 KB |
最終ジャッジ日時 | 2024-06-08 00:54:23 |
合計ジャッジ時間 | 5,363 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
37,440 KB |
testcase_01 | AC | 60 ms
37,492 KB |
testcase_02 | AC | 71 ms
37,752 KB |
testcase_03 | AC | 60 ms
37,144 KB |
testcase_04 | AC | 63 ms
37,260 KB |
testcase_05 | AC | 61 ms
37,600 KB |
testcase_06 | AC | 63 ms
37,224 KB |
testcase_07 | AC | 61 ms
37,440 KB |
testcase_08 | AC | 64 ms
37,976 KB |
testcase_09 | AC | 62 ms
37,644 KB |
testcase_10 | AC | 62 ms
37,644 KB |
testcase_11 | AC | 64 ms
37,572 KB |
testcase_12 | AC | 63 ms
37,524 KB |
testcase_13 | AC | 62 ms
37,784 KB |
testcase_14 | AC | 61 ms
37,644 KB |
testcase_15 | AC | 61 ms
38,140 KB |
testcase_16 | AC | 62 ms
37,528 KB |
testcase_17 | AC | 64 ms
38,112 KB |
testcase_18 | AC | 60 ms
37,696 KB |
testcase_19 | AC | 61 ms
37,184 KB |
testcase_20 | AC | 62 ms
38,028 KB |
testcase_21 | AC | 61 ms
38,040 KB |
testcase_22 | AC | 63 ms
37,980 KB |
testcase_23 | AC | 61 ms
37,772 KB |
testcase_24 | AC | 62 ms
37,396 KB |
testcase_25 | AC | 63 ms
38,140 KB |
testcase_26 | AC | 61 ms
37,248 KB |
testcase_27 | AC | 60 ms
37,784 KB |
testcase_28 | AC | 64 ms
37,528 KB |
testcase_29 | AC | 63 ms
37,504 KB |
testcase_30 | AC | 64 ms
37,632 KB |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.TreeMap; import java.util.Map; import java.io.IOException; import java.io.BufferedReader; import java.io.Reader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; MyInput in = new MyInput(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskNo2 solver = new TaskNo2(); solver.solve(1, in, out); out.close(); } static class TaskNo2 { public void solve(int testNumber, MyInput in, PrintWriter out) { long n = in.nextLong(); Map<Long, Integer> map = TaskNo2.IntegerUtils.getPrimeFactorization(n); long nim = 0; for (long i : map.keySet()) { nim ^= map.get(i); } out.println(nim == 0 ? "Bob" : "Alice"); } static public class IntegerUtils { public static Map<Long, Integer> getPrimeFactorization(long n) { Map<Long, Integer> map = new TreeMap<>(); long tmp = n; for (long i = 2; i * i <= n; i++) { while (tmp % i == 0) { map.merge(i, 1, Integer::sum); tmp /= i; } } if (tmp > 1) map.merge(tmp, 1, Integer::sum); return map; } } } static class MyInput { private final BufferedReader in; private static int pos; private static int readLen; private static final char[] buffer = new char[1024 * 8]; private static char[] str = new char[500 * 8 * 2]; private static boolean[] isDigit = new boolean[256]; private static boolean[] isSpace = new boolean[256]; private static boolean[] isLineSep = new boolean[256]; static { for (int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; } public MyInput(InputStream is) { in = new BufferedReader(new InputStreamReader(is)); } public int read() { if (pos >= readLen) { pos = 0; try { readLen = in.read(buffer); } catch (IOException e) { throw new RuntimeException(); } if (readLen <= 0) { throw new MyInput.EndOfFileRuntimeException(); } } return buffer[pos++]; } public long nextLong() { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if (str[0] == '-') { i = 1; } for (; i < len; i++) ret = ret * 10 + str[i] - '0'; if (str[0] == '-') { ret = -ret; } return ret; } public char nextChar() { while (true) { final int c = read(); if (!isSpace[c]) { return (char) c; } } } int reads(int len, boolean[] accept) { try { while (true) { final int c = read(); if (accept[c]) { break; } if (str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char) c; } } catch (MyInput.EndOfFileRuntimeException e) { } return len; } static class EndOfFileRuntimeException extends RuntimeException { } } }