結果

問題 No.1186 長方形の敷き詰め
ユーザー 箱星箱星
提出日時 2020-08-22 13:39:42
言語 Kotlin
(1.9.23)
結果
WA  
実行時間 -
コード長 2,861 bytes
コンパイル時間 14,592 ms
コンパイル使用メモリ 451,448 KB
実行使用メモリ 110,272 KB
最終ジャッジ日時 2024-10-15 07:54:06
合計ジャッジ時間 23,594 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 266 ms
54,260 KB
testcase_01 AC 267 ms
54,420 KB
testcase_02 AC 293 ms
85,296 KB
testcase_03 AC 262 ms
54,228 KB
testcase_04 AC 279 ms
54,252 KB
testcase_05 AC 274 ms
54,368 KB
testcase_06 AC 269 ms
54,464 KB
testcase_07 AC 268 ms
54,196 KB
testcase_08 AC 269 ms
54,488 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 270 ms
54,276 KB
testcase_12 AC 270 ms
54,352 KB
testcase_13 AC 278 ms
54,444 KB
testcase_14 AC 272 ms
54,276 KB
testcase_15 AC 267 ms
54,448 KB
testcase_16 AC 273 ms
54,528 KB
testcase_17 AC 284 ms
62,676 KB
testcase_18 AC 289 ms
72,704 KB
testcase_19 AC 291 ms
77,108 KB
testcase_20 AC 284 ms
78,984 KB
testcase_21 AC 286 ms
70,940 KB
testcase_22 AC 339 ms
110,272 KB
testcase_23 AC 333 ms
98,240 KB
testcase_24 AC 325 ms
96,284 KB
testcase_25 AC 296 ms
73,156 KB
testcase_26 AC 289 ms
70,672 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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()
    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()
}
0