結果
問題 | No.1659 Product of Divisors |
ユーザー | 👑 箱 |
提出日時 | 2021-07-10 10:50:41 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 291 ms / 2,000 ms |
コード長 | 2,688 bytes |
コンパイル時間 | 14,418 ms |
コンパイル使用メモリ | 426,428 KB |
実行使用メモリ | 54,556 KB |
最終ジャッジ日時 | 2023-08-13 06:59:10 |
合計ジャッジ時間 | 23,883 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 276 ms
52,636 KB |
testcase_01 | AC | 276 ms
52,552 KB |
testcase_02 | AC | 274 ms
52,648 KB |
testcase_03 | AC | 273 ms
52,592 KB |
testcase_04 | AC | 276 ms
52,640 KB |
testcase_05 | AC | 277 ms
52,540 KB |
testcase_06 | AC | 282 ms
52,656 KB |
testcase_07 | AC | 280 ms
52,808 KB |
testcase_08 | AC | 275 ms
52,624 KB |
testcase_09 | AC | 274 ms
52,796 KB |
testcase_10 | AC | 289 ms
52,708 KB |
testcase_11 | AC | 276 ms
52,508 KB |
testcase_12 | AC | 277 ms
54,556 KB |
testcase_13 | AC | 272 ms
52,376 KB |
testcase_14 | AC | 274 ms
52,960 KB |
testcase_15 | AC | 277 ms
52,804 KB |
testcase_16 | AC | 273 ms
52,532 KB |
testcase_17 | AC | 273 ms
52,680 KB |
testcase_18 | AC | 276 ms
52,560 KB |
testcase_19 | AC | 272 ms
52,652 KB |
testcase_20 | AC | 272 ms
52,660 KB |
testcase_21 | AC | 276 ms
52,588 KB |
testcase_22 | AC | 291 ms
52,640 KB |
testcase_23 | AC | 277 ms
52,960 KB |
testcase_24 | AC | 283 ms
52,564 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextLong() val k = nextLong() // region prime factorization var number = n var divisor = 2L val pf = mutableMapOf<Long, Long>() while (divisor * divisor <= number) { var count = 0L while (number % divisor == 0L) { number /= divisor count++ } if (count > 0) { pf[divisor] = count } divisor++ } if (number > 1) pf[number] = 1 // endregion val ans = pf.values.map { binomSimple(it + k, it) }.fold(ModInt(1), ModInt::times) println(ans) } // region ModInt class ModInt(x: Long) { companion object { const val MOD = 1000000007L //const val MOD = 998244353L } constructor(y: Int) : this(y.toLong()) val x = (x % MOD + MOD) % MOD operator fun plus(other: ModInt): ModInt { return ModInt(x + other.x) } operator fun minus(other: ModInt): ModInt { return ModInt(x - other.x) } operator fun times(other: ModInt): ModInt { return ModInt(x * other.x) } operator fun div(other: ModInt): ModInt { return this * other.inv() } fun pow(exp: Long): ModInt { if (exp == 0L) return ModInt(1L) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } fun inv(): ModInt { return this.pow(MOD - 2) } override fun equals(other: Any?): Boolean { if (this === other) return true if (javaClass != other?.javaClass) return false other as ModInt if (x != other.x) return false return true } override fun hashCode(): Int { return x.hashCode() } override fun toString(): String { return "$x" } } fun Long.toModInt(): ModInt { return ModInt(this) } fun Int.toModInt(): ModInt { return ModInt(this) } fun binomSimple(n: Long, k: Long): ModInt { var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until k) { numer *= ModInt(n - i) denom *= ModInt(k - i) } return numer / denom } // endregion fun main() { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.bufferedReader() fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() // endregion