POJ 百炼 保研机试 1003:Hangover
来源:互联网 发布:json传值到controller 编辑:程序博客网 时间:2024/04/29 11:24
1003:Hangover
- 查看
- 提交
- 统计
- 提示
- 提问
- 总时间限制:
- 1000ms
- 内存限制:
- 65536kB
- 描述
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 ncards 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.003.710.045.190.00
- 样例输出
3 card(s)61 card(s)1 card(s)273 card(s)
#include<stdio.h>int main(){double n;double len[300];len[1]=0.5;for(int i=2;i<300;i++){len[i]=len[i-1]+1.0/(i+1); }while(scanf("%lf",&n)!=EOF&&n!=0){for(int i=1;i<300;i++){if(len[i]>n){printf("%d",i);break;}}printf(" card(s)\n");}}
- POJ 百炼 保研机试 1003:Hangover
- 北大百炼1003 Hangover 题解
- POJ 百练 1003: Hangover
- POJ 1003--Hangover
- (POJ 1003)Hangover
- poj 1003Hangover
- POJ 1003 Hangover
- poj 1003 Hangover
- poj 1003(Hangover)
- 【POJ】1003 Hangover
- POJ-1003:Hangover
- [POJ]1003 Hangover
- POJ 1003 Hangover
- poj 1003 Hangover
- POJ 1003 Hangover
- 【POJ-1003】Hangover
- POJ-1003-Hangover
- poj 1003 Hangover
- Java并发编程:深入剖析ThreadLocal
- maltab line函数用法
- Structs+Spring+Hibernate快速入门
- Linux启动oracle
- IOS关于支付宝的集成与支付
- POJ 百炼 保研机试 1003:Hangover
- LeetCode Reverse Integer
- 从老师教了半年oc,到自学了1年多ios的我
- 多态机制原理解析--从内存角度分析
- session_unset()和session_destroy()用法分析
- jQuery 实现多页面换肤
- 黑马程序员——interface
- 回调使用记录
- C__ Linux C 中__user的含义