zoukankan      html  css  js  c++  java
  • HDU-1018

    Description

    In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to determine the number of digits in the factorial of the number.

    Input

    Input consists of several lines of integer numbers. The first line contains an integer n, which is the number of cases to be tested, followed by n lines, one integer 1 ≤ n ≤ 107 on each line.

    Output

    The output contains the number of digits in the factorial of the integers appearing in the input.

    Sample Input

    2

    10

    20

    Sample Output

    7

    19


    数n的位数计算公式:lg(n)+1 

    所以 n!的位数为 lg(n*(n-1)*(n-2)...*3*2*1)+1

            =lg(n)+lg(n-1)+lg(n-2)+...+lg(3)+lg(2)+lg(1)+1

    #include <iostream>
    #include <cmath>
    using namespace std;
    
    int main(void)
    {
        double w;
        int t;
        long num;
        
        while(cin >> t)
        {
            while(t--)
            {
                cin >> num;
                
                w = 1;
                for(int i = 1; i <= num; i++)
                {
                    w += log10(i);
                }
                cout << (int)w << endl;
            }
        }
        return 0;
    }
    
  • 相关阅读:
    Java static修饰符小记
    nginx的使用
    Java 日期时间格式化
    Java Annotation使用详解
    栈的应用-四则运算表达式
    计算机网络——学习笔记
    Python __builtin__模块
    搭建Harbor私有库
    Prometheus k8s方式安装
    Day4_字典循环
  • 原文地址:https://www.cnblogs.com/limyel/p/6681671.html
Copyright © 2011-2022 走看看