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.
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)
又是一道水题...
又是暴力...
没办法,数据范围实在太小 ╮(╯_╰)╭
唉。
怒贴代码:
#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
const int size=300;
double l;
double length[size]={0.0};
while(scanf("%lf",&l)&&l)
{
int i;
for(i=1;i<size;i++)
{
if(!length[i])
length[i]=length[i-1]+1.0/(i+1.0);
if(length[i]>=l)
break;
}
printf("%d card(s)\n",i);
}
return 0;
}