HangOver
2015-07-28 09:57
411 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1056
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10699 Accepted Submission(s): 4575
Problem 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.
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.
Sample Input
Sample Output
HangOver
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10699 Accepted Submission(s): 4575
Problem 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.
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.
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)
#include <cstdio> int main() { double f; while(scanf("%lf",&f)!=EOF&&f!=0){ int ans=1; double fl=0.5; while(f>fl){ fl+=(double)1/(ans+2); ans++; } printf("%d card(s)\n",ans); } }
相关文章推荐
- 前向分步算法(forward stagewise algorithm)
- Golang网页下载示例
- 【Google】25匹马的角逐
- Django basic command
- hdu 4722 Good Numbers(数位dp)
- HDU 2092 整数解
- django 1.8 官方文档翻译: 3-6-1 中间件概览
- 谷歌注册多个与Google Play和 China相关域名
- Goldbach's Conjecture(哥德巴赫猜想)
- mongo安装副本集
- HDU 1512 Monkey King(左偏树+并查集)
- 在heroku上部署gost代理服务端
- chrome访问google的hosts文件设置,测试好用
- go语言常用函数:copy
- go语言常用函数:make
- go语言常用函数:cap
- Django实例--英文、数字与中文之间增加空格
- UVA 11090 Going in Cycle!! 环平均权值(bellman-ford,spfa,二分)
- 在Django框架中设置语言偏好的教程
- Django 学习 2 MODEL数据建模