Submission #1353963
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
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | Gobi |
Language | Scala (2.11.7) |
Score | 300 |
Code Size | 706 Byte |
Status | AC |
Exec Time | 374 ms |
Memory | 26808 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_certain_01.txt, subtask_1_certain_02.txt, subtask_1_certain_03.txt, subtask_1_certain_04.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 352 ms | 23760 KB |
sample_02.txt | AC | 353 ms | 25504 KB |
sample_03.txt | AC | 374 ms | 24904 KB |
subtask_1_certain_01.txt | AC | 346 ms | 25408 KB |
subtask_1_certain_02.txt | AC | 351 ms | 25512 KB |
subtask_1_certain_03.txt | AC | 374 ms | 26704 KB |
subtask_1_certain_04.txt | AC | 369 ms | 26808 KB |
subtask_1_rand_01.txt | AC | 370 ms | 24900 KB |
subtask_1_rand_02.txt | AC | 367 ms | 26676 KB |
subtask_1_rand_03.txt | AC | 366 ms | 26712 KB |