1003:Hangover 查看提交统计提示提问 总时间限制:  1000ms  内存限制:  65536kB 描述 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 ca

直接贴代码。水！ #include<stdio.h>double s,n;int c;main(){while(scanf("%lf",&n)==1&&n>0){for(c=1,s=0.5;s<n;c++)s+=(1.0/(c+2));printf("%d card(s)\n",c);}}

地址： http://poj.org/problem?id=1003 题意很简单，输入一个数， 算出1/2 + 1/3 + 1/4 + ... + 1/(n + 1)大于这个数时的最小n。 用了一个很暴力的方法就是打表； #include<iostream>using namespace std;double c[296]={0.0,0.5,0.833333,1.

题目： 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 perpe

题目 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 t

Hangover 时间限制: 1000ms 内存限制: 65536KB 问题描述     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 are assum