Submission #1365583

---

Source Code Expand

import java.util.Scanner
 
object Primes {
  val primes = new Array[Int](1001)
  for(i <- 2 to 1000){
    var flag = true
    for(k <- 2 to i-1)
      if(i % k == 0)
        flag = false
    primes(i) = 1
  }
}
 
object Main extends App{
  import Primes._
 
  val MOD = 1e9.toInt + 7
 
  val sc = new Scanner(System.in)
  val n = sc.nextInt()
 
  for(k <- 2 to n){
    var rest = k
    for(i <- 2 to 1000) {
      if(primes(i) > 0){
        while(rest % i == 0){
          rest /= i
          primes(i) += 1
        }
      }
    }
  }
 
  var ans = 1L
  for(i <- 2 to 1000) {
    if(primes(i) > 1) {
      ans *= primes(i)
      ans %= MOD
    }
  }
 
  println(ans)
}

Submission Info

Judge Result