UVA - 10916 Factstone Benchmark（数学）

本文链接：https://blog.youkuaiyun.com/HelloWorld10086/article/details/38903377

本文探讨了Amtel计算机芯片的发展策略及其引入的Factstone基准测试，通过计算Factstone评级，揭示了每十年计算机字节位数的翻倍趋势。文中详细解释了如何计算Factstone评级，并提供了实例输入输出解析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem B: Factstone Benchmark

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. TheFactstone 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

1960
1981
0

Output for Sample Input

3
8

题目大意：给出年份，每个10年对应一个当前计算机可支持的字节位数，
计算n! < max（max 为当前计算机能表示的最大整数），求最大n.
解题思路：字节数 t = （year - 1940) / 10, 问题就转化成 n ! < 2 ^ t < (n + 1) !, 如果单纯模拟会溢出，所以我们对两边同取对数，

因为log(a*b) = log(a) + log(b);所以log(n!) = sum(log(i)), ( 1<= i <= n), 只要找到最小的sum(log(i)) > k * log（2）

#include <cstdio>
#include <math.h>
using namespace std;

int main() {
	int year;
	while(scanf("%d",&year) != EOF && year) {
		int t = (year - 1960)/10;
		int bit = 1 << (t + 2);
		double max = bit * log(2.0);
		double sum = 0;
		int i;
		for(i = 1; sum < max; i++) {
			sum += log(i);
		}
		printf("%d\n",i-2);
	}
	return 0;
}