hdu_1056_HangOver_201311071354
2013-11-07 14:05
441 查看
HangOver
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8258 Accepted Submission(s): 3414[align=left]Problem Description[/align]
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.
![](http://www.cnblogs.com/data/images/1056-1.gif)
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.
[align=left]Sample Input[/align]
1.00
3.71
0.04
5.19
0.00
[align=left]Sample Output[/align]
3 card(s)
61 card(s)
1 card(s)
273 card(s)
[align=left]Source[/align]
Mid-Central USA 2001
#include <stdio.h> int main() { double n; while(scanf("%lf",&n),n) { int i; double sum=0; i=0; while(sum<n) { i++; sum+=1.0/(i+1); } printf("%d card(s)\n",i); } return 0; }
简单题,按题中给的公式来就行
相关文章推荐
- 十三 Django 1.5.4 ModelForms
- Time complexity analysis of algorithms
- 十二 Django 1.5.4 外键操作
- Codility -- Perm-Check
- 解决Google Chrome Canery 搜索结果不显示搜索栏的情况
- pip uninstall pymongo
- algorithms中计算时间的渐近表示
- Codility -- Number-of-disc-intersections
- Codility -- passing cars
- 十一 Django 1.5.4 修改个人用户信息
- Let's go, Just do it, and enjoy it
- 有关于Algorithm的基础介绍
- [LeetCode] Path Sum II
- [LeetCode] Search for a Range
- [LeetCode] Combinations
- 《Go语言编程》学习笔记 (一)
- 《Go语言编程》学习笔记 (二)
- django form 表单重复提交的解决方案
- 看 Google 员工怎么吐槽 Google!
- [Tess Lab 记录] Go Through -> .NET Debugging Demos Lab 1: Hang