# LightOJ 1045 I - Digits of Factorial

70人阅读 评论(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 ≤ 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

log(n!) = log(n)+log(n-1) + log(n-2) +…+log(2)

log（i）为自然对数

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <cstdlib>
using namespace std;
const int N=1000005;
double num[N];
int main (void)
{
int t,cas=0;
for(int i=1;i<=N-1;i++)
{
num[i]=num[i-1]+log(i);
}
cin>>t;
while(t--)
{
int n,base;
cas++;
scanf("%d %d",&n,&base);
int ans;
ans=floor(num[n]/log(base)+1);//floor向下取整
//事实证明不用floor也行
printf("Case %d: %d\n",cas,ans);
}
return 0;
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：12518次
• 积分：891
• 等级：
• 排名：千里之外
• 原创：80篇
• 转载：6篇
• 译文：0篇
• 评论：0条
阅读排行
评论排行
最新评论