杭电 HDU 1050 HangOver
来源:互联网 发布:淘宝发优惠券软件赚钱 编辑:程序博客网 时间:2024/05/16 16:08
HangOver
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10329 Accepted Submission(s): 4381
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.
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.003.710.045.190.00
Sample Output
3 card(s)61 card(s)1 card(s)273 card(s)
Source
Mid-Central USA 2001
水的不成样子
#include<iostream>using namespace std;int main(){double sum, n; int i;while(cin>>n,n){int count=0;sum=0;for(i=2;n>sum;i++){sum+=1.0/i;count++;}cout<<count<<" card(s)"<<endl;}return 0;}
0 0
- 杭电 HDU 1050 HangOver
- HangOver(杭电1056)
- HDU HangOver
- 杭电OJ题 1056 HangOver解题报告
- 杭电1056——HangOver(水题)
- HDU 1056 HangOver
- hdu 1056 HangOver
- hdu 1056 HangOver(水)
- hdu 1056 HangOver
- HDU 1056 ( HangOver )
- HDU 1056 HangOver
- hdu 1056 HangOver 水题
- HDU 1056 HangOver
- HDU 1056 HangOver
- hdu-oj 1056 HangOver
- HDU 1056 HangOver
- HDU 1056 HangOver
- hdu 1056 HangOver
- 读《人生不设限》 有感
- 3.20
- 非法文件名
- hdu 4638 Group (线段树+离线处理)
- 3.21
- 杭电 HDU 1050 HangOver
- 0.0新手,练手
- python之sqlite3使用详解
- IDF实验室之初探乾坤简单编程-字符统计
- 用Java生成字符画
- Hibernate框架:3.23
- 优化表性能
- Web开发文章索引
- Chrome 扩展程序 Speed Dial 2 Techzero优化版 更新至 v1.4.0