Submission #2551391

---

Source Code Expand

import java.util.Scanner

import scala.collection.mutable.ArrayBuffer

object Main {
  val MOD = 1000000007
  def solve(N: Int): Long = {
    val f = {
      val f: ArrayBuffer[Int] = ArrayBuffer.empty
      for {
        i <- 1 to N
      } f ++= factorize(i)
      f.sorted
    }

    var res: Long = 1
    var i = 0
    while(i < f.length) {
      var j = i
      while (j < f.length && f(i) == f(j)) j += 1
      val len = j - i
      res = res * (len + 1) % MOD
      i = j
    }

    res
  }

  def main(args: Array[String]): Unit = {
    val sc = new Scanner(System.in)
    println(solve(sc.nextInt()))
  }

  def factorize(n: Int): Array[Int] = {
    // 見つからなかったら-1
    def minFactor(n0: Int, i: Int): Int = {
      if (i > n0) -1
      else if (n0 % i == 0) i
      else minFactor(n0, i + 1)
    }

    def step(n0: Int, acc: List[Int]): List[Int] = {
      minFactor(n0, 2) match {
        case -1 => acc
        case f => step(n0 / f, f :: acc)
      }
    }

    step(n, Nil).toArray
  }
}

Submission Info

Judge Result