LightOJ 1045 I - Digits of Factorial

转载 2016年06月02日 00:43:35

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

题意:n!的m进制一共多少位————————————-
想到了怎么预处理,可惜没想到对数这个工具orz
log(n!) = log(n)+log(n-1) + log(n-2) +…+log(2)
例子:4!=24,24是十进制的2位,因为>10,5!=120,是十进制的3位,因为>100,所以直接对数化
反思:当题目要求求位数的时候应该要想到对数这个工具。

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;
}

相关文章推荐

lightoj1045 - Digits of Factorial(数论)

本题的大概题意是说,N是十进制的数,求N!在K进制下的位数。 N的范围虽然不大,才10^6,但是N!却大得惊人。如果直接求N的阶乘,转化为K进制的数再统计位数,理论上运用高精度 算法行得通。但是...

Light 1045 Digits of Factorial 【数论】

题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=120197#problem/UDigits of Factorial Time...

LightOJ 1035 Intelligent Factorial Factorization

题目链接 http://lightoj.com/volume_showproblem.php?problem=1035 题意:计算N!的素数分解式,N最大100,注意输出格式 #inclu...

POJ 1775 sum of Factorial (数论)

链接:http://poj.org/problem?id=1775 Description John von Neumann, b. Dec. 28, 1903, d. Feb. 8, 1...

how many does the factorial of n(in binary data ) have zero?

how many does the factorial of n(in binary data ) have zero? 个人信息:就读于燕大本科软件工程专业 目前大三; 本人博客:g...

CodeForces 489C Given Length and Sum of Digits...

题目链接  :http://codeforces.com/problemset/problem/489/C Description You have a positive integer m...

THE MNIST DATABASE of handwritten digits

  • 2017年09月29日 14:20
  • 11.06MB
  • 下载

A spigot algorithm for digits of pi

  • 2012年12月04日 15:41
  • 245KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LightOJ 1045 I - Digits of Factorial
举报原因:
原因补充:

(最多只允许输入30个字)