結果

問題 No.2752 文字列の数え上げ mod 998244353
ユーザー 👑 箱星箱星
提出日時 2022-10-23 10:41:41
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 944 ms / 2,000 ms
コード長 2,888 bytes
コンパイル時間 14,887 ms
コンパイル使用メモリ 446,112 KB
実行使用メモリ 88,836 KB
最終ジャッジ日時 2024-05-10 20:50:32
合計ジャッジ時間 27,544 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 316 ms
58,468 KB
testcase_01 AC 298 ms
58,556 KB
testcase_02 AC 327 ms
58,680 KB
testcase_03 AC 324 ms
58,584 KB
testcase_04 AC 324 ms
58,376 KB
testcase_05 AC 332 ms
58,544 KB
testcase_06 AC 326 ms
58,592 KB
testcase_07 AC 331 ms
58,584 KB
testcase_08 AC 300 ms
58,380 KB
testcase_09 AC 296 ms
58,584 KB
testcase_10 AC 293 ms
58,504 KB
testcase_11 AC 329 ms
58,600 KB
testcase_12 AC 333 ms
58,560 KB
testcase_13 AC 330 ms
58,644 KB
testcase_14 AC 332 ms
58,360 KB
testcase_15 AC 326 ms
58,568 KB
testcase_16 AC 326 ms
58,580 KB
testcase_17 AC 294 ms
58,576 KB
testcase_18 AC 303 ms
58,404 KB
testcase_19 AC 297 ms
58,576 KB
testcase_20 AC 815 ms
88,760 KB
testcase_21 AC 944 ms
88,736 KB
testcase_22 AC 939 ms
88,836 KB
testcase_23 AC 908 ms
88,820 KB
testcase_24 AC 932 ms
88,764 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val numCases = nextInt()
    case@ for (_i in 0 until numCases) {
        val l = nextLong()
        println((ModInt(26).pow(l + 1) - ModInt(26)) / ModInt(25))
    }
}

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