1．链接地址

     https://vjudge.net/problem/POJ-1003

2．问题描述

 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.

输入样例

1.00
3.71
0.04
5.19
0.00

输出样例

3 card(s)
61 card(s)
1 card(s)
273 card(s)

3．解题思路

 水题，刷水题令人快乐

4．算法实现源代码

#include <iostream>
using namespace std;

int main()
{
    float flag = 0.0;
    while(scanf("%f",&flag) && flag)
    {
        float f = 2,sum = 0.0;
        int count = 0;
        while(sum<flag)
        {
            sum+=1/f;
            f+=1;
            count++;
        }
        printf("%d card(s)\n",count);
    }
}