POJ1309 HDU1346 ZOJ1269 UVA616 UVALive5462 Coconuts, Revisited【暴力+模拟】

Coconuts, Revisited

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 2171		Accepted: 885

Description

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 sheep. 

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? 
 

Input

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.

Output

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 Expected Output. There may be no solution for some of the input cases; if so, state that observation.

Sample Input

25
30
3121
-1

Sample Output

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

Source

North Central North America 1997

Regionals 1997 >> North America - North Central NA

 

问题链接：POJ1309 HDU1346 ZOJ1269 UVA616 UVALive5462 Coconuts, Revisited

问题描述：（略）

问题分析：

  这是一个与递推有关的问题，不过要把递推的数学式写出来还是要费点功夫的。

  为了简单，就模拟吧。开始的时候有n个椰子，可以假设有m个人，按照题意把每个人做的事情都模拟一边就好了。每一步都要保证是合理的。有m个人，n个椰子，其中一个给了猴子，并且分成m份，把自己的那一份藏起来，所以必须满足(n-1)%m==0。然后，椰子数量就变少了，少了(n-1)/m+1个。

  按理说，给定n个椰子，那有多少人呢？应该从人数m=n-1开始试探，看看能不能分到最后（题目中求的是最多的人数）。然而，如果从m=n-1开始的话，UVALive5462会TLE。那就假定人数不多于100人看看，程序中的100就是这么来的。程序中的M只能找个合适的值试一下。

程序说明：（略）

参考链接：（略）

题记：没有想出好办法就暴力或模拟，这两招都用上了。

 

AC的C++语言程序如下：

/* POJ1309 HDU1346 ZOJ1269 UVALive5462 Coconuts, Revisited */

#include <iostream>
#include <stdio.h>

using namespace std;

const int M = 100;

int main()
{
    int n;
    while(~scanf("%d", &n) && n >= 0) {
        bool flag = false;
        int m;
        for(m = M; m >= 2; m--) {
            int sum = n, j;
            for(j = 1; j <= m; j++) {
                if((sum - 1) % m != 0)
                    break;
                sum -= 1 + (sum - 1) / m;
            }
            if(j > m && sum % m == 0) {
                flag = true;
                break;
            }
        }

        if(flag)
            printf("%d coconuts, %d people and 1 monkey\n", n, m);
        else
            printf("%d coconuts, no solution\n", n);
    }

    return 0;
}