HangOverTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16252 Accepted Submission(s): 7189 http://acm.hdu.edu.cn/showproblem.php?pid=1056 Problem 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.
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) |
代码:
#include<iostream>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<cstdio>
#define inf 0x3f3f3f3f
using namespace std;
int main()
{
double s;
int n;
while(cin>>s&&s)
{
if(s<=0.5)
n=1;
else
{
double a=0;
n=0;
for(int i=2;;i++)
{
a+=1.0/(double)i;
n++;
if(a>=s)
break;
}
}
cout<<n<<" card(s)"<<endl;
}
return 0;
}