結果

問題 No.1581 Multiple Sequence
ユーザー 箱星箱星
提出日時 2021-07-02 22:58:45
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 696 ms / 2,000 ms
コード長 2,754 bytes
コンパイル時間 13,679 ms
コンパイル使用メモリ 446,636 KB
実行使用メモリ 86,848 KB
最終ジャッジ日時 2024-06-29 12:51:42
合計ジャッジ時間 26,872 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 290 ms
49,804 KB
testcase_01 AC 290 ms
49,684 KB
testcase_02 AC 577 ms
83,236 KB
testcase_03 AC 633 ms
82,696 KB
testcase_04 AC 423 ms
67,204 KB
testcase_05 AC 651 ms
82,788 KB
testcase_06 AC 457 ms
79,956 KB
testcase_07 AC 390 ms
66,324 KB
testcase_08 AC 418 ms
71,808 KB
testcase_09 AC 616 ms
82,840 KB
testcase_10 AC 499 ms
82,504 KB
testcase_11 AC 364 ms
59,272 KB
testcase_12 AC 430 ms
73,828 KB
testcase_13 AC 306 ms
50,868 KB
testcase_14 AC 641 ms
82,904 KB
testcase_15 AC 524 ms
82,284 KB
testcase_16 AC 378 ms
60,812 KB
testcase_17 AC 662 ms
83,412 KB
testcase_18 AC 352 ms
57,324 KB
testcase_19 AC 585 ms
82,896 KB
testcase_20 AC 575 ms
82,988 KB
testcase_21 AC 619 ms
83,176 KB
testcase_22 AC 499 ms
82,292 KB
testcase_23 AC 696 ms
86,848 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val m = nextInt()
    val dp = Array(m + 1) { ModInt(0) }
    dp[0] = ModInt(1)
    for (n in 1..m) {
        // region divisors
        val number = n.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) {
            val d = _d.toInt()
            dp[n] += dp[d - 1]
        }
    }
    println(dp[m])
}

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