HANGOVER - 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.

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.

Input:
1.00
3.71
0.04
5.19
0.00

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

Added by:Wanderley Guimarăes
Date:2006-06-09
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:ACM Mid Central Regionals 2001

hide comments
2016-11-16 22:17:46
Seriously one of the worst problem description.. -_- Thanks to this kind of description that took me about 10mins to understand what actually i need to do and just 1min to code and run it -_-. For those of you who can't get what c is...well you have to find it on your own :P :P
2016-08-16 00:21:30
AC in one go! I had a few troubles writing the code at first, but this problem is actually pretty simple... I really enjoyed it! =)

Last edit: 2016-08-16 00:22:10
2016-08-02 06:09:21 Sarvajeet Suman
AC in 1 GO .......... Easy Problem.
2016-07-09 14:59:56
brute force!!
2016-06-21 10:48:46
AC!! in one GO!!!
2016-06-20 18:40:33
floats comparison is an important factor here...otherwise very simple.
2016-06-10 19:37:42
got 2WA just of output format :/
2016-05-27 21:22:00
easiest i have ever solve on spoj
2016-05-13 21:05:37
why this card(s)? WA multiple times. :(
Need to pay attention to details it seems.
2016-04-19 17:01:40
wasted half an hour understanding this text......very simple problem.....really very easy :)
AC in one go!!
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.