OpenJudge / Poj 1003 Hangover
2014-01-13 10:17
344 查看
链接地址:
Poj:http://poj.org/problem?id=1003
OpenJudge:http://bailian.openjudge.cn/practice/1003
题目:
Hangover
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
Sample Output
Source
Mid-Central USA 2001
思路:
水题
代码:
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 |
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.00
Sample Output
3 card(s) 61 card(s) 1 card(s) 273 card(s)
Source
Mid-Central USA 2001
思路:
水题
代码:
#include "stdio.h" //#include "stdlib.h" int main() { float a,sum; int i; scanf("%f",&a); while(a!=0) { i = 2; sum = 0; while(sum < a) { sum += ((float)1/i); i++; } printf("%d card(s)\n",i-2); scanf("%f",&a); } //system("pause"); return 1; }
相关文章推荐
- POJ 1003 Hangover 解题报告
- POJ1003-Hangover
- OpenJudge/Poj 1163 The Triangle
- OpenJudge/Poj 1207 The 3n + 1 problem
- OpenJudge/Poj 1251 丛林中的路/Jungle Roads
- OpenJudge/Poj 1517 u Calculate e
- OpenJudge/Poj 2105 IP Address
- poj 1003(Hangover)
- POJ-1003-Hangover
- Poj OpenJudge 百练 2389 Bull Math
- poj 1003 Hangover
- poj 1003:Hangover(水题,数学模拟)
- poj 随机快速排序(algo.openjudge.cn)
- Hangover - POJ 1003 水题
- poj 1003 Hangover
- ACM学习-POJ-1003-Hangover
- POJ 1003 Hangover
- OpenJudge / Poj 1565 Skew Binary C++
- POJ 1003 Hangover
- POJ 1003 Hangover