POJ Hangover

最新推荐文章于 2019-01-14 22:24:27 发布

Tdreamge

最新推荐文章于 2019-01-14 22:24:27 发布

阅读量467

点赞数

本文链接：https://blog.csdn.net/tdreamge/article/details/7200297

版权

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.

第一块木板是1/2，第二块1/3。。。。。。总长==1/2+1/3 给你一个长度求最少多少个木板能达到该长度

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

[Submit] [Go Back] [Status] [Discuss]

#include <stdio.h>
int main(int argc, char *argv[])
{
int i;
double a[280],sum=0;
double num;
for (i=0;i<280;i++)
{
     a[i]=1.0/(i+2.0)+sum;
  sum=a[i];
}
while(scanf("%lf",&num))
{
        if (num==0.00) break;
        for (i=0;i<280;i++)
  {
      if (num<=a[i])
     {
            printf("%d card(s)\n",i+1);
   break;
     }
     }
}
return 0;
}