POJ 1003 Hangover

谁借莪１个温暖的怀抱￠ 2022-09-30 03:37 99阅读 0赞

<table style="font-family:&quot;Microsoft YaHei&quot;"> 
 <tbody> 
  <tr> 
   <td> 
    <div style="text-align:center; font-size:18pt; font-weight:bold; color:blue">
      Hangover 
    </div> 
    <div style="text-align:center; font-size:12pt"> 
     <table> 
      <tbody> 
       <tr> 
        <td><strong>Time Limit:</strong>&nbsp;1000MS</td> 
        <td>&nbsp;</td> 
        <td><strong>Memory Limit:</strong>&nbsp;10000K</td> 
       </tr> 
       <tr> 
        <td><strong>Total Submissions:</strong>&nbsp;124095</td> 
        <td>&nbsp;</td> 
        <td><strong>Accepted:</strong>&nbsp;60548</td> 
       </tr> 
      </tbody> 
     </table> 
    </div> <p style="font-size:18pt; font-weight:bold; color:blue">Description</p> 
    <div style="font-family:&quot;Times New Roman&quot;,Times,serif; font-size:12pt"> 
     <p>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&nbsp;+&nbsp;1/3&nbsp;=&nbsp;5/6 card lengths. In general you can make&nbsp;<em>n</em>&nbsp;cards overhang by 1/2&nbsp;+&nbsp;1/3&nbsp;+&nbsp;1/4&nbsp;+&nbsp;...&nbsp;+&nbsp;1/(<em>n</em>&nbsp;+&nbsp;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/(<em>n</em>&nbsp;+&nbsp;1). This is illustrated in the figure below.</p> 
     <br>  
     <img src="http://poj.org/images/1003/hangover.jpg" width="424" height="115" alt="">  
     <br> 
    </div> <p style="font-size:18pt; font-weight:bold; color:blue">Input</p> 
    <div style="font-family:&quot;Times New Roman&quot;,Times,serif; font-size:12pt">
      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. 
    </div> <p style="font-size:18pt; font-weight:bold; color:blue">Output</p> 
    <div style="font-family:&quot;Times New Roman&quot;,Times,serif; font-size:12pt">
      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. 
    </div> <p style="font-size:18pt; font-weight:bold; color:blue">Sample Input</p> <pre style="font-family:&quot;Courier New&quot;,Courier,monospace; font-size:12pt">1.00
3.71
0.04
5.19
0.00
</pre> <p style="font-size:18pt; font-weight:bold; color:blue">Sample Output</p> <pre style="font-family:&quot;Courier New&quot;,Courier,monospace; font-size:12pt">3 card(s)
61 card(s)
1 card(s)
273 card(s)</pre> <p style="font-size:18pt; font-weight:bold; color:blue">Source</p> 
    <div style="font-family:&quot;Times New Roman&quot;,Times,serif; font-size:12pt"> 
     <a href="http://poj.org/searchproblem?field=source&amp;key=Mid-Central+USA+2001" style="text-decoration:none" rel="nofollow">Mid-Central USA 2001</a> 
    </div> </td> 
  </tr> 
 </tbody> 
</table>

import java.util.Scanner;
    
    public class Main {
    	
    	public static void main(String[] args) {
    		Scanner sc = new Scanner(System.in);
    		while(sc.hasNext()){
    			double x = sc.nextDouble();
    			if(x == 0)
    				break;
    			int result = f(x);
    			System.out.println(result + " card(s)");
    		}
    	}
    
    	private static int f(double x) {
    		int i=1;
    		double sum=0;
    		while(sum < x){
    			sum += 1.0/(i+1);
    			i++;
    		}
    		return i-1;
    	}
    }