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)
hide comments
rohit9934:
2017-05-05 18:51:51
sometimes a while loop is enough to get AC .
|
|
ruchir_mathur:
2017-04-03 18:39:01
AC in one go!!!
|
|
nomins:
2017-03-27 17:12:31
hello me help
|
|
sunny:
2017-03-05 06:30:27
Ac in 1 Go... Easy problem ..but worst problem statement .. problem statement has to be improved. |
|
masterbios:
2017-02-28 22:39:10
Don't think too hard it's quite simple |
|
nilabja16180:
2017-02-09 12:25:29
AC in one GO!! |
|
ayushagg31:
2017-01-23 15:14:02
AC in one go!!!....just look at the formula and you are ready to go...:)
|
|
dhruv19:
2016-12-20 15:58:03
what is c (input)??
|
|
srihari_v:
2016-12-19 11:40:02
this is my 15th...........!
|
|
sri:
2016-11-19 16:12:44
125th question!!
|
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 |