zoukankan      html  css  js  c++  java
  • hdu 1018 Big Number 数学结论

    Big Number

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


    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
     

     看到这个题就像用java写,结果超时。其实这是一道规律题:

     N!的长度=log10(i)【i:2~n】+1;

    然后就简单了。

    #include<iostream>
    #include<stdio.h>
    #include<math.h>
    using namespace std;
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            int n;
            scanf("%d",&n);
            double tmp=0;
            for(int i=2;i<=n;i++)
                tmp+=log10(i+0.0);
            int ans =(int)tmp+1;
            printf("%d
    ",ans);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    python 函数
    python控制流
    python数据类型转换
    python变量
    chardet查看字符串的编码(非常好用)
    python编码转换
    系统、浏览器兼容性测试注意事项
    python数据类型
    Python二进制转十进制算法、十进转二进制算法
    介绍几个C#正则表达式工具
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5539502.html
Copyright © 2011-2022 走看看