歡迎來到Linux教程網
Linux教程網
Linux教程網
Linux教程網
Linux教程網 >> Linux編程 >> Linux編程 >> Java程序練習-Hangover

Java程序練習-Hangover

日期:2017/3/1 11:16:46   编辑:Linux編程

描述
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)

參考代碼

  1. import java.util.*;
  2. public class Main {
  3. public static void main(String[] args) {
  4. Scanner cin = new Scanner(System.in);
  5. while(cin.hasNextFloat()){
  6. float ft = cin.nextFloat();
  7. if(ft == 0.0){
  8. break;
  9. }
  10. float temp = 0;
  11. int n = 1;
  12. while(temp <= ft){
  13. temp += 1.0 / (n + 1);
  14. n ++;
  15. }
  16. System.out.println((n - 1)+" card(s)");
  17. }
  18. }
  19. }
Copyright © Linux教程網 All Rights Reserved