Submission #1244137


Source Code Expand

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
typedef long long int ll;
#define MOD (1000000007);
#define INF (2e9)


int check_p(int n){
	int p=2;
	while(p*p<=n){
		if(n%p==0){
			return 0;
		}
		p++;
	}
	return 1;
}

int main(void){
	int n;
	cin>>n;
	int p[1002];
	int k=0;
	for(int i=0;i<1002;i++){
		p[i]=0;
	}
	for(int i=2;i<=n;i++){
		if(check_p(i)){
			for(int j=1;pow(i,j)<=n;j++){
				p[k]+=n/pow(i,j);
			}
			k++;
		}
	}
	int i=0;
	ll ans=1;
	while(p[i]!=0){
		ans=(ans*(p[i]+1))%MOD;
		i++;
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - Factors of Factorial
User Jirotech
Language C++14 (GCC 5.4.1)
Score 300
Code Size 613 Byte
Status AC
Exec Time 1 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 10
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 384 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