首页 > 其他 > 详细

杭电 HDU 1050 HangOver

时间:2015-03-23 13:32:51      阅读:147      评论:0      收藏:0      [点我收藏+]

HangOver

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10329    Accepted Submission(s): 4381


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

技术分享

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.
 

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
 
水的不成样子
#include<iostream>
using namespace std;
int main()
{
	double sum, n;
    int i;
	while(cin>>n,n)
	{
		int count=0;sum=0;
		for(i=2;n>sum;i++)
		{
			sum+=1.0/i;
			count++;
		}
		cout<<count<<" card(s)"<<endl;
	}
	return 0;
}

杭电 HDU 1050 HangOver

原文:http://blog.csdn.net/lsgqjh/article/details/44562625

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!