結果

問題 No.1620 Substring Sum
ユーザー 👑 箱箱
提出日時 2021-07-22 22:37:12
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 514 ms / 2,000 ms
コード長 2,377 bytes
コンパイル時間 17,642 ms
コンパイル使用メモリ 430,824 KB
実行使用メモリ 56,276 KB
最終ジャッジ日時 2023-09-24 18:00:49
合計ジャッジ時間 28,760 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 264 ms
49,824 KB
testcase_01 AC 259 ms
50,124 KB
testcase_02 AC 263 ms
51,968 KB
testcase_03 AC 266 ms
50,156 KB
testcase_04 AC 479 ms
55,568 KB
testcase_05 AC 482 ms
55,672 KB
testcase_06 AC 485 ms
56,256 KB
testcase_07 AC 493 ms
55,528 KB
testcase_08 AC 500 ms
55,500 KB
testcase_09 AC 495 ms
55,816 KB
testcase_10 AC 488 ms
56,276 KB
testcase_11 AC 488 ms
55,708 KB
testcase_12 AC 343 ms
54,932 KB
testcase_13 AC 485 ms
55,604 KB
testcase_14 AC 497 ms
55,580 KB
testcase_15 AC 473 ms
55,780 KB
testcase_16 AC 434 ms
55,436 KB
testcase_17 AC 469 ms
56,072 KB
testcase_18 AC 261 ms
50,096 KB
testcase_19 AC 276 ms
50,164 KB
testcase_20 AC 514 ms
55,500 KB
testcase_21 AC 495 ms
55,804 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val s = nextLine()
    val n = s.length
    var ans = ModInt(0)
    for (i in 0 until n) {
        val left = i.toLong()
        val right = n - i - 1L
        ans += ModInt(s[i] - '0') * (ModInt(11).pow(right) * ModInt(2).pow(left))
    }
    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

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
0