Submission #1067350

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;



unsigned long long fact(int);

int main(){
	int n;
	unsigned long long num=0;
	cin>>n;

	unsigned long long f = fact(n);

	cout <<f <<endl;


	for(int i=1;i<int(sqrt(f)+1e-9)+1;i++){
		if(f%i == 0){
			num++;
			if(f != i*i)
				num++;
		}
	}

	cout << num % (1000000000 + 7) <<endl;



	return 0;
}

unsigned long long fact(int n){
	if(n == 1)
		return 1;
	else
		return n*fact(n-1);
}

Submission Info

Judge Result