A - Hangover

A - Hangover

题目描述：

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.

输入格式：

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.

输出格式：

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.

输入与输出样例：

思路分析：

这道题就是一道穷举题，从1/2+1/3+到1/n。当超过或者等于所输入的值，就输出需要多少项即可。

代码：

#include<stdio.h>
int lemon(double b)
{
	int d=1;
	double c=0.50,e=2;
	while(c<b)
	{
		d++;
		e++;
		c+=1/e;
	}
	return d;
}
int main()
{
	int c[1000],d=0,e;
	double b;
	do
	{
	scanf("%lf",&b);
	if(b==0)
	break;
	c[d]=lemon(b);
	d++;
}
while(b>0); 
for(e=0;e<d;e++)
{
	printf("%d card(s)\n",c[e]);
}
	
}