結果
問題 | No.1186 長方形の敷き詰め |
ユーザー | 👑 箱 |
提出日時 | 2020-08-22 14:01:25 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 322 ms / 2,000 ms |
コード長 | 2,919 bytes |
コンパイル時間 | 12,587 ms |
コンパイル使用メモリ | 451,160 KB |
実行使用メモリ | 110,836 KB |
最終ジャッジ日時 | 2024-04-23 08:27:19 |
合計ジャッジ時間 | 21,004 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 263 ms
54,248 KB |
testcase_01 | AC | 262 ms
54,456 KB |
testcase_02 | AC | 283 ms
85,428 KB |
testcase_03 | AC | 256 ms
54,432 KB |
testcase_04 | AC | 252 ms
54,348 KB |
testcase_05 | AC | 252 ms
54,340 KB |
testcase_06 | AC | 254 ms
54,532 KB |
testcase_07 | AC | 242 ms
54,460 KB |
testcase_08 | AC | 245 ms
54,204 KB |
testcase_09 | AC | 253 ms
54,324 KB |
testcase_10 | AC | 255 ms
54,384 KB |
testcase_11 | AC | 255 ms
54,396 KB |
testcase_12 | AC | 249 ms
54,428 KB |
testcase_13 | AC | 251 ms
54,316 KB |
testcase_14 | AC | 264 ms
54,408 KB |
testcase_15 | AC | 263 ms
54,288 KB |
testcase_16 | AC | 261 ms
54,456 KB |
testcase_17 | AC | 280 ms
62,664 KB |
testcase_18 | AC | 280 ms
72,936 KB |
testcase_19 | AC | 280 ms
76,960 KB |
testcase_20 | AC | 278 ms
78,996 KB |
testcase_21 | AC | 269 ms
70,952 KB |
testcase_22 | AC | 322 ms
110,836 KB |
testcase_23 | AC | 301 ms
98,536 KB |
testcase_24 | AC | 300 ms
96,408 KB |
testcase_25 | AC | 279 ms
73,072 KB |
testcase_26 | AC | 274 ms
70,812 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.nextInt() val m = sc.nextInt() if (n == 1) { println(1) return } val dp = Array(m + 1) { ModInt(1) } for (i in 2..m) { dp[i] = dp[i - 1] if (i - n >= 0) { dp[i] += dp[i - n] } } println(dp[m]) } 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() }