結果

問題 No.1629 Sorting Integers (SUM of M)
ユーザー 箱星
提出日時 2021-07-30 21:16:42
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 494 ms / 2,000 ms
コード長 3,713 bytes
コンパイル時間 16,938 ms
コンパイル使用メモリ 452,568 KB
実行使用メモリ 138,648 KB
最終ジャッジ日時 2024-09-15 22:33:19
合計ジャッジ時間 26,174 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.PrintWriter
import java.util.*
import kotlin.math.*
fun PrintWriter.solve() {
    val n = nextInt()
    val c = Array(9) { nextInt() }
    var ans = ModInt(0)
    var pow10 = ModInt(1)
    val cc = CombinationCalculator()
    for (i in 0 until n) {
        ans += pow10
        pow10 *= ModInt(10)
    }
    var e = ModInt(0)
    val fact = cc.fac(n - 1)
    for (i in 0 until 9) {
        if (c[i] == 0) continue
        var v = fact
        for (j in 0 until 9) {
            if (i != j) {
                v /= cc.fac(c[j])
            } else {
                v /= cc.fac(c[j] - 1)
            }
        }
        e += (i + 1).toModInt() * v
    }
    ans *= e
    println(ans)
}
// region ModInt
class ModInt(x: Long) {
    companion object {
        const val MOD = 1000000007L
        //const val MOD = 998244353L
    }
    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"
    }
}
fun Long.toModInt(): ModInt {
    return ModInt(this)
}
fun Int.toModInt(): ModInt {
    return 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
class CombinationCalculator {
    companion object {
        private const val fac_size = 600000
    }
    private val arrFac = Array(fac_size) { ModInt(1) }
    private val arrInvfac = Array(fac_size) { ModInt(1) }
    init {
        for (i in 1 until fac_size) {
            arrFac[i] = arrFac[i - 1] * ModInt(i)
        }
        arrInvfac[fac_size - 1] = arrFac[fac_size - 1].inv()
        for (i in fac_size - 2 downTo 1) {
            arrInvfac[i] = arrInvfac[i + 1] * ModInt(i + 1)
        }
    }
    fun fac(n: Int): ModInt {
        return arrFac[n]
    }
    fun fac(n: Long): ModInt {
        return fac(n.toInt())
    }
    fun invfac(n: Int): ModInt {
        return arrInvfac[n]
    }
    fun invfac(n: Long): ModInt {
        return invfac(n.toInt())
    }
    fun binom(n: Long, k: Long): ModInt {
        return if (k in 0..n) {
            arrFac[n.toInt()] * arrInvfac[k.toInt()] * arrInvfac[(n - k).toInt()]
        } else {
            ModInt(0)
        }
    }
}
fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}
// 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
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0