POJ 1003:Hangover
2015-07-08 22:28
489 查看
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
水题,求 1/2 + 1/3 + 1/4 + ... + 1/(n + 1)>=c的最小n。输出时候注意要将退出的n减2才符合条件。
代码:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 109231 | Accepted: 53249 |
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)
水题,求 1/2 + 1/3 + 1/4 + ... + 1/(n + 1)>=c的最小n。输出时候注意要将退出的n减2才符合条件。
代码:
#include <iostream> using namespace std; int main() { double x,sum=0; int n; cin>>x; for(;;) { if(!x) break; for(n=2;;n++) { if(sum>x) break; sum=sum+(double)1/n; } cout<<n-2<<" card(s)"<<endl; sum=0; cin>>x; } return 0; }
相关文章推荐
- POJ 1003:Hangover
- AC GO GO GO!!!
- Algorithm --> 邮票连续组合问题
- Scrapy的Ip代理的配置(未完成)
- freemarker XMLGregorianCalendar 转日期
- Django项目国际化
- GooFlow
- Algorithm --> 字母重排
- Django静态文件配置
- 总结Django中的用户权限模块
- Mongo库表操作命令
- [翻译]Go语言调度器
- 让乐视如此优惠电信欢go怎么做到的
- 关于&nbsp;空格实体在最新的IE、Firefox和Google Chrome浏览器中解析宽度不一致问题的解决
- Algorithm --> 6174问题
- Go home or stand up
- GO语言使用开源SSH模拟终端
- Why we need model on Django ?
- Golang png Decode解析不了png图片
- 算法基础:最大递减数问题(Golang实现)