結果
問題 | No.1186 長方形の敷き詰め |
ユーザー | 箱星 |
提出日時 | 2020-08-22 13:54:36 |
言語 | Kotlin (1.9.23) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,598 bytes |
コンパイル時間 | 15,428 ms |
コンパイル使用メモリ | 461,024 KB |
実行使用メモリ | 119,384 KB |
最終ジャッジ日時 | 2024-10-15 08:11:28 |
合計ジャッジ時間 | 28,449 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 302 ms
54,332 KB |
testcase_01 | AC | 302 ms
50,572 KB |
testcase_02 | AC | 390 ms
98,768 KB |
testcase_03 | AC | 307 ms
50,840 KB |
testcase_04 | AC | 304 ms
50,868 KB |
testcase_05 | AC | 307 ms
50,796 KB |
testcase_06 | AC | 304 ms
50,712 KB |
testcase_07 | AC | 307 ms
50,696 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 310 ms
50,844 KB |
testcase_12 | AC | 315 ms
51,088 KB |
testcase_13 | AC | 307 ms
50,900 KB |
testcase_14 | AC | 321 ms
51,032 KB |
testcase_15 | AC | 308 ms
50,860 KB |
testcase_16 | AC | 307 ms
50,852 KB |
testcase_17 | AC | 339 ms
64,964 KB |
testcase_18 | AC | 385 ms
96,568 KB |
testcase_19 | AC | 386 ms
98,676 KB |
testcase_20 | AC | 393 ms
98,848 KB |
testcase_21 | AC | 354 ms
77,012 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 387 ms
98,712 KB |
testcase_25 | AC | 347 ms
75,324 KB |
testcase_26 | AC | 352 ms
77,148 KB |
コンパイルメッセージ
Main.kt:100:10: warning: parameter 'args' is never used fun main(args: Array<String>) { ^
ソースコード
import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.io.PrintWriter import java.util.* // region class ModInt(x: Long) { companion object { const val MOD = 1000000007L } 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>() fun fact(n: Long): ModInt { if (fac.count() == 0) fac.add(ModInt(1)) while (fac.count() <= n) { fac.add(fac.last() * ModInt(fac.count().toLong())) } return fac[n.toInt()] } fun comb(n: Long, k: Long): ModInt { return fact(n) / fact(k) / fact(n - k) } 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 k = sc.nextInt() val n = sc.nextInt() var ans = ModInt(0) var i = 0 while (n - i * k >= 0) { ans += comb((n - i * k + i).toLong(), i.toLong()) i++ } println(ans) } fun main(args: Array<String>) { 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() }