one morning of Saturday

   准备今天去考英语,听说在什么六一中学,传说中的 144 or 996到,于是早早起来(大概6点吧),
好长早间没考试了心情激动,上了车还把英语书拿出来看,体验一下“不亮也光”。
终于快到什么中学,操,忽然想起没带准考证,别去了,赶快下车抬头一看到了什么钨。
做114来的找了整个站牌,丫的!就没有114,做了751到中关村倒车吧。
   迷迷糊糊的听见售票员姐姐喊“中关村的”,赶快下车一看这哪是中关村啊,四处一看,遥远的前方好像是
新建的那个弧型的楼,只好靠脚了。。。。嗯,终于看见仰慕已久的海龙。可能是太早了,头一次
看见中关村人这么少。
   上了天桥,一位长得很恶心的大娘就一直向我笑,“A片要不要?vcd,dvd?”,我心想,真敬业!要不是最近A片
看不多了一定捧个场。下了天桥,感觉怎么这么冷清,哦原来好多站牌都拆了,等了好久也见车心想不会共车也“拆了”
不从这走了吧,终于看见可爱的特4,虽然是2块钱,认了吧,大早晨的人家开车的也不容易。上了车心里踏实了,
安全了。
   到了家都8点多了,去楼下的铺子到了碗稀饭,又是一位很实在的姐姐端了个碗过来,“你的粥”,往桌上一放,
我一看姐姐大拇指还“粥”里泡这呢,这哪是粥啊?算了反正我要的也是稀饭,姐姐的手也挺"干净"的。
   用最块的速度喝完“粥”,冲进门,同室哥们问我怎么没考试,说了没带准考证,他们一通打击,早就做好心理准备,没往心里去。
小蒋起来了,把他被子和我被子都压在身上,真暖和,接着睡!
   这大早晨的,在半个北京就转了一圈,丫的。

7-364 Coconuts, Revisited 分数 10 作者 伍健全 单位 重庆科技大学 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? 输入格式: 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 Expected Output. There may be no solution for some of the input cases; if so, state that observation. 输入样例: 在这里给出一组输入。例如: 25 30 3121 -1 输出样例: 在这里给出相应的输出。例如: 25 coconuts, 3 persons and 1 monkey 30 coconuts, no solution 3121 coconuts, 5 persons and 1 monkey 代码长度限制 16 KB 时间限制 400 ms 内存限制 64 MB 栈限制 8192 KB C (gcc) 1 c语言
最新发布
11-14
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

kingapex1

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值