結果

問題 No.2 素因数ゲーム
ユーザー ゆうきゆうき
提出日時 2022-10-16 00:29:31
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,618 bytes
コンパイル時間 2,917 ms
コンパイル使用メモリ 92,316 KB
実行使用メモリ 57,368 KB
最終ジャッジ日時 2024-06-26 23:08:11
合計ジャッジ時間 8,270 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 146 ms
57,352 KB
testcase_01 AC 143 ms
57,240 KB
testcase_02 AC 145 ms
57,184 KB
testcase_03 AC 141 ms
57,100 KB
testcase_04 AC 143 ms
56,964 KB
testcase_05 AC 143 ms
57,192 KB
testcase_06 AC 153 ms
57,168 KB
testcase_07 WA -
testcase_08 AC 144 ms
57,128 KB
testcase_09 AC 142 ms
57,192 KB
testcase_10 AC 143 ms
57,088 KB
testcase_11 AC 142 ms
57,164 KB
testcase_12 WA -
testcase_13 AC 144 ms
57,288 KB
testcase_14 AC 143 ms
56,984 KB
testcase_15 AC 145 ms
57,200 KB
testcase_16 AC 142 ms
57,164 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 146 ms
57,192 KB
testcase_20 AC 145 ms
57,072 KB
testcase_21 AC 144 ms
57,072 KB
testcase_22 AC 154 ms
57,164 KB
testcase_23 AC 149 ms
56,852 KB
testcase_24 AC 152 ms
57,092 KB
testcase_25 AC 148 ms
57,184 KB
testcase_26 WA -
testcase_27 AC 142 ms
56,884 KB
testcase_28 AC 143 ms
57,140 KB
testcase_29 WA -
testcase_30 AC 140 ms
57,244 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.lang.management.ManagementFactory;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedHashSet;
import java.util.Map;
import java.util.Set;
import java.util.function.IntFunction;

class Main{
  boolean isDebug = ManagementFactory.getRuntimeMXBean().getInputArguments().toString()
      .contains("-agentlib:jdwp");
  final MyReader in = new MyReader(System.in);
  final MyWriter out = new MyWriter(System.out);

  public static void main(final String[] args){ new Main().exe(); }

  private void exe(){
    input();
    preCalc();
    solve();
    out.flush();
  }

  int N = in.it();

  private void input(){}

  private void preCalc(){}

  void solve(){
    Set<Integer> set = primes(100000);

    Map<Integer, Integer> map = new HashMap<>();

    for (var p:set)
      while (N %p == 0) {
        N /= p;
        map.merge(p,1,Integer::sum);
      }

    if (1 < N)
      map.merge(N,1,Integer::sum);

    String[] ans = { "Alice", "Bob" };

    int win = 0;
    for (var n:map.values())
      win ^= n;

    out.println(ans[1 -popcount(win) &1]);
  }

  Set<Integer> primes(final int bound){
    Set<Integer> ret = new LinkedHashSet<>();
    for (int i = 2;i <= bound;i++) {
      boolean flg = true;
      for (final int p:ret)
        if (i %p == 0) {
          flg = false;
          break;
        } else if (i < p *p)
          break;
      if (flg)
        ret.add(i);
    }
    return ret;
  }

  int popcount(long x){
    x = x -(x >>1 &0x5555555555555555L);
    x = (x &0x3333333333333333L) +(x >>2 &0x3333333333333333L);
    x = x +(x >>4) &0x0f0f0f0f0f0f0f0fL;
    x = x +(x >>8);
    x = x +(x >>16);
    x = x +(x >>32);
    return (int) x &0x0000007f;
  }

  /* 定数 */
  final int mod = (int) 1e9 +7;
  final String yes = "Yes";
  final String no = "No";

  /* 入力 */
  static class MyReader{
    byte[] buf = new byte[1 <<16];
    int head = 0;
    int tail = 0;
    InputStream in;

    public MyReader(final InputStream in){ this.in = in; }

    byte read(){
      if (head == tail) {
        try {
          tail = in.read(buf);
        } catch (IOException e) {
          e.printStackTrace();
        }
        head = 0;
      }
      return buf[head++];
    }

    boolean isPrintable(final byte c){ return 32 < c && c < 127; }

    boolean isNum(final byte c){ return 47 < c && c < 58; }

    byte nextPrintable(){
      byte ret = read();
      return isPrintable(ret) ? ret : nextPrintable();
    }

    int it(){ return (int) lg(); }

    int[] it(final int N){
      int[] a = new int[N];
      Arrays.setAll(a,i -> it());
      return a;
    }

    int[][] it(final int H,final int W){ return arr(new int[H][],i -> it(W)); }

    int idx(){ return it() -1; }

    int[] idx(final int N){
      int[] a = new int[N];
      Arrays.setAll(a,i -> idx());
      return a;
    }

    int[][] idx(final int H,final int W){ return arr(new int[H][],i -> idx(W)); }

    long lg(){
      byte i = nextPrintable();
      boolean negative = i == 45;
      long n = negative ? 0 : i -'0';
      while (isPrintable(i = read()))
        n = 10 *n +i -'0';
      return negative ? -n : n;
    }

    long[] lg(final int N){
      long[] a = new long[N];
      Arrays.setAll(a,i -> lg());
      return a;
    }

    long[][] lg(final int H,final int W){ return arr(new long[H][],i -> lg(W)); }

    char[] ch(){ return str().toCharArray(); }

    char[][] ch(final int H){ return arr(new char[H][],i -> ch()); }

    String line(){
      StringBuilder sb = new StringBuilder();

      byte c;
      while (isPrintable(c = read()) || c == ' ')
        sb.append((char) c);
      return sb.toString();
    }

    String str(){
      StringBuilder sb = new StringBuilder();
      sb.append((char) nextPrintable());
      byte c;
      while (isPrintable(c = read()))
        sb.append((char) c);
      return sb.toString();
    }

    String[] str(final int N){ return arr(new String[N],i -> str()); }

    <T> T[] arr(final T[] arr,final IntFunction<T> f){
      Arrays.setAll(arr,f);
      return arr;
    }
  }

  /* 出力 */
  static class MyWriter{
    OutputStream out;

    byte[] buf = new byte[1 <<16];
    byte[] ibuf = new byte[20];

    int tail = 0;

    public MyWriter(final OutputStream out){ this.out = out; }

    void flush(){
      try {
        out.write(buf,0,tail);
        tail = 0;
      } catch (IOException e) {
        e.printStackTrace();
      }
    }

    void write(final byte b){
      buf[tail++] = b;
      if (tail == buf.length)
        flush();
    }

    void write(final byte[] b,final int off,final int len){
      for (int i = off;i < off +len;i++)
        write(b[i]);
    }

    void write(final char c){ write((byte) c); }

    void write(long n){
      if (n < 0) {
        n = -n;
        write('-');
      }

      int i = ibuf.length;
      do {
        ibuf[--i] = (byte) (n %10 +'0');
        n /= 10;
      } while (n > 0);

      write(ibuf,i,ibuf.length -i);
    }

    void println(final long n){
      write(n);
      write('\n');
    }

    public void println(final double d){ println(String.valueOf(d)); }

    void println(final String s){
      byte[] b = s.getBytes();
      for (byte bb:b)
        write(bb);
      write('\n');
    }

    public void println(final char[] s){
      for (char bb:s)
        write(bb);
      write('\n');
    }

    void println(final int[] a){
      for (int i = 0;i < a.length;i++) {
        if (0 < i)
          write(' ');
        write(a[i]);
      }
      write('\n');
    }

  }
}
0