結果

問題 No.1181 Product Sum for All Subsets
ユーザー 箱星箱星
提出日時 2020-11-29 01:57:41
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 294 ms / 2,000 ms
コード長 2,692 bytes
コンパイル時間 15,324 ms
コンパイル使用メモリ 446,232 KB
実行使用メモリ 54,500 KB
最終ジャッジ日時 2024-09-13 01:48:03
合計ジャッジ時間 24,714 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 281 ms
54,332 KB
testcase_01 AC 284 ms
54,260 KB
testcase_02 AC 282 ms
54,136 KB
testcase_03 AC 280 ms
54,360 KB
testcase_04 AC 280 ms
54,432 KB
testcase_05 AC 278 ms
54,476 KB
testcase_06 AC 281 ms
54,352 KB
testcase_07 AC 285 ms
54,460 KB
testcase_08 AC 290 ms
54,428 KB
testcase_09 AC 284 ms
54,380 KB
testcase_10 AC 287 ms
54,404 KB
testcase_11 AC 284 ms
54,448 KB
testcase_12 AC 284 ms
54,456 KB
testcase_13 AC 283 ms
54,376 KB
testcase_14 AC 283 ms
54,364 KB
testcase_15 AC 282 ms
54,340 KB
testcase_16 AC 283 ms
54,332 KB
testcase_17 AC 280 ms
54,400 KB
testcase_18 AC 290 ms
54,272 KB
testcase_19 AC 279 ms
54,244 KB
testcase_20 AC 285 ms
54,260 KB
testcase_21 AC 282 ms
54,496 KB
testcase_22 AC 280 ms
54,468 KB
testcase_23 AC 280 ms
54,348 KB
testcase_24 AC 285 ms
54,352 KB
testcase_25 AC 292 ms
54,352 KB
testcase_26 AC 294 ms
54,292 KB
testcase_27 AC 288 ms
54,376 KB
testcase_28 AC 288 ms
54,500 KB
testcase_29 AC 290 ms
54,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.InputStream
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() = with(FastScanner(System.`in`)) {
    val n = nextLong()
    val k = nextLong()
    val a = ModInt(k) * ModInt(k + 3) / ModInt(2)
    val b = ModInt(k) * ModInt(k + 1) / ModInt(2)
    println(a.pow(n) - b.pow(n))
}

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

class FastScanner(s: InputStream) {
    private var st = StringTokenizer("")
    private val br = s.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()
}
0