链接地址:
Poj:http://poj.org/problem?id=1003
OpenJudge:http://bailian.openjudge.cn/practice/1003
题目:
Hangover
Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 94993 Accepted: 46025 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 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.
Input
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.Output
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.Sample Input
1.00 3.71 0.04 5.19 0.00Sample Output
3 card(s) 61 card(s) 1 card(s) 273 card(s)Source
思路:
水题
代码:
1 #include "stdio.h" 2 //#include "stdlib.h" 3 int main() 4 { 5 float a,sum; 6 int i; 7 scanf("%f",&a); 8 while(a!=0) 9 { 10 i = 2; 11 sum = 0; 12 while(sum < a) 13 { 14 sum += ((float)1/i); 15 i++; 16 } 17 printf("%d card(s) ",i-2); 18 scanf("%f",&a); 19 } 20 //system("pause"); 21 return 1; 22 }