Submission #2323573
Source Code Expand
#include <iostream> #include <vector> using namespace std; int main() { int n; long long sum=1,sum1=0,m=1000000007; vector<long long>v; bool t=1; cin>>n; for(int i=2; i<=n;i++) { for(int j=i-1;j>1;j--) { if(i%j==0 && i!=j) {t=false; break;} } if(t==false) {t=true; continue; } else {v.push_back(i);} t=true; } for(int i=0 ; i<v.size() ; i++) { while((n/v[i])>0) { sum1+=n/v[i]; v[i]*=v[i]; } v[i]=sum1; sum1=0; } for(int i=0;i<v.size();i++) { sum=(sum*(v[i]+1))%m; } cout <<sum << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | vjudge3 |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 747 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | WA | 2 ms | 256 KB |
subtask_1_certain_04.txt | WA | 2 ms | 256 KB |
subtask_1_rand_01.txt | WA | 1 ms | 256 KB |
subtask_1_rand_02.txt | WA | 1 ms | 256 KB |
subtask_1_rand_03.txt | WA | 1 ms | 256 KB |