POJ1003-Hangover（水题）

最新推荐文章于 2021-05-15 04:51:04 发布

chenzhuoxue

最新推荐文章于 2021-05-15 04:51:04 发布

阅读量582

点赞数

分类专栏： ACM 文章标签： ACM poj

本文链接：https://blog.csdn.net/chenzhuoxue/article/details/37914571

版权

ACM 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

第一次网上做oj！

题目

Hangover

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 100663		Accepted: 48903

Description

How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to the table.) With two cards you can make the top card overhang the bottom one by half a card length, and the bottom one overhang the table by a third of a card length, for a total maximum overhang of 1/2 + 1/3 = 5/6 card lengths. In general you can make n cards overhang by 1/2 + 1/3 + 1/4 + ... + 1/(n + 1) card lengths, where the top card overhangs the second by 1/2, the second overhangs tha third by 1/3, the third overhangs the fourth by 1/4, etc., and the bottom card overhangs the table by 1/(n + 1). This is illustrated in the figure below.

Input

The input consists of one or more test cases, followed by a line containing the number 0.00 that signals the end of the input. Each test case is a single line containing a positive floating-point number c whose value is at least 0.01 and at most 5.20; c will contain exactly three digits.

Output

For each test case, output the minimum number of cards necessary to achieve an overhang of at least c card lengths. Use the exact output format shown in the examples.

Sample Input

1.00
3.71
0.04
5.19
0.00

Sample Output

3 card(s)
61 card(s)
1 card(s)
273 card(s)

Source

Mid-Central USA 2001

参考代码

题目大意：输入一个double类型的 len,求出一个n 使得1/2 + 1/3 + 1/4 + ... + 1/(n + 1) 刚好大于len.其中len在0.01~5.20之间。当输入为0时，退出。

解析：为节省时间，可以把每次求的1/(n + 1)保存下来。为寻找普遍规律，i可以从1开始。

//Memory Time
//224k   0MS

#include <iostream>
#define SIZE 301	
using namespace std;

int main()
{
	double length[SIZE] = {0.0};
	double len = 0.0;

	while (cin>>len && len)
	{
		for (int i = 1; i < SIZE; i++)
		{
			if (!length[i])
				length[i] = length[i -1] + 1.0/(i + 1);
			
			if (length[i] > len)
			{
				cout<<i<<" card(s)"<<endl;
				break;
			}
		
		}
	}
	return 0;
}