結果

問題 No.103 素因数ゲーム リターンズ
ユーザー yuya178yuya178
提出日時 2018-01-10 23:29:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 82 ms / 5,000 ms
コード長 5,917 bytes
コンパイル時間 4,533 ms
コンパイル使用メモリ 77,976 KB
実行使用メモリ 54,312 KB
最終ジャッジ日時 2023-08-25 10:42:03
合計ジャッジ時間 6,108 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
53,300 KB
testcase_01 AC 63 ms
53,432 KB
testcase_02 AC 62 ms
53,912 KB
testcase_03 AC 75 ms
53,788 KB
testcase_04 AC 74 ms
53,632 KB
testcase_05 AC 74 ms
53,592 KB
testcase_06 AC 75 ms
53,228 KB
testcase_07 AC 75 ms
52,016 KB
testcase_08 AC 64 ms
53,696 KB
testcase_09 AC 63 ms
53,580 KB
testcase_10 AC 68 ms
53,816 KB
testcase_11 AC 74 ms
53,008 KB
testcase_12 AC 71 ms
54,312 KB
testcase_13 AC 76 ms
54,152 KB
testcase_14 AC 81 ms
53,728 KB
testcase_15 AC 82 ms
53,556 KB
testcase_16 AC 63 ms
53,796 KB
testcase_17 AC 80 ms
53,704 KB
testcase_18 AC 77 ms
53,700 KB
testcase_19 AC 72 ms
54,108 KB
testcase_20 AC 77 ms
53,664 KB
testcase_21 AC 81 ms
53,956 KB
testcase_22 AC 68 ms
53,580 KB
testcase_23 AC 70 ms
53,936 KB
testcase_24 AC 81 ms
53,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long MOD = 1_000_000_007;
    int inf = Integer.MAX_VALUE/2;

    long ans = 0;
    void solve(){
        int n = ni();
        int[] m = new int[n];
        for(int i = 0; i < n; i++){
            m[i] = ni();
        }
        int[] g = new int[10000];
        for(int i = 1; i < 10000; i++){
            HashSet<Integer> set = new HashSet<>();
            set.add(g[i-1]);
            if(i>1) set.add(g[i-2]);
            while(set.contains(g[i])) g[i]++;
        }
        int[] primes = sieveEratosthenes(10000);
        int ans = 0;
        for(int i = 0; i < n; i++){
            for(int j : primes){
                int res = 0;
                while(m[i]%j==0){
                    m[i] /= j;
                    res++;
                }
                ans ^= g[res];
            }
        }
        out.println(ans==0 ? "Bob" : "Alice");

    }

    public static int[] sieveEratosthenes(int n) {
        if (n <= 32) {
            int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
            for (int i = 0; i < primes.length; i++) {
                if (n < primes[i]) {
                    return Arrays.copyOf(primes, i);
                }
            }
            return primes;
        }

        int u = n + 32;
        double lu = Math.log(u);
        int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];
        ret[0] = 2;
        int pos = 1;

        int[] isnp = new int[(n + 1) / 32 / 2 + 1];
        int sup = (n + 1) / 32 / 2 + 1;

        int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
        for (int tp : tprimes) {
            ret[pos++] = tp;
            int[] ptn = new int[tp];
            for (int i = (tp - 3) / 2; i < tp << 5; i += tp)
                ptn[i >> 5] |= 1 << (i & 31);
            for (int j = 0; j < sup; j += tp) {
                for (int i = 0; i < tp && i + j < sup; i++) {
                    isnp[j + i] |= ptn[i];
                }
            }
        }

        // 3,5,7
        // 2x+3=n
        int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,
                9, 6, 16, 5, 15, 14 };
        int h = n / 2;
        for (int i = 0; i < sup; i++) {
            for (int j = ~isnp[i]; j != 0; j &= j - 1) {
                int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];
                int p = 2 * pp + 3;
                if (p > n)
                    break;
                ret[pos++] = p;
                if ((long) p * p > n)
                    continue;
                for (int q = (p * p - 3) / 2; q <= h; q += p)
                    isnp[q >> 5] |= 1 << q;
            }
        }

        return Arrays.copyOf(ret, pos);
    }

    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0