結果
問題 | No.1126 SUM |
ユーザー | 👑 箱星 |
提出日時 | 2020-08-19 18:51:50 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 391 ms / 1,000 ms |
コード長 | 2,715 bytes |
コンパイル時間 | 14,758 ms |
コンパイル使用メモリ | 443,644 KB |
実行使用メモリ | 91,932 KB |
最終ジャッジ日時 | 2024-04-20 09:43:57 |
合計ジャッジ時間 | 22,336 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 349 ms
86,304 KB |
testcase_01 | AC | 361 ms
91,732 KB |
testcase_02 | AC | 316 ms
87,644 KB |
testcase_03 | AC | 307 ms
87,612 KB |
testcase_04 | AC | 366 ms
91,856 KB |
testcase_05 | AC | 341 ms
91,892 KB |
testcase_06 | AC | 310 ms
87,616 KB |
testcase_07 | AC | 337 ms
91,828 KB |
testcase_08 | AC | 341 ms
91,712 KB |
testcase_09 | AC | 341 ms
91,832 KB |
testcase_10 | AC | 345 ms
91,764 KB |
testcase_11 | AC | 344 ms
91,848 KB |
testcase_12 | AC | 361 ms
91,880 KB |
testcase_13 | AC | 313 ms
87,708 KB |
testcase_14 | AC | 334 ms
91,724 KB |
testcase_15 | AC | 318 ms
87,756 KB |
testcase_16 | AC | 351 ms
91,772 KB |
testcase_17 | AC | 338 ms
87,780 KB |
testcase_18 | AC | 348 ms
91,732 KB |
testcase_19 | AC | 369 ms
91,760 KB |
testcase_20 | AC | 317 ms
87,600 KB |
testcase_21 | AC | 355 ms
91,736 KB |
testcase_22 | AC | 341 ms
91,932 KB |
testcase_23 | AC | 362 ms
91,640 KB |
testcase_24 | AC | 332 ms
91,716 KB |
testcase_25 | AC | 391 ms
91,660 KB |
ソースコード
import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.io.PrintWriter import java.util.* // ModInt // region class ModInt(x: Long) { companion object { const val MOD = 1000000007L //const val MOD = 998244353L } 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" } } val fac = mutableListOf<ModInt>() val invfac = mutableListOf<ModInt>() fun fact(n: Long, b: Boolean): ModInt { if (fac.count() == 0) { fac.add(ModInt(1)) invfac.add(ModInt(1)) } while (fac.count() <= n) { fac.add(fac.last() * ModInt(fac.count().toLong())) invfac.add(fac.last().inv()) } return if (b) { fac[n.toInt()] } else { invfac[n.toInt()] } } fun comb(n: Long, k: Long): ModInt { return fact(n, true) * fact(k, false) * fact(n - k, false) } fun comb2(n: Long, k: Long): ModInt { var ans = ModInt(1) for (i in 0 until k) { ans = ans * ModInt(n - i) / ModInt(k - i) } return ans } // endregion fun PrintWriter.solve(sc: FastScanner) { val n = sc.nextLong() val m = sc.nextLong() println(comb(m + 1, n + 1)) } fun main() { val writer = PrintWriter(System.out, false) writer.solve(FastScanner(System.`in`)) writer.flush() } class FastScanner(s: InputStream) { private var st = StringTokenizer("") private val br = BufferedReader(InputStreamReader(s)) 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() fun ready() = br.ready() }