结题报告：POJ_1003

 

一、原题：

连接： http://poj.org/problem?id=1003

Hangover

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 63083		Accepted: 29730

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.

二、Source Code：

Source Code

Problem: 1003		User: mervyn_diane
Memory: 216K		Time: 16MS
Language: C++		Result: Accepted

• Source Code

#include<iostream> using namespace std; int main() { int alert; double r, sum, n; cin >> r; while( r != 0 ) { sum = 0; alert = 1; n = 2.0; while( alert == 1 ) { sum += ( 1 / n ); if( sum < r ) n++; else { alert--; break; } } cout << n - 1 << " card(s)" << endl; cin >> r; } return 0; }

三、总结

1、水题一个，读懂题目就好；一直循环加，直到和大于给定的值为止；

2、注意这里的n，一定要是小数，否则sum会一直为0。