程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> uva 10916 Factstone Benchmark(對數函數的活用)

uva 10916 Factstone Benchmark(對數函數的活用)

編輯:C++入門知識

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. 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
1960
1981
0Output for Sample Input
3
8題目大意:給出年份,每個10年對應一個當前計算機可支持的字節位數,計算n! < max(max 為當前計算機能表示的最大整數),求最大n.
解題思路:字節數k = (year - 1940) / 10,  問題就轉化成 n ! < 2 ^ k < (n + 1) !, 如果單純模擬會溢出, 所以我們對兩邊同取對數,因為log(a*b) = log(a) + log(b);所以log(n!) = sum(log(i)), ( 1<= i <= n), 只要找到最小的sum(log(i)) > k * log(2) ,答案就是i- 1.

#include<stdio.h>
#include<math.h>

int main(){
	int year;
	while (scanf("%d", &year), year){
		int n = (year - 1940) / 10;
		double k = pow ( 2, n) * log10(2), sum = 0;
		for (int i = 1; ; i++){
			sum += log10(i);
			if (sum > k){
				printf("%d\n", i - 1);
				break;
			}
		}
	}
	return 0;}

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved