Submission #1291746
Source Code Expand
#include "bits/stdc++.h" using namespace std; typedef long long LL; const LL MOD = 1000000007; int main() { int N; cin >> N; map<int, int> cnt; for (int i = 1; i <= N; i++) { int M = i; for (int j = 2; j*j <= M; j++) { while (M%j == 0) { M /= j; cnt[j]++; } } if (M != 1) cnt[M]++; } LL ans = 1; for (auto itr = cnt.begin(); itr != cnt.end(); itr++) { ans = (ans*(itr->second+1)) % MOD; } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | Div9851 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 467 Byte |
Status | AC |
Exec Time | 1 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 | 1 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 | 1 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 |