Submission #1518039
Source Code Expand
#include "bits/stdc++.h" using namespace std; int main(){ int n; cin>>n; vector<int> pri(n+1,1); pri[0]=0; pri[1]=0; for(int i=2;i<n+1;i++){ if(pri[i]==1){ for(int j=i*2;j<n;j+=i)pri[j]=0; } } vector<int> ans(n+1,0); for(int i=2;i<n+1;i++){ int x=i; for(int j=2;j<x+1;j++){ if(pri[j]==1){ while(x%j==0){ x/=j; ans[j]++; } } } } long long int anse=1; int mod=1e9+7; for(int i=2;i<=n;i++){ if(ans[i]!=0){ //cout<<ans[i]<<" "<<i<<endl; anse*=(ans[i]+1); } anse%=mod; } cout<<anse<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | shichinomiya |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 616 Byte |
Status | AC |
Exec Time | 2 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 | 2 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 | 2 ms | 256 KB |
subtask_1_certain_04.txt | AC | 1 ms | 256 KB |
subtask_1_rand_01.txt | AC | 1 ms | 256 KB |
subtask_1_rand_02.txt | AC | 1 ms | 256 KB |
subtask_1_rand_03.txt | AC | 1 ms | 256 KB |