Light OJ-----1045对数运算

Description

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

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

求n的阶乘在base进制下是几位数，k进制下n！的位数是logk（n！），即log以k为底，n！为真数的对数；题目给出的10进制数，从10进制转化为k进制数用到换底公式

logk（n！） = loge（n！） / loge（k），计算机默认以e为底，数据多，要打表

#include<cstdio>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<cmath>
#define inf 0x3f3f3f3f
#define mes(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int maxn = 1e6+10;
LL ans, a;
double Log[maxn];
int main(){
    for(int i = 1; i < maxn-5; i++){
    	Log[i] = Log[i-1]+log(i);
	}
	int t, n, b, ans, kcase = 1;
    scanf("%d", &t);
    while(t--){
    	scanf("%d%d", &n, &b);
    	ans = int(Log[n]/log(b));
    	printf("Case %d: %d\n", kcase++, ans+1);
    }
    return 0;
}