Submission #11459419
Source Code Expand
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("Ofast") #define rep(i,n) for(int i=0; i<n; i++) typedef long long ll; typedef pair<int,int> P; const ll MOD = (int)1e9+7; const ll INF = MOD*MOD; const ll powll = 1LL<<1; int main(){ /* int tt; cin >> tt; vector<string> ans = {}; while(tt--){ } rep(i,ans.size()) cout << ans[i] << "\n"; */ int n; cin >> n; int f[1001] = {}; for(int i = 2; i <= n; i++){ int p = i; for(int j = 2; j*j <= i; j++){ while(p % j == 0 && p > 1){ f[j]++; p /= j; } } if(p!=1) f[p]++; } ll ans = 1; rep(i,n+1){ ans = (ans*(f[i]+1))%MOD; } cout << ans << "\n"; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | ms5 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 727 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 |