Submission #1593554
Source Code Expand
#include <iostream> #include <vector> using namespace std; using ll = long long; ll Array[1001]; void soinsu_(int); void soinsu_(int x){ int count = 0; int X = x; for(int i=2;i<=X;){ if(x % i == 0){ count++; x = x / i; }else{ Array[i] += count; count = 0; i++; } } } int main(){ int N; ll answer = 1; cin >> N; for(int i=0;i<1001;i++){ Array[i] = 0; } for(int i=1;i<=N;i++){ soinsu_(i); } for(int i=0;i<1001;i++){ answer = answer * (Array[i]+1) % 1000000007; } cout << answer << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | mashi6n |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 593 Byte |
Status | AC |
Exec Time | 3 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 | 3 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 | 3 ms | 256 KB |
subtask_1_certain_04.txt | AC | 3 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 | 1 ms | 256 KB |