poj 1003Hangover

 

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)
 1 #include<iostream>
 2 #include<cmath>
 3 using namespace std;
 4 int main()
 5 {
 6     float c;
 7     int i;
 8     float sum;
 9     while(1)
10     {
11         cin>>c;
12         if(fabs(c-0.00)<0.0000001)
13             break;
14         i=1;
15         sum=0;
16         while(sum<c)
17         {
18             i++;
19             sum+=1.0/i;
20         }
21         cout<<i-1<<""<<"card(s)"<<endl;
22     }
23     return 0;
24 }

从今天开始慢慢把之前做过的水题都发上来，顺便再整理一下，现在开始不能刷水题了。。要学的深一点 恩~~

posted @ 2011-11-21 08:57  w0w0  阅读(156)  评论(0)    收藏  举报