Hangover(水题)
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 86843 | Accepted: 41852 |
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.
![](http://poj.org/images/1003/hangover.jpg)
Input
Output
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
1 #include <iostream> 2 #include <string> 3 #include <set> 4 #include <map> 5 #include <vector> 6 #include <stack> 7 #include <queue> 8 #include <cmath> 9 #include <cstdio> 10 #include <cstring> 11 #include <algorithm> 12 #include <utility> 13 using namespace std; 14 #define ll long long 15 #define cti const int 16 #define ctll const long long 17 #define dg(i) cout << '*' << i << endl; 18 19 int main() 20 { 21 double len, sum; 22 int i; 23 while(cin >> len && len) 24 { 25 sum = 0.0; 26 for(i = 1; ; i++) 27 { 28 sum += 1.0 / (i + 1); 29 if(sum >= len) break; 30 } 31 printf("%d card(s)\n", i); 32 } 33 return 0; 34 }