結果

問題 No.2130 分配方法の数え上げ mod 998244353
ユーザー 箱星箱星
提出日時 2022-10-18 23:03:10
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 422 ms / 2,000 ms
コード長 2,950 bytes
コンパイル時間 14,691 ms
コンパイル使用メモリ 446,460 KB
実行使用メモリ 81,364 KB
最終ジャッジ日時 2024-06-29 06:54:45
合計ジャッジ時間 27,823 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 292 ms
49,960 KB
testcase_01 AC 293 ms
49,976 KB
testcase_02 AC 290 ms
49,912 KB
testcase_03 AC 292 ms
49,984 KB
testcase_04 AC 289 ms
49,868 KB
testcase_05 AC 293 ms
49,844 KB
testcase_06 AC 292 ms
50,108 KB
testcase_07 AC 294 ms
50,176 KB
testcase_08 AC 293 ms
49,824 KB
testcase_09 AC 292 ms
49,668 KB
testcase_10 AC 291 ms
50,156 KB
testcase_11 AC 295 ms
49,832 KB
testcase_12 AC 295 ms
49,788 KB
testcase_13 AC 294 ms
50,080 KB
testcase_14 AC 304 ms
50,552 KB
testcase_15 AC 301 ms
51,116 KB
testcase_16 AC 300 ms
50,444 KB
testcase_17 AC 310 ms
54,148 KB
testcase_18 AC 321 ms
63,048 KB
testcase_19 AC 325 ms
63,616 KB
testcase_20 AC 290 ms
50,080 KB
testcase_21 AC 319 ms
64,140 KB
testcase_22 AC 297 ms
49,860 KB
testcase_23 AC 320 ms
64,296 KB
testcase_24 AC 294 ms
50,052 KB
testcase_25 AC 318 ms
64,336 KB
testcase_26 AC 291 ms
50,236 KB
testcase_27 AC 412 ms
81,228 KB
testcase_28 AC 292 ms
49,696 KB
testcase_29 AC 422 ms
81,364 KB
testcase_30 AC 292 ms
49,972 KB
testcase_31 AC 288 ms
49,704 KB
testcase_32 AC 293 ms
49,676 KB
testcase_33 AC 292 ms
49,904 KB
testcase_34 AC 294 ms
50,056 KB
testcase_35 AC 293 ms
49,828 KB
testcase_36 AC 292 ms
49,956 KB
testcase_37 AC 288 ms
49,860 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextLong()
    val m = nextLong()
    var ans = ModInt(2).pow(n)
    var comb = ModInt(1)
    for (i in 0 until m) {
        ans -= comb
        comb *= ModInt(n - i)
        comb /= ModInt(i + 1)
    }
    println(ans)
}

// region ModInt
class ModInt(x: Long) {
    companion object {
        const val MOD = 998244353L
        //const val MOD = 1000000007L
    }

    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"
    }
}

class ModIntArray(n: Int) {
    private val a = LongArray(n) { 0L }

    constructor(n: Int, init: (Int) -> ModInt) : this(n) {
        for (i in 0 until n) {
            a[i] = init(i).x
        }
    }

    operator fun set(i: Int, x: ModInt) {
        a[i] = x.x
    }

    operator fun get(i: Int): ModInt {
        return ModInt(a[i])
    }

    fun joinToString(s: String = ", "): String {
        return a.joinToString(s)
    }
}

fun Long.toModInt() = ModInt(this)

fun Int.toModInt() = 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() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", abs(1L.shl(26)))
        .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } }
        .apply { start() }.join()
}

// 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
0