北大OJ1003题

胡萝卜的贝

于 2021-01-27 22:35:56 发布

阅读量470

点赞数

文章标签： c++ 算法

本文链接：https://blog.csdn.net/qq_40469862/article/details/113279037

版权

题目 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)

代码：

#include <iostream>
using namespace std;

int cardnumber(float l);

int main()
{
	float ch[50] ;
	float c;
	int i;
	for (i = 0; i < 50; i++)
	{
		cin >> c;
		if (c != 0.00)
			ch[i] = c;
		else
			break;
	}

	for (int j = 0; j < i; j++)
	{
		int f = cardnumber(ch[j]);
		cout << f <<" card(s)"<< endl;
	}

	return 0;
}

int cardnumber(float l)
{
	int len = 0;
	float length = 0.00;
	while (length < l)
	{
		len++;
		length += (1.0 / (len + 1));
	}
	return len;
}

编译结果：
在这里插入图片描述

这部分代码是如题中所给样例，输入一串数字后统一进行输出，但是用了数组就有些麻烦。在网上看了看别人的答案后发现可以输入输出匹配运行，代码如下：

#include <iostream>
using namespace std;

int main()
{
	float c, sum;
	int i;
	cin >> c;
	while (c != 0.00)
	{
		sum = 0.00;
		for (i = 2; sum < c; i++)
		{
			sum += 1.0 / i;
		}
		cout << i - 2 << " card(s)" << endl;
		cin >> c;
	}
	return 0;
}