結果

問題 No.1396 Giri
ユーザー 箱星箱星
提出日時 2021-02-14 22:02:27
言語 Kotlin
(1.9.23)
結果
WA  
実行時間 -
コード長 4,201 bytes
コンパイル時間 18,340 ms
コンパイル使用メモリ 465,532 KB
実行使用メモリ 111,300 KB
最終ジャッジ日時 2024-07-22 09:41:47
合計ジャッジ時間 25,956 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 319 ms
110,484 KB
testcase_01 AC 321 ms
110,468 KB
testcase_02 WA -
testcase_03 AC 320 ms
110,404 KB
testcase_04 AC 325 ms
110,604 KB
testcase_05 WA -
testcase_06 AC 331 ms
110,484 KB
testcase_07 AC 324 ms
110,596 KB
testcase_08 AC 318 ms
110,664 KB
testcase_09 AC 323 ms
110,424 KB
testcase_10 AC 323 ms
110,500 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 327 ms
110,460 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 375 ms
111,108 KB
testcase_19 AC 392 ms
110,928 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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

const val fac_size = 600000
var fac_initialized = false
val arr_fac = Array(fac_size) { ModInt(1) }
val arr_invfac = Array(fac_size) { ModInt(1) }

fun facInitialize() {
    for (i in 1 until fac_size) {
        arr_fac[i] = arr_fac[i - 1] * ModInt(i)
    }
    arr_invfac[fac_size - 1] = arr_fac[fac_size - 1].inv()
    for (i in fac_size - 2 downTo 1) {
        arr_invfac[i] = arr_invfac[i + 1] * ModInt(i + 1)
    }
    fac_initialized = true
}

fun fac(n: Int): ModInt {
    if (!fac_initialized) facInitialize()
    return arr_fac[n]
}

fun fac(n: Long): ModInt {
    return fac(n.toInt())
}

fun invfac(n: Int): ModInt {
    if (!fac_initialized) facInitialize()
    return arr_invfac[n]
}

fun invfac(n: Long): ModInt {
    return invfac(n.toInt())
}

fun comb(n: Long, k: Long): ModInt {
    return if (k in 0..n) {
        if (!fac_initialized) facInitialize()
        arr_fac[n.toInt()] * arr_invfac[k.toInt()] * arr_invfac[(n - k).toInt()]
    } else {
        ModInt(0)
    }
}

fun comb2(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 PrintWriter.solve() {
    val n = nextLong()
    val isPrime = BooleanArray(n.toInt() + 2) { true }
    val pf = mutableMapOf<Long, Long>()
    for (i in 2..n) {
        if (!isPrime[i.toInt()]) continue
        var j = 2
        while (i * j <= n) {
            isPrime[(i * j).toInt()] = false
            j++
        }
        var exp = 1L
        var pow = i
        while (true) {
            if (pow * i <= n) {
                pow *= i
                exp++
            } else {
                break
            }
        }
        pf[i] = exp
    }

    // region prime factorization
    var number = if (isPrime[n.toInt()]) n else n - 1
    var divisor = 2L
    while (divisor * divisor <= number) {
        var count = 0
        while (number % divisor == 0L) {
            number /= divisor
            count++
        }
        if (count > 0) {
            pf[divisor] = pf[divisor]!! - count
        }
        divisor++
    }
    if (number > 1) pf[number] = pf[number]!! - 1
    // endregion
    val num = pf.map { ModInt(it.key).pow(it.value) }.fold(ModInt(1), { x, y -> x * y })
    println(num)
}

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