POJ1003-C++

POJ1003

问题描述：

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 <cstdio>
#include <cmath>

float findTargetNumber[276] = { 0 };

void findTarget() {
	findTargetNumber[0] = 0.5;
	for (int i = 1; i < 276; i++) {
		findTargetNumber[i] = 1.0 / (i + 2) + findTargetNumber[i - 1];
	}
}
int main() {
	findTarget();
	float inputNumber[1000];
	int k = 0;
	while (scanf("%f", &inputNumber[k]) != EOF) {
		if (inputNumber[k] < 0.01) break;
		k++;
	}
	for (int i = 0; i < k; i++) {
		if (inputNumber[i] < 0.5) {
			printf("1 card(s)\n");
			continue;
		}
		if (inputNumber[i] < 2.60) {
			for (int j = 0; j < 275; j++) {
				if (inputNumber[i] > findTargetNumber[j] && inputNumber[i] <= findTargetNumber[j + 1]) {
					printf("%d card(s)\n", j + 2);
				}
			}
		}
		else {
			for (int j = 275; j > 0; j--) {
				if (inputNumber[i] > findTargetNumber[j] && inputNumber[i] <= findTargetNumber[j + 1]) {
					printf("%d card(s)\n", j + 2);
				}
			}
		}
	}
	return 0;
}