zoukankan      html  css  js  c++  java
  • big number

    //题意 求阶乘的位数。这么机智的做法肯定不是我自己想的o(╯□╰)o

    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

     1 #include<stdio.h>
     2 
     3 #include<math.h>
     4 
     5 int main()
     6 
     7 {
     8 
     9 int t,n,i;
    10 
    11 double result;
    12 
    13 scanf("%d",&t);
    14 
    15 while(t--)
    16 
    17 {
    18 
    19 result=0;
    20 
    21 scanf("%d",&n);
    22 
    23 for(i=1;i<=n;i++)
    24 
    25 {
    26 
    27 result+=(log10(i));//这个!
    28 
    29 }
    30 
    31 printf("%d
    ",(int)result+1);
    32 
    33 }
    34 
    35 return 0;
    36 
    37 }
  • 相关阅读:
    Python异步任务模块之-celery
    Atom 编辑器侧边栏忽略隐藏文件
    判断字符串是否为回文 python
    python 命令行工具 fire
    Appium自动化测试-iOS
    视频转换工具ffmpeg
    nodejs顺序执行shell
    Jenkins 邮箱配置及问题解决
    mac配置php
    appium镜像设置
  • 原文地址:https://www.cnblogs.com/awsent/p/4267100.html
Copyright © 2011-2022 走看看