Submission #1574240
Source Code Expand
#include <iostream> #include <string> #include <algorithm> using namespace std; int main() { int n; cin >> n; int cnt[1010] = {}; for (int i=1; i<=n; i++) { int t = i; for (int j=2; j<=n; j++) { while (t%j == 0) { cnt[j]++; t /= j; } } } long long ans = 1; for (int i=0; i<1010; i++) { if (cnt[i]) { ans *= cnt[i] + 1; ans %= 1000000007LL; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | reverd |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 579 Byte |
Status | AC |
Exec Time | 4 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 | 4 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 | 4 ms | 256 KB |
subtask_1_certain_04.txt | AC | 4 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 | 2 ms | 256 KB |