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 ≤ 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 | 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 |
数学是一个神奇的学科越来越喜欢数学了
这个题吧就是把一个数的阶乘转化在b进制下有多少位 这个吧 只要知道
log(b)(x)+1。就是有多少位了
剩下的这个log公式应该都知道的直接看代码就懂了
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
typedef long long LL;
double dp[1100000];
int main(){
for(int i=1;i<=1000010;i++)
dp[i]=dp[i-1]+log(i);
int T; scanf("%d",&T); int t=1;
while(T--){
int n,base;
scanf("%d %d",&n,&base);
double ans; ans=dp[n]/log(base);
int k=ans; k++;
printf("Case %d: %d\n",t++,k);
}
return 0;
}