题目链接:Hangover
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
1.00
3.71
0.04
5.19
0.00
Sample Output
3 card(s)
61 card(s)
1 card(s)
273 card(s)
主要思路:
数据输入以 0.00 结束,如何记录数据成为问题。
有人采用大数组的方法,虽然可以通过 ACM 的TC测试(数组大小达到一定程度),但是还是觉得不是真正的解决方法。
这里采用了链表记录数据。
源代码
#include <iostream>
using namespace std;
struct LengthNode
{
float length;
LengthNode* pNext;
};
int main()
{
float input = 0;
LengthNode* pFirstNode;
LengthNode* pNewNode;
LengthNode* pPreNode;
cin >> input;
pFirstNode = new LengthNode;
pFirstNode->length = input;
pFirstNode->pNext = NULL;
pPreNode = pFirstNode;
while(input != 0)
{
cin >> input;
pNewNode = new LengthNode;
pNewNode->length = input;
pNewNode->pNext = NULL;
pPreNode->pNext = pNewNode;
pPreNode = pNewNode;
}
LengthNode* pNode = pFirstNode;
float sum = 0;
int n = 2;
while(pNode->pNext != NULL)
{
sum = 0;
n = 2;
//cout << pNode->length << endl;
while(sum < pNode->length)
{
sum = sum + (1.0/n);
n++;
}
cout << (n-2) << " card(s)" << endl;
pNode = pNode->pNext;
}
return 0;
}