# NYOJ 156 Hangover

440人阅读 评论(0)

## Hangover

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.

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.

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.

1.003.710.045.190.00

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

POJ

iphxer
#include<stdio.h>
int main()
{
double sum;
while(~scanf("%lf",&sum),sum)
{
double s=0,a=0;
while(sum>s)
{
s+=1/(2+a);
a++;
}
printf("%.lf card(s)\n",a);
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：261051次
• 积分：5692
• 等级：
• 排名：第4730名
• 原创：294篇
• 转载：141篇
• 译文：5篇
• 评论：33条
阅读排行
评论排行
最新评论