hdu-oj 1056 HangOver
来源:互联网 发布:企业办公网络组网方案 编辑:程序博客网 时间:2024/06/01 10:07
HangOver
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9319 Accepted Submission(s): 3920
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)题目大意:输出长度>=n所需要的木板数目;注意:长度和应定义为double类型附代码:#include <stdio.h>int main(){ double sum,n; int i; while(scanf("%lf",&n)!=EOF&&n!=0) { sum=0; for(i=1;;i++) { sum+=1.0/(i+1); if(sum>=n) break; } printf("%d card(s)\n",i); } return 0;}
0 0
- hdu-oj 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 1056 HangOver
- HDU 1056 HangOver
- hdu 1056 HangOver
- hdu-1056 HangOver
- hdu 1056 HangOver
- HDU 1056 HangOver
- HDU 1056 HangOver(数学题)
- HDU 1056HangOver
- Ubuntu在VMWare上不能使用共享文件夹
- vs2010 打开项目时 不能加载包
- C语言字符串输入,gets函数的缺点以及解决方法
- 编程之美--3.3计算字符串的相似度
- spring mvc 文件上传
- hdu-oj 1056 HangOver
- CSS 相邻兄弟选择器
- BestCoder Round #3 Task schedule
- hdu 2604 queuing dfa dp + 矩阵快速幂
- UVa784 - Maze Exploration-Runtime Error 的悲剧坑
- HDU 4907 - Task schedule(BestCoder Round #3 简单DP)
- performSelector浅析
- 法国哥哥哥哥哥哥哥哥哥哥哥哥哥哥
- BestCoder Round #3 BestCoder Sequence