LightOJ 1045 Digits of Factorial

1045 - Digits of Factorial

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

Factorial of an integer is defined by the following function

f(0) = 1

f(n) = f(n - 1) * n, if(n > 0)

So, factorial of 5 is 120. But in different bases, the factorial may be different. For example, factorial of 5 in base 8 is 170.

In this problem, you have to find the number of digit(s) of the factorial of an integer in a certain base.

Input

Input starts with an integer T (≤ 50000), denoting the number of test cases.

Each case begins with two integers n (0 ≤ n ≤ 10⁶) and base (2 ≤ base ≤ 1000). Both of these integers will be given in decimal.

Output

For each case of input you have to print the case number and the digit(s) of factorial n in the given base.

Sample Input	Output for Sample Input
5 5 10 8 10 22 3 1000000 2 0 100	Case 1: 3 Case 2: 5 Case 3: 45 Case 4: 18488885 Case 5: 1

 

---

PROBLEM SETTER: JANE ALAM JAN

题意：求N！用base进制表示后的位数

ceil(x) （要用double型）大于等于x的最小整数

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define LL long long 
using namespace std;
double ans[1100000];
int i,j,k,l,m,n,t;
int main()
{
	ans[0]=0;
	for(i=1;i<=1000000;i++)
	ans[i]=ans[i-1]+log10(i*1.0);//i!的位数 
	scanf("%d",&t);
	k=1;
	while(t--)
	{
		scanf("%d%d",&m,&n);
		if(m==0)
		{
			printf("Case %d: 1\n",k++);
			continue;
		}
		printf("Case %d: %lld\n",k++,(LL)ceil(ans[m]/log10(n*1.0)));
	}
	return 0;
 }