zoukankan      html  css  js  c++  java
  • HDU-1018(简单数学)

    Big Number

    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
     
     
    分析:求n!的位数。注意到n的位数等于(int)lg(n)+1。
     
     1 #include<cstdio>
     2 #include<iostream>
     3 #include<cstring>
     4 #include<cmath>
     5 using namespace std;
     6 int main()
     7 {
     8     int n;
     9     cin>>n;
    10     while(n--)
    11     {
    12         int x;
    13         double answer=0;
    14         cin>>x;
    15         while(x!=1)
    16         {
    17             answer+=log10((double)x);
    18             x--;
    19         }
    20         cout<<(int) answer+1<<endl;
    21     }
    22     return 0;
    23 }
  • 相关阅读:
    C++扬帆远航——4(百钱百鸡)
    C++扬帆远航——3(打印图形)
    C++扬帆远航——2
    web开发之Servlet 三
    web开发之Servlet 二
    web开发之Servlet 一
    迟来的2017年计划
    JSP 学习二
    JSP 学习一
    window7 32位安装Oracle11g
  • 原文地址:https://www.cnblogs.com/RRirring/p/4728494.html
Copyright © 2011-2022 走看看