【POJ】1003 Hangover
2014-05-26 12:34
405 查看
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
又是一道水题...
又是暴力...
没办法,数据范围实在太小 ╮(╯_╰)╭
唉。
怒贴代码:
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)
又是一道水题...
又是暴力...
没办法,数据范围实在太小 ╮(╯_╰)╭
唉。
怒贴代码:
#include<stdio.h> #include<iostream> using namespace std; int main() { const int size=300; double l; double length[size]={0.0}; while(scanf("%lf",&l)&&l) { int i; for(i=1;i<size;i++) { if(!length[i]) length[i]=length[i-1]+1.0/(i+1.0); if(length[i]>=l) break; } printf("%d card(s)\n",i); } return 0; }
相关文章推荐
- poj 1003(Hangover)
- poj 1003 Hangover 解题报告
- POJ-1003 Hangover-纸牌叠放
- POJ 1003 Hangover 解题报告
- POJ 1003 Hangover
- POJ 1003 Hangover 水题
- POJ1003 Hangover
- POJ 1003 - Hangover
- POJ 百练 1003: Hangover
- poj 1003 Hangover
- poj 1003:Hangover
- POJ 1003求Hangover解题报告——【PKU ACM】
- POJ1003-Hangover
- POJ-1003-Hangover
- poj 1003 Hangover
- poj 1003 (nyoj 156) Hangover
- poj_1003——Hangover
- POJ1003-Hangover
- POJ 1003 Hangover 水题一道 练习C++编程
- POJ 1003--Hangover