杭电 factorials

factorials

Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 65535/32768K (Java/Other)

Total Submission(s) : 5   Accepted Submission(s) : 2

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

Problem Description

AmzMohammad Loves factorial ! and now selected this problem for U !

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 ≤ 106) 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

5
5 10
8 10
22 3
1000000 2
0 100

Sample Output

Case 1: 3
Case 2: 5
Case 3: 45
Case 4: 18488885
Case 5: 1

#include <stdio.h>
#include <string.h>
#include <math.h>
#define PI 3.141592657
int main()
{
    int n,s1,t,k;
    double m,s;
    scanf("%d",&t);
    k=1;
    while(t--)
    {
        scanf("%d %lf",&n,&m);
        s=0;
        s=n*log(n)-n+0.5*log(2*n*PI);
        s1=(int)(s/log(m));
		s1+=1;
        if(n==0)
		{
			s1=1;
		}
        printf("Case %d: %d\n",k,s1);
        k+=1;
    }
    return 0;
}