Submission #2200520
Source Code Expand
#include <bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<(b);i++) #define erep(i,a,b) for(int i=a;i<=(int)(b);i++) #define per(i,a,b) for(int i=(b)-1;i>(a);i--) #define eper(i,a,b) for(int i=((int)(a));i>=b;i--) #define pb push_back #define mp make_pair using namespace std; typedef long long ll; const int INF=(1<<30)-1; const int MOD=1000000007; int dy[]={0, 0, 1, -1}; int dx[]={1, -1, 0, 0}; int gcd(int a,int b){return b?gcd(b,a%b):a;} int primes[1000]; int n; ll ans = 1LL; int main() { ios::sync_with_stdio ( false ); cin.tie ( 0 ); cin >> n; fill(primes, primes+1000, 1); erep(i, 2, n) { int p = i; for (int j = 2; j*j <= n; j++) { while (p%j == 0) { primes[j]++; p /= j; } } primes[p] += 1; } rep(i, 2, 1000) { ans = ans * primes[i] % MOD; } printf("%lld\n", ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | kage |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 918 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 |