HDU 1056 Hang over 主要是注意精度

【科普】什么是BestCoder？如何参加？ NEW~ 关于举办计算机学院大学生程序设计竞赛（2014'11）的报名通知

HangOver Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9684    Accepted Submission(s): 4083 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 Mid-Central USA 2001

水 不多说什么，题目大意就是开始1/2 在旋外面， 再来一次 1/3 1/4.....1/(n+1)

 输入一个值，表示悬在外面的总长度， 然后，问你一共悬了多少模板

#include<iostream>
using namespace std;


int main()
{
    double c,b;
    int i;


    while(cin>>c, c)
    {
        b = 0.0; //用来记录这些木棒加和的长度
        i = 0;
        while(b<c)
        {
            b  +=1.0/(i+2);
            i++;
        }
        cout<<i<<" card(s)"<<endl;
    }


    return 0;
}