Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 101382 | Accepted: 49291 |
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.
![](https://i-blog.csdnimg.cn/blog_migrate/5291ccaf38c55900f443170e3004f578.jpeg)
Input
Output
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)
题意:悬挂n张卡片的长度是x= 1/2 + 1/3 + 1/4 + ... + 1/(n + 1) ;现在给你一个三位浮点数(0.01-5.20)问至少悬挂多少张卡片可以使卡片长度x>=给的浮点数,输入多样例,结束标志为0.00
题目链接:http://poj.org/problem?id=1003
代码:#include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; int main(){ double len; while(cin>>len,len){ int i=2; for(;;i++){ len=len-1.0/i; if(len<=0) break; } cout<<i-1<<" card(s)"<<endl; } return 0; }