POJ1003 Hangover 打表/二分

最新推荐文章于 2016-02-01 20:08:52 发布

原创最新推荐文章于 2016-02-01 20:08:52 发布 · 659 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

其他专栏收录该内容

37 篇文章

订阅专栏

本文介绍了一种利用二分查找与打表技巧解决卡片堆叠问题的方法，通过将浮点数转换为整数进行精确计算，优化了算法效率并实现了快速解答。

其实这道题目可以用二分做，但打表感觉更加方便，因为这道题目给你的数据是一个精确到小数点后两位的小数，那么我们乘以100就一定可以得到一个整数，因此只要申请一个数组之后把相应答案存储即可。接着只要一问一输出即可。

Hangover

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 84229		Accepted: 40517

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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>

using namespace std;

#define eps  1e-8


double l,s,tag;
int cnt,ans[1100];

int sig(double k)
{
	if(fabs(k)<eps)
		return 0;
	return (k>0)?1:-1;
}

int main()
{
    s=0;
    memset(ans,-1,sizeof(ans));
    for(int i=1;i<=520;i++)
    {
        cnt=1,s=0.5,tag=(i*1.0)/100;
        for(;;)
        {
            if(sig(s-tag)>=0)
            {
                ans[i]=cnt;
                break;
            }
            cnt++;
            s+=1.0/(cnt+1);
        }
    }
    while(~scanf("%lf",&l))
    {
        if(sig(l-0)==0)
            break;
        printf("%d card(s)\n",ans[(int)(l*100)]);

    }

    return 0;
}