当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1352:Quantity of White Mice

题目描述
There is a species of white mouse to be used in experiments. The mice keep alive only n months after their birth (9 < n < 13, n is natural number, the month to be calculated from the mice's birth, for example, the mice born in Jan have been existed 4 months in Apr.). They begin giving birth to new mice from the 7-th month. In the period of the 7-th and 8-th months every pair of the parent mice give birth to one pair of mice. From the 9-th month in a period of m months (0 < m < 3, m is natural number) every pair of the parent mice give birth to two pairs of mice. Thereafter, they stop giving birth and live to the end of their life; they die at the beginning of n+1-th month. (The n+1-th month doesn't be calculated as exist time of the mice), and the died mice will be took out from this lab. In each month, the number of living mice from previous month is countered first. If the number of the living mice from the previous month is less than or equal to 100 pairs, the new born mice of this month will stay in this lab, if the number of living mice exceeds 100 pairs, the new born mice of this month will be moved to another laboratory. Let there be only one pair of newborn mice at the beginning. How many pairs of mice in the k-th month in this lab (0 < k < 37, k is a natural number)?
输入解释
On every line, a group of data is given. In each group there are three natural number n,m,k, separated by commas. After all data are given there is -1 as the symbol of termination.
输出解释
Find the number of white mice according to the input data in each group. One line is for every output. Its fore part is a repetition of the input data and then it follows a colon and a space. The last part of it is the computed number of the white mice.
输入样例
10,1,6
10,1,7
10,1,9
10,1,10
10,1,11
-1
输出样例
10,1,6: 1
10,1,7: 2
10,1,9: 5
10,1,10: 5
10,1,11: 4

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 Xi'an 2002

源链接: POJ-1352

最后修改于 2020-10-29T06:01:48+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 10000