首页 > ACM题库 > HDU-杭电 > HDU 1346 Coconuts, Revisited-模拟-[解题报告] cpp:nocontrols
2013
12-09

HDU 1346 Coconuts, Revisited-模拟-[解题报告] cpp:nocontrols

Coconuts, Revisited

问题描述 :

The short story titled Coconuts, by Ben Ames Williams, appeared in the Saturday Evening Post on October 9, 1926. The story tells about five men and a monkey who were shipwrecked on an island. They spent the first night gathering coconuts. During the night, one man woke up and decided to take his share of the coconuts. He divided them into five piles. One coconut was left over so he gave it to the monkey, then hid his share and went back to sleep.

Soon a second man woke up and did the same thing. After dividing the coconuts into five piles, one coconut was left over which he gave to the monkey. He then hid his share and went back to bed. The third, fourth, and fifth man followed exactly the same procedure. The next morning, after they all woke up, they divided the remaining coconuts into five equal shares. This time no coconuts were left over.

An obvious question is “how many coconuts did they originally gather?" There are an infinite number of answers, but the lowest of these is 3,121. But that’s not our problem here.

Suppose we turn the problem around. If we know the number of coconuts that were gathered, what is the maximum number of persons (and one monkey) that could have been shipwrecked if the same procedure could occur?

输入:

The input will consist of a sequence of integers, each representing the number of coconuts gathered by a group of persons (and a monkey) that were shipwrecked. The sequence will be followed by a negative number.

输出:

For each number of coconuts, determine the largest number of persons who could have participated in the procedure described above. Display the results similar to the manner shown below, in the Sample Output. There may be no solution for some of the input cases; if so, state that observation.

样例输入:

25
30
3121
-1

样例输出:

25 coconuts, 3 people and 1 monkey
30 coconuts, no solution
3121 coconuts, 5 people and 1 monkey

/*
	Author: ACb0y
	Date: 2010-8-25
	Type: Water~~(force)
	ProblemId: hdu 1346 Coconuts, Revisited
*/
#include <iostream>
using namespace std;

int n;

int get_ans() {
	int i, j;
	/*
		从n开始递减枚举(n -> 1)
	*/
	for (i = n; i > 0; i--) {
		int total = n;
		//模拟处理过程
		for (j = 0; j < i; j++) {
			if (total % i == 1) {
				total -= total / i + 1;
			} else {
				break;
			}
		}
		//如果模拟成功则返回结果,第一个符合要求的数就是最大的数。
		if (j == i && total % i == 0) {
			return i;
		}
	}
	return 0;
}

int main() 
{
#ifndef ONLINE_JUDGE
	freopen("1346.txt", "r", stdin);
#endif
	while (cin >> n) 
	{
		if (n == -1) {
			break;
		} else {
			int ans = get_ans();
			if (ans == 0) {
				cout << n << " coconuts, no solution" << endl;
			} else {
				cout << n << " coconuts, " << ans << " people and 1 monkey" << endl;
			}
		}
	}
	return 0;
}

解题报告转自:http://blog.csdn.net/acb0y/article/details/5836797