NYOJ 156 Hangover
来源:互联网 发布:淘宝淘积木 编辑:程序博客网 时间:2024/06/05 15:14
Hangover
- 描述
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.
- 样例输入
1.00
3.71
0.04
5.19
0.00
- 样例输出
3 card(s)
61 card(s)
1 card(s)
273 card(s)
- 来源
- POJ
- 上传者
iphxer
/***类型:入门级题目**题目来源:NYOJ 156**时间:2017/7/22**解决方案:*/#include<stdio.h>int main(){double c;while(scanf("%lf",&c)!=EOF&&c!=0.00) //%lf {double sum = 0.0;int count = 0;if(c <= 0.5){printf("1 card(s)\n");}else{for(int i = 2; ; i++){sum = sum + 1.0/i;count ++;if(sum >= c){printf("%d card(s)\n",count);break;}}}} return 0;} //再次看一下%f %lf 以及思考最大值5.20,可以表示最大数为?
- NYOJ 156 Hangover
- NYOJ 156 Hangover
- NYOJ 156 Hangover
- NYoj 156 Hangover
- NYOJ 156 Hangover
- POJ 1003 Hangover&&NYOJ 156 Hangover【数学题】
- NYOJ - Hangover
- poj 1003 (nyoj 156) Hangover
- poj 1003&&HDU 1056 && nyoj 156 Hangover【水题】
- Hangover
- Hangover
- HangOver
- Hangover
- Hangover
- HangOver
- Hangover
- Hangover
- HangOver
- muduo源码分析之Acceptor
- Average of Levels in Binary Tree问题及解法
- 【华为机试】计算字符个数
- 基于Swift的iOS应用程序开发:对字符串进行MD5加密
- opencv + cmake + vs2010 配置过程
- NYOJ 156 Hangover
- 【转载】猫都能学会的Unity3D Shader入门指南(二)
- vue axios用法
- HPU2017-2016级暑期集训练习赛
- C语言-printf()和scanf()中*的作用
- STL 常用操作指令和内建函数
- leetcode 155. Min Stack | 空间换时间
- Stones(优先队列)
- [leetcode]529. Minesweeper