n!长度转换

最新推荐文章于 2021-11-12 17:59:10 发布

昨日明眸

最新推荐文章于 2021-11-12 17:59:10 发布

阅读量264

点赞数

分类专栏： n的阶乘问题

本文链接：https://blog.csdn.net/qaz135135135/article/details/52293286

版权

n的阶乘问题专栏收录该内容

4 篇文章 0 订阅

订阅专栏

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 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!阶乘转换成m进制有多少位

#include <iostream>    
#include <algorithm>    
#include<string.h>    
#include<stdio.h>    
#include<math.h>    
using namespace std;    
const double PI=3.1415926;    
int main()    
{    
    int t,n,a,m,k=1; 
	scanf("%d",&t);
	while(t--)   
   {
	scanf("%d%d",&n,&m); 
if(n==0)
{printf("Case %d: 1\n",k++);  
continue;
}  
  
        a=(int)((0.5*log(2*PI*n)+n*log(n)-n)/log(m));//赤裸裸的公式
		    
        printf("Case %d: %d\n",k++,a+1);    
    }    
    return 0;    
}