結果

問題 No.2 素因数ゲーム
ユーザー tutuz
提出日時 2018-12-29 09:48:42
言語 Java
(openjdk 23)
結果
AC  
実行時間 82 ms / 5,000 ms
コード長 4,391 bytes
コンパイル時間 5,107 ms
コンパイル使用メモリ 95,900 KB
実行使用メモリ 37,696 KB
最終ジャッジ日時 2024-12-26 13:38:50
合計ジャッジ時間 8,735 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 {
        }

    }
}
0