fjnu 1101 Hangover

最新推荐文章于 2019-12-06 18:56:19 发布

核动力蜗牛Killua

最新推荐文章于 2019-12-06 18:56:19 发布

阅读量536

点赞数

CC 4.0 BY-SA版权

分类专栏： ☆ACM 解题报告☆ 文章标签： output float iostream input table each

本文链接：https://blog.youkuaiyun.com/killua_hzl/article/details/2099410

☆ACM 解题报告☆ 专栏收录该内容

229 篇文章

订阅专栏

本文探讨了如何使用一定数量的卡片实现特定长度的悬空效果。通过逐步叠加卡片并利用每张卡片不同位置的支撑作用，文章详细介绍了实现任意指定长度悬空所需的最小卡片数，并附带了一个简单的程序示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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)

KEY:不是很难，注意精确度的问题#include<iostream>
using namespace std;

void lenght(float l)
...{
    int i;
    float sum=0.0;
    for(i=1;sum<=l;i++)
        sum+=(float)1/(i+1);
    cout<<i-1<<" card(s)"<<endl;
}

int main()
...{
    float l;
    cin>>l;
    while(l!=0)
    ...{
        lenght(l);
        cin>>l;
    }
}