1003:Hangover-条件是程序可以持续的条件-每一次循环sum要清零-for括号后不要；-float与double-除法不要除以0

1/n求和

key：

1.条件是程序可以持续的条件

for ( i = 1 ; sum < number ; ++i)

2.每一次循环sum要清零，所以初始化sum在while里

double sum = 0;

3.for括号后不要；

for ( i = 1 ; sum < number ; ++i)

4.float与double，float内存更低，不过小数点后数多的时候要double

			double sum = 0;

5.除法不要除以0

				sum += 1.0 / ( i + 1 ) ;	

感觉：

1. print大法和debug运用熟练很多
2. 一开始先写流程图，理顺思路更好
3. 好像很多人刷G++，poj里好少java的感觉
4. 看英文好像能看进去了，渐渐看懂了，不需要中文辅助
5. 这是美国01年的题，poj09年的题，感觉自己好弱

import java.util.Scanner;


public class Main{

	public static void main(String[] args) {

		Scanner in = new Scanner(System.in);
		
		float number = in.nextFloat();
		
		while (number != 0)
		{
			int i;
			double sum = 0;
			
			for ( i = 1 ; sum < number ; ++i)
			{
				sum += 1.0 / ( i + 1 ) ;					
			}
			
			System.out.println(i-1 + " card(s)");
			number = in.nextFloat();
		}
		
	}
}  

1003:Hangove

总时间限制: 

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'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.

输入

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.

输出

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.

样例输入

1.00
3.71
0.04
5.19
0.00

样例输出

3 card(s)
61 card(s)
1 card(s)
273 card(s)

来源

Mid-Central USA 2001