zoukankan      html  css  js  c++  java
  • 【hdu 1018 n! 的位数】

    Big Number

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 15735    Accepted Submission(s): 6954


    Problem 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
     
    Source
     
    Recommend
    JGShining
     
     
     1 #include <iostream>
     2 #include <cmath>
     3 using namespace std;
     4 
     5 const double pi = acos(-1.0);
     6 const double E  = exp(1.0);
     7 int main()
     8 {
     9     int t;
    10     cin >> t;
    11     while (t--)
    12     {
    13         int n;
    14         cin >> n;
    15         int len;
    16         len = (int)(log10l(sqrtl(2*pi*n))+n*log10l(n/E)+1);
    17         if (n == 1)
    18         {
    19             len = 1;
    20         }
    21 
    22         cout << len << endl;
    23     }
    24 
    25     return 0;
    26 }
    27 
    28 // end
    29 // ism
  • 相关阅读:
    正则匹配整数或小数
    文本超出点点点
    订单页面布局
    数据库连接池 maxActive,maxIdle,maxWait参数
    dll静态调用和动态调用
    Could not open JDBC Connection for transaction; nested exception is com.alibaba.druid.pool.GetConnection
    sql server调优
    AdPlus
    010 Editor
    WinDBG相关
  • 原文地址:https://www.cnblogs.com/ismdeep/p/2598783.html
Copyright © 2011-2022 走看看