Submission #1963284
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> #include <string> #include <set> #include <stack> #include <queue> #include <cmath> using namespace std; int main(void){ int n; cin>>n; long long ans=1,s[10010]={}; for(int i=1;i<=n;i++){ int a=i; for(int j=2;j<=n;j++){ int t=0; while(a%j==0){ t++; a/=j; } s[j]+=t; } } for(int i=0;i<=n;i++){ ans*=s[i]+1; if(ans>1000000007)ans%=1000000007; } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | Hirosesesese23 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 620 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 384 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 | 5 ms | 256 KB |
subtask_1_certain_01.txt | AC | 1 ms | 384 KB |
subtask_1_certain_02.txt | AC | 1 ms | 256 KB |
subtask_1_certain_03.txt | AC | 5 ms | 256 KB |
subtask_1_certain_04.txt | AC | 5 ms | 384 KB |
subtask_1_rand_01.txt | AC | 2 ms | 256 KB |
subtask_1_rand_02.txt | AC | 3 ms | 384 KB |
subtask_1_rand_03.txt | AC | 2 ms | 384 KB |