hdu 1141 Factstone Benchmark

最新推荐文章于 2017-09-12 22:43:42 发布

Tian_Fei

最新推荐文章于 2017-09-12 22:43:42 发布

阅读量552

点赞数

本文链接：https://blog.csdn.net/lois_123/article/details/39998597

版权

Problem Description

Amtel has announced that it will release a 128-bit computer chip by 2010, a 256-bit computer by 2020, and so on, continuing its strategy of doubling the word-size every ten years. (Amtel released a 64-bit computer in 2000, a 32-bit computer in 1990, a 16-bit computer in 1980, an 8-bit computer in 1970, and a 4-bit computer, its first, in 1960.)
Amtel will use a new benchmark - the Factstone - to advertise the vastly improved capacity of its new chips. The Factstone rating is defined to be the largest integer n such that n! can be represented as an unsigned integer in a computer word.

Given a year 1960 ≤ y ≤ 2160, what will be the Factstone rating of Amtel's most recently released chip?

There are several test cases. For each test case, there is one line of input containing y. A line containing 0 follows the last test case. For each test case, output a line giving the Factstone rating.

Sample Input

Sample Output

  
  
   
   3
8
  
  
  
  
   
   可以用斯特林(Stirling)公式求解
   
   <pre class="sio" name="code" style="white-space: pre-wrap; word-wrap: break-word; font-size: 14px; line-height: 26px; background-color: rgb(255, 255, 255);">
<img src="http://www.cppblog.com/images/cppblog_com/vontroy/1.png" alt="" width="156" height="49" style="border: none; max-width: 100%;" />

#include<stdio.h>
#include<math.h>
#define PI 3.141592654
#define E 2.71828182846
int opt[205];
int main()
{
    int i;
    int tmp;
    int cache;
    double log_n;
    double log_2=log(2);
    opt[0]=4;
    for(i=1; i<201; i++) opt[i]=opt[i-1]*2;
    while(scanf("%d",&tmp) && tmp)
    {
        cache=opt[(int)(tmp-1960)/10];
              for(i=4;; i++)
        {
            log_n=0.5*log(2*PI*i)+i*log(i/E);
            if(log_n/log_2>cache)
            {
                printf("%d\n",i-1);
                break;
            }
        }
    }
    return 0;
}

代码2：

#include<stdio.h>
#include<math.h>
int main()
{
    long x,y,k,i;
    long double p,t,z;
    while(scanf("%d",&x)&&x!=0)
    {
        y=(x-1960)/10+2;
        z=pow(2,y);
        for(i=1;; i++)
        {
            t=log10(i)/log10(2);
            z=z-t;
            if(z<0)
            {
                k=i-1;
                break;
            }
        }
        printf("%d\n",k);
    }
    return 0;
}