Submission #2544413
Source Code Expand
#include <iostream> using namespace std; int n, f[1100]; int main(void){ // Your code here! cin >> n; for (int i = 2; i <= n; i++) { int ans = 0; for (int j = 2; j < i; j++) { if (i % j == 0) ans++; } if (ans == 0) f[i] = 1; } long long res = 1; for (int i = 1; i <= n; i++) { if (f[i] == 1) { int num = i, cou = 1; while (num <= n) { cou += n / num; num *= i; } res = res * cou % 1000000007; } } cout << res << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | ajifurai |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 790 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 3 ms | 256 KB |
subtask_1_certain_01.txt | AC | 1 ms | 256 KB |
subtask_1_certain_02.txt | AC | 1 ms | 256 KB |
subtask_1_certain_03.txt | AC | 3 ms | 256 KB |
subtask_1_certain_04.txt | AC | 3 ms | 256 KB |
subtask_1_rand_01.txt | AC | 2 ms | 256 KB |
subtask_1_rand_02.txt | AC | 2 ms | 256 KB |
subtask_1_rand_03.txt | AC | 1 ms | 256 KB |