实例（java)

1． 编写一个程序，列出1 到1000 以内的，求59 的余后为1 质数。

2． 试编写程序解下面的问题。猴子吃桃问题：猴子第一天摘下若干个桃子，当即吃了

一半，还不瘾，又多吃了一个 第二天早上又将剩下的桃子吃掉一半，又多吃了一个。

以后每天早上都吃了前一天剩下的一半零一个。到第10 天早上想再吃时，见只剩

下一个桃子了。求第一天共摘了多少。

3． 编写一个程序求1+2!+3!+...+20!的和。

4． 试编写程序求解下面的问题：海滩上有一堆桃子，五只猴子来分。第一只猴子把这堆桃子凭据分为五份，多了一个，这只猴子把多的一个扔入海中，拿走了一份。第二只猴子把剩下的桃子又平均分成五份，又多了一个，它同样把多的一个扔入海中，

拿走了一份，第三、第四、第五只猴子都是这样做的，问海滩上原来最少有多少个桃子？（请列举出1000000 以内的最小总数）

-Example (java) 1. Preparation of a procedure set out within 1-1000, I seek 59 after a prime number. 2. Test preparation procedures solution to the problem below. The monkeys eat peaches : monkeys became the first several days of peaches, a half-eaten immediately, not addiction, Also eat a morning of the second day will eat the remaining peach half, eat one. The morning after the day before telling the remaining half of a zero. Article 10 days served, when the morning to see only one of the peach. For the first days of the number of extraction. 3. Process for the preparation of a 1 2! Three! ... 20! And. 4. Test preparation procedures to solve the following problems : on the beach with a pile of peaches, five minutes to monkeys. First monkeys peaches evidence of this reactor were divided in