結果
問題 | No.2 素因数ゲーム |
ユーザー | yakamoto |
提出日時 | 2018-12-25 02:56:40 |
言語 | Scala(Beta) (3.4.0) |
結果 |
AC
|
実行時間 | 927 ms / 5,000 ms |
コード長 | 3,202 bytes |
コンパイル時間 | 10,121 ms |
コンパイル使用メモリ | 274,276 KB |
実行使用メモリ | 65,188 KB |
最終ジャッジ日時 | 2024-07-01 06:16:01 |
合計ジャッジ時間 | 40,372 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 900 ms
64,912 KB |
testcase_01 | AC | 903 ms
64,972 KB |
testcase_02 | AC | 919 ms
64,740 KB |
testcase_03 | AC | 917 ms
64,952 KB |
testcase_04 | AC | 902 ms
64,928 KB |
testcase_05 | AC | 910 ms
64,848 KB |
testcase_06 | AC | 906 ms
64,904 KB |
testcase_07 | AC | 903 ms
64,744 KB |
testcase_08 | AC | 904 ms
65,004 KB |
testcase_09 | AC | 914 ms
65,188 KB |
testcase_10 | AC | 910 ms
64,740 KB |
testcase_11 | AC | 909 ms
65,048 KB |
testcase_12 | AC | 914 ms
64,932 KB |
testcase_13 | AC | 912 ms
65,180 KB |
testcase_14 | AC | 913 ms
64,756 KB |
testcase_15 | AC | 914 ms
64,936 KB |
testcase_16 | AC | 915 ms
64,760 KB |
testcase_17 | AC | 913 ms
64,764 KB |
testcase_18 | AC | 901 ms
64,932 KB |
testcase_19 | AC | 906 ms
65,172 KB |
testcase_20 | AC | 910 ms
65,136 KB |
testcase_21 | AC | 904 ms
65,004 KB |
testcase_22 | AC | 912 ms
64,508 KB |
testcase_23 | AC | 913 ms
65,084 KB |
testcase_24 | AC | 909 ms
64,808 KB |
testcase_25 | AC | 906 ms
64,920 KB |
testcase_26 | AC | 906 ms
64,540 KB |
testcase_27 | AC | 919 ms
65,024 KB |
testcase_28 | AC | 921 ms
65,012 KB |
testcase_29 | AC | 916 ms
64,768 KB |
testcase_30 | AC | 927 ms
64,652 KB |
ソースコード
object Main { def main(args: Array[String]): Unit = { val s = new Main() s.solve() s.out.flush() } } class Main { import java.io._ import java.util.StringTokenizer import scala.collection.mutable import scala.util.Sorting import math.{abs, max, min} import mutable.{ArrayBuffer, ListBuffer} import scala.reflect.ClassTag val MOD = 1000000007 val out = new PrintWriter(System.out) def solve(): Unit = { val N = ni() val F = factorize(N) val xor = F.values.reduce(_ ^ _) if (xor != 0) out.println("Alice") else out.println("Bob") } /** * *注意* 10^12以上ぐらいからは使わないこと */ def factorize(n: Long): mutable.Map[Long, Long] = { import scala.collection.mutable val res = mutable.Map[Long, Long]() withDefaultValue 0 def minFactor(n0: Long, rt: Int, i: Int): Long = { if (i > rt) n0 // √n まで見つからなかったら n0は素数か1 else if (n0 % i == 0) i else minFactor(n0, rt, i + 1) } def step(n0: Long): Unit = { minFactor(n0, math.sqrt(n0).toInt, 2) match { case 1 => case f => res(f) = res(f) + 1 step(n0 / f) } } step(n) res } class InputReader(val stream: InputStream) { private val reader = new BufferedReader(new InputStreamReader(stream), 32768) private var tokenizer: StringTokenizer = _ def next(): String = { while (tokenizer == null || !tokenizer.hasMoreTokens) tokenizer = new StringTokenizer(reader.readLine) tokenizer.nextToken } def nextInt(): Int = next().toInt def nextLong(): Long = next().toLong def nextChar(): Char = next().charAt(0) } val sc = new InputReader(System.in) def ni(): Int = sc.nextInt() def nl(): Long = sc.nextLong() def nc(): Char = sc.nextChar() def ns(): String = sc.next() def ns(n: Int): Array[Char] = ns().toCharArray def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset) def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = { val A1, A2 = Array.ofDim[Int](n) REP(n) { i => A1(i) = ni() + offset A2(i) = ni() + offset } (A1, A2) } def nm(n: Int, m: Int): Array[Array[Int]] = { val A = Array.ofDim[Int](n, m) REP(n) { i => REP(m) { j => A(i)(j) = ni() } } A } def nal(n: Int): Array[Long] = map(n)(_ => nl()) def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m)) def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = { var i = offset val N = n + offset while(i < N) { f(i); i += 1 } } def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = { var i = n - 1 + offset while(i >= offset) { f(i); i -= 1 } } def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = { val res = Array.ofDim[A](n) REP(n)(i => res(i) = f(i + offset)) res } def sumL(as: Array[Int]): Long = { var s = 0L REP(as.length)(i => s += as(i)) s } def cumSum(as: Array[Int]) = { val cum = Array.ofDim[Long](as.length + 1) REP(as.length) { i => cum(i + 1) = cum(i) + as(i) } cum } }