結果

問題 No.1578 A × B × C
ユーザー 箱星箱星
提出日時 2021-07-02 21:58:41
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 260 ms / 2,000 ms
コード長 2,505 bytes
コンパイル時間 12,455 ms
コンパイル使用メモリ 445,532 KB
実行使用メモリ 54,468 KB
最終ジャッジ日時 2024-06-29 11:29:56
合計ジャッジ時間 17,863 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 242 ms
54,124 KB
testcase_01 AC 240 ms
54,268 KB
testcase_02 AC 245 ms
54,184 KB
testcase_03 AC 243 ms
54,112 KB
testcase_04 AC 239 ms
54,128 KB
testcase_05 AC 249 ms
54,356 KB
testcase_06 AC 243 ms
54,240 KB
testcase_07 AC 246 ms
54,468 KB
testcase_08 AC 248 ms
54,452 KB
testcase_09 AC 245 ms
54,252 KB
testcase_10 AC 260 ms
54,236 KB
testcase_11 AC 241 ms
54,120 KB
testcase_12 AC 245 ms
54,224 KB
testcase_13 AC 244 ms
54,148 KB
testcase_14 AC 239 ms
54,128 KB
testcase_15 AC 249 ms
54,164 KB
testcase_16 AC 239 ms
54,384 KB
testcase_17 AC 239 ms
54,148 KB
testcase_18 AC 241 ms
54,256 KB
testcase_19 AC 250 ms
54,296 KB
testcase_20 AC 239 ms
54,180 KB
testcase_21 AC 238 ms
54,248 KB
testcase_22 AC 239 ms
54,196 KB
testcase_23 AC 241 ms
54,016 KB
testcase_24 AC 249 ms
54,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*

fun pow(n: Long, e: Long): Long {
    val mod = 1000000006L
    if (e == 0L) return 1
    if (e == 1L) return n % mod
    val x = pow(n, e / 2)
    val y = x * x % mod
    if (e % 2 == 0L) return y
    else return y * n % mod
}

fun PrintWriter.solve() {
    val a = nextLong()
    val b = nextLong()
    val c = nextLong()
    val k = nextLong()
    val p = ModInt(a) * ModInt(b) * ModInt(c)
    val e = pow(2, k)
    println(p.pow(e))
}

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