結果

問題 No.2211 Frequency Table of GCD
ユーザー 箱星箱星
提出日時 2023-02-10 21:58:30
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,479 ms / 2,000 ms
コード長 3,735 bytes
コンパイル時間 17,782 ms
コンパイル使用メモリ 450,728 KB
実行使用メモリ 101,868 KB
最終ジャッジ日時 2024-07-07 18:00:24
合計ジャッジ時間 38,540 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 287 ms
55,468 KB
testcase_01 AC 293 ms
55,428 KB
testcase_02 AC 289 ms
55,480 KB
testcase_03 AC 598 ms
93,808 KB
testcase_04 AC 881 ms
94,168 KB
testcase_05 AC 1,030 ms
94,636 KB
testcase_06 AC 934 ms
96,580 KB
testcase_07 AC 1,132 ms
97,632 KB
testcase_08 AC 422 ms
62,356 KB
testcase_09 AC 410 ms
60,572 KB
testcase_10 AC 460 ms
68,904 KB
testcase_11 AC 438 ms
66,104 KB
testcase_12 AC 444 ms
70,144 KB
testcase_13 AC 887 ms
94,840 KB
testcase_14 AC 900 ms
96,556 KB
testcase_15 AC 882 ms
99,244 KB
testcase_16 AC 946 ms
97,012 KB
testcase_17 AC 1,019 ms
96,528 KB
testcase_18 AC 1,307 ms
101,332 KB
testcase_19 AC 1,298 ms
101,032 KB
testcase_20 AC 1,288 ms
101,036 KB
testcase_21 AC 1,280 ms
101,496 KB
testcase_22 AC 1,301 ms
101,616 KB
testcase_23 AC 562 ms
94,460 KB
testcase_24 AC 726 ms
100,776 KB
testcase_25 AC 431 ms
72,624 KB
testcase_26 AC 294 ms
55,448 KB
testcase_27 AC 1,479 ms
100,136 KB
testcase_28 AC 731 ms
101,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val n = nextInt()
    val m = nextInt()
    val a = Array(n) { nextInt() }
    val freq = Array(m + 1) { 0L }
    val counter = Array(m + 1) { 0L }
    for (v in a) {
        freq[v]++
    }
    for (v in 1..m) {
        if (freq[v] == 0L) continue
        // region divisors
        val number = v.toLong()
        val divs = mutableListOf<Long>()
        var divisor = 1L
        while (divisor * divisor <= number) {
            if (number % divisor == 0L) {
                divs.add(divisor)
                if (divisor * divisor != number) {
                    divs.add(number / divisor)
                }
            }
            divisor++
        }
        // endregion
        for (d in divs) {
            counter[d.toInt()] += freq[v]
        }
    }
    val ans = Array(m + 1) { ModInt(0) }
    for (k in m downTo 1) {
        ans[k] = ModInt(2).pow(counter[k]) - ModInt(1)
        for (l in 2 * k..m step k) {
            ans[k] -= ans[l]
        }
    }
    println(ans.drop(1).joinToString("\n"))
}

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