結果

問題 No.1396 Giri
ユーザー 👑 箱星箱星
提出日時 2021-02-24 20:06:50
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 456 ms / 2,000 ms
コード長 2,856 bytes
コンパイル時間 17,927 ms
コンパイル使用メモリ 450,952 KB
実行使用メモリ 65,660 KB
最終ジャッジ日時 2023-10-25 01:15:27
合計ジャッジ時間 27,713 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 286 ms
51,892 KB
testcase_01 AC 290 ms
51,896 KB
testcase_02 AC 450 ms
65,644 KB
testcase_03 AC 286 ms
51,904 KB
testcase_04 AC 288 ms
51,896 KB
testcase_05 AC 449 ms
65,660 KB
testcase_06 AC 289 ms
51,896 KB
testcase_07 AC 288 ms
51,892 KB
testcase_08 AC 288 ms
51,888 KB
testcase_09 AC 289 ms
51,896 KB
testcase_10 AC 287 ms
51,888 KB
testcase_11 AC 288 ms
51,880 KB
testcase_12 AC 285 ms
51,892 KB
testcase_13 AC 288 ms
51,900 KB
testcase_14 AC 291 ms
51,908 KB
testcase_15 AC 289 ms
51,904 KB
testcase_16 AC 295 ms
51,928 KB
testcase_17 AC 307 ms
54,044 KB
testcase_18 AC 360 ms
57,184 KB
testcase_19 AC 410 ms
61,368 KB
testcase_20 AC 435 ms
63,588 KB
testcase_21 AC 445 ms
63,596 KB
testcase_22 AC 448 ms
65,616 KB
testcase_23 AC 451 ms
65,632 KB
testcase_24 AC 454 ms
65,656 KB
testcase_25 AC 456 ms
65,620 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
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)
}

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 PrintWriter.solve() {
    val n = nextLong()
    val isPrime = BooleanArray(n.toInt() + 2) { true }
    val pf = mutableMapOf<Long, Long>() // prime factorization of LCM(1,2,...,n)
    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
    }
    val maxprime = (1..n).last { isPrime[it.toInt()] }
    val num = pf.map { ModInt(it.key).pow(it.value) }.fold(ModInt(1), { x, y -> x * y })
    println(num / maxprime.toModInt())
}

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