hdu 1346 Coconuts, Revisited
来源:互联网 发布:爱国者u盘加密软件 编辑:程序博客网 时间:2024/05/03 13:57
题目地址:
http://acm.hdu.edu.cn/showproblem.php?pid=1346
题目描述:
Coconuts, Revisited
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 439 Accepted Submission(s): 167
Problem 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 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?
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 Sample Output. There may be no solution for some of the input cases; if so, state that observation.
Sample Input
25303121-1
Sample Output
25 coconuts, 3 people and 1 monkey30 coconuts, no solution3121 coconuts, 5 people and 1 monkey
题意:
每趟n堆,剩下一个给猴子,并且把自己的那堆藏起来。以此类推走n趟。
题解:
模拟,从最大个数的人枚举并分堆的过程,一旦符合条件立即退出就是最大人数;枚举完所有人数都不行的话就是no solutions。
代码:
#include<stdio.h>int nuts=0,peo=0;int main(){ while(scanf("%d",&nuts)!=EOF&&nuts>=0) { int flag=0; for(peo=nuts-1;peo>=2;peo--) { int sum = nuts,turn = 0; for(turn=1;turn<=peo;turn++) { if((sum-1)%peo!=0) break; sum = sum -1 - (sum-1) / peo; } if((turn > peo)&&(sum%peo == 0)) {flag=1;break;}//have found the max number } if(flag) printf("%d coconuts, %d people and 1 monkey\n",nuts,peo); else printf("%d coconuts, no solution\n",nuts); } return(0);}
0 0
- hdu 1346 Coconuts, Revisited
- hdu 1346 Coconuts, Revisited
- Coconuts, Revisited
- fjnu 1688 Coconuts, Revisited
- uva 616 - Coconuts, Revisited(数学)
- UVa 616 - Coconuts, Revisited (数学)
- Uvalive—5462 Coconuts, Revisited
- POJ 1309 Coconuts, Revisited 笔记
- Coconuts HDU
- D - Coconuts HDU - 5925
- HDU 5925Coconuts
- 【最小割】 HDU 3138 Coconuts
- Coconuts
- hdu 5925 Coconuts (构造,离散化*)
- HDU 5925 Coconuts 离散化 + BFS
- HDU 5929 Coconuts(离散化+dfs)
- HDU 5925 Coconuts [二维离散化]【杂类+思维】
- HDU 5925 Coconuts(离散化+bfs, 好题)
- <meta http-equiv=”X-UA-Compatible” content=”IE=edge,chrome=1″ />
- wince隐藏开始菜单
- 将odex转为jar
- canvas.drawText把文字画到view的最中间
- 看门狗
- hdu 1346 Coconuts, Revisited
- struts2源码分析-IOC容器的实现机制(上篇)
- 异地备份的最佳实践与注意事项
- 类变量和实例变量的区别
- Struts2-----3、Struts2的流程
- ls命令文件名后面那个*号
- java自学之路-----jdbc_框架
- 数据挖掘对客户进行深入分析
- android 屏幕适配