Submission #2525106
Source Code Expand
#include<bits/stdc++.h> using namespace std; //const int N=1e9+7; typedef long long ll; int main() { int n,i; //ll a[1007]; vector<int>v(1000); //memset(a,0,sizeof(a)); cin>>n; for (i=1;i<=n;i++) { int x=i; for (int j=2;j<=x;j++) { while (x%j==0) { v[j]++; x/=j; } } //a[x]+=1; } ll sum=1; for (i=0;i<1000;++i) { //if (a[i]!=0) sum=(ll(sum*((v[i]+1))))%1000000007; } cout<<sum<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | vjudge3 |
Language | Bash (GNU bash v4.3.11) |
Score | 0 |
Code Size | 453 Byte |
Status | RE |
Exec Time | 3 ms |
Memory | 588 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 | RE | 3 ms | 580 KB |
sample_02.txt | RE | 3 ms | 588 KB |
sample_03.txt | RE | 3 ms | 572 KB |
subtask_1_certain_01.txt | RE | 3 ms | 580 KB |
subtask_1_certain_02.txt | RE | 3 ms | 576 KB |
subtask_1_certain_03.txt | RE | 3 ms | 580 KB |
subtask_1_certain_04.txt | RE | 3 ms | 572 KB |
subtask_1_rand_01.txt | RE | 3 ms | 572 KB |
subtask_1_rand_02.txt | RE | 3 ms | 568 KB |
subtask_1_rand_03.txt | RE | 3 ms | 580 KB |