FZU1002-HangOver

最新推荐文章于 2019-10-07 21:53:36 发布

Wang_128

最新推荐文章于 2019-10-07 21:53:36 发布

阅读量463

点赞数

CC 4.0 BY-SA版权

分类专栏： ----预处理 FZU ----二分

本文链接：https://blog.csdn.net/a664607530/article/details/61421091

----二分同时被 3 个专栏收录

44 篇文章

订阅专栏

----预处理

29 篇文章

订阅专栏

FZU

23 篇文章

订阅专栏

探讨如何通过堆叠方式使卡片最大限度地悬空于桌面之外。利用数学原理计算不同数量卡片达到特定悬空长度的方法。

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

Problem 1002 HangOver

Accept: 2669 Submit: 11014
Time Limit: 1000 mSec Memory Limit : 32768 KB

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.

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.003.710.045.190.00

Sample Output

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

题意：给你露在外面的长度，问最少要几根才能到达这个长度

解题思路：打表出所有长度，然后二分找出答案

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>
#include <functional>

using namespace std;

#define LL long long
const int INF=0x3f3f3f3f;

int main()
{
    double a[300];
    a[0]=0;
    for(int i=2;i<301;i++)
        a[i-1]=a[i-2]+1.0/i;
    double n;
    while(~scanf("%lf",&n))
    {
        if(n==0.00) break;
        int k=lower_bound(a+1,a+301,n)-a;
        printf("%d card(s)\n",k);
    }
    return 0;
}