Submission #1517884
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i, j, k) for(int i=j; i<=k; i++) #define FFOR(i, j, k) for(int i=j; i<k; i++) #define DFOR(i, j, k) for(int i=j; i>=k; i--) #define bug(x) cerr<<#x<<" = "<<x<<'\n' #define pb push_back #define mp make_pair typedef long long ll; typedef long double ld; template <typename T> inline void read(T &x){ char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){ nega=1; c=getchar(); } x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x; } template <typename T> inline void writep(T x){ if(x>9) writep(x/10); putchar(x%10+48); } template <typename T> inline void write(T x){ if(x<0){ putchar('-'); x=-x; } writep(x); } template <typename T> inline void writeln(T x){ write(x); putchar('\n'); } #define taskname "C" int cnt[1001]; void fact(int u){ int i=2; while(i*i<=u){ while(u%i==0){ u/=i; cnt[i]++; } i++; } if(u>1) cnt[u]++; } int main(){ #ifdef Megumin if(fopen(taskname".inp", "r")) freopen(taskname".inp", "r", stdin); #endif // Megumin int n; read(n); FOR(i, 2, n) fact(i); ll ans=1; FOR(i, 1, n) ans=(ans*(cnt[i]+1))%1000000007; write(ans); }
Submission Info
Submission Time | |
---|---|
Task | C - Factors of Factorial |
User | johntitor |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1401 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 |