poj1003 Hangover

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)
import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner cin = new Scanner(System.in);
        String str;
        int maxCardNum = 0;
        while(cin.hasNext())
        {
            str = cin.nextLine();
            if(str.equals("0.00"))
                break;
            float len = Float.valueOf(str).floatValue();
            maxCardNum = getCardNum(len);
            System.out.println(maxCardNum + " card(s)");
        }   

    }   

    private static int getCardNum(float len)
    {
        float value = 0;
        int index = 2;
        while (value < len)
        {
            value += 1.0/index;
            index++;
        }   

        return index-2;
    }   

}  
时间: 2024-08-11 01:57:44

poj1003 Hangover的相关文章

POJ-1003: hangover 详解1:递减法

> 分析 >> 本题不用想复杂了公式计算就行 >> 精度只有2位小数,所以使用float型会快一些 > 思路 >> 从n=1开始,将长度递减,减到小于等于0为止 > 附代码 #include "stdio.h" int main(void) { float len = 0.0 ; int count = 0 ; while(1) { scanf("%f", &len) ; if(len == 0.00)

POJ-1003&amp;1004

这两题比较简单,就不做分析了,描述下题目,就上代码吧. [题目描述] 1003,其实就是求这个方程的最小n:1/2 + 1/3 + 1/4 + ... + 1/(n + 1) >= c: 1004,其实就是算个平均数,直接除12 [附:完整代码] 1003题: /* POJ-1003 Hangover */ #include <iostream> using namespace std; int main() { double c; while(cin>>c) { if (c

POJ1003 UVALive2294 HDU1056 ZOJ1045 Hangover

Regionals 2001 >> North America - Mid-Central USA 问题链接:POJ1003 UVALive2294 HDU1056 ZOJ1045 Hangover. 题意简述:已知c=1/2+1/3+1/4+....1/(n+1),输入m(m是浮点数),求正整数n使得c>=m. 问题分析:从小到大试探n即可. AC的C语言程序如下: /* POJ1003 UVALive2294 HDU1056 ZOJ1045 Hangover */ #include

【POJ1003】Hangover(二分抖索)

直接用库函数二分即可. 1 #include <iostream> 2 #include <cstring> 3 #include <cstdlib> 4 #include <cstdio> 5 #include <cmath> 6 #include <cctype> 7 #include <algorithm> 8 #include <numeric> 9 10 #define eps 1e-8 11 usi

E - Hangover(1.4.1)

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Submit Status 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 assum

HangOver(杭电1056)

HangOver Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9821    Accepted Submission(s): 4137 Problem Description How far can you make a stack of cards overhang a table? If you have one card, y

poj 1003:Hangover(水题,数学模拟)

Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 99450   Accepted: 48213 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 as

POJ 1003 Hangover&amp;&amp;NYOJ 156 Hangover【数学题】

计算1+1/2+1/3+++1/n Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 104558   Accepted: 50926 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 car

Hangover

POJ - 1003 Hangover           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