poj1003 Hangover

最新推荐文章于 2021-11-21 18:53:16 发布

qq243887

最新推荐文章于 2021-11-21 18:53:16 发布

阅读量257

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/qq243887/article/details/43226031

版权

水题专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Hangover

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 105379		Accepted: 51336

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)

Source

Mid-Central USA 2001

题意：给你的一个0.01--5.20之间的长度，问你要几块板能衔接到。距离与n的关系是2/1+3/1+...+n/1;

解法：直接二分就行。

好久没做题了。。。。做了些水题练练手。

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include<map>
#include <algorithm>
#include<ctime>
#define esp 1e-6
#define LL long long
#define inf 0x0f0f0f0f
using namespace std;
int search2(double a[],int n,double v)
{
    int l,r,m;
    l=1,r=n-1;
    while(l<=r)
    {
        m=(l+r)/2;
        if(a[m]>v)
            r=m-1;
        else if(a[m]<v)
            l=m+1;
        else
            return m;
    }
    return l;
}
int main()
{
    double num[305];
    int ans,i,j,ss;
    double t,a;
    t=0;
    for(ss=1;ss<=1000;ss++)
        {
            if(t>5.20)
                break;
            t+=1.0/(ss+1);
            num[ss]=t;
        }
    while(scanf("%lf",&a)&&a)
    {
        printf("%d card(s)\n",search2(num,ss+1,a));
    }
    return 0;
}