个人信息:就读于燕大本科软件工程专业 目前大三;
本人博客:google搜索“cqs_2012”即可;
个人爱好:酷爱数据结构和算法,希望将来从事算法工作为人民作出自己的贡献;
编程语言:C++ 和 java ;
编程坏境:Windows 7 专业版 x64;
编程工具:vs2008;
制图工具:office 2010 powerpoint;
硬件信息:7G-3 笔记本;
真言
题目敢于承认不足,敢于去接触和学习,同时又沉稳而镇静
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.
代码 java
//package packageTest; import java.io.*; import java.util.*; public class Main { public static void main(String args[]) throws Exception { Scanner cin = new Scanner(System.in); double a = cin.nextDouble(); while(a != 0) { my_1003(a); a = cin.nextFloat(); } } public static void my_1003(double sum) { double result = 0.5 ; double i = 2; //System.out.println(sum); while(result <sum) { //System.out.println(result+" "+i); i++; result = result + (1/i) ; } System.out.println( (int)(i-1) +" card(s)"); } }
原文:http://blog.csdn.net/cqs_experiment/article/details/35569065