1680--【USACO】Life Cycle

1680: 【USACO】Life Cycle

时间限制: 1.000 Sec  内存限制: 64 MB
提交: 24  解决: 14
[提交] [状态] [报告] [命题人:]


The cows are calculating the "life cycle" for each of their identification tag numbers. Take any positive integer N (1 <= N <= 9999), say 57, square all the digits and add them up: 5^2 + 7^2 to get 25 + 49 = 74. Now do the same procedure with the result 74 to get the next number in the sequence 65. Continuing to apply this procedure to a sequence of terms eventually repeats one number of the sequence. When starting with 57, the sequence repeats for the first time with 37, which is the next number in this part of the sequence: 57, 74, 65, 61, >From then on the sequence is trapped in a "life cycle": 37, 58, 89, 145, 42, 20, 4, 16, 37, . . . If we cube the digits instead of squaring them the sequence has a similar fate. Your job is to write a program that computes how long the sequence lasts until it falls into a life cycle given a starting positive integer and a power P (1 <= P <= 5).


A single line with two space-separated integers: N and P.


Length of the sequence until it enters a life cycle, not including the first number in the cycle.


输入  复制
57 2
输出  复制


ABOUT SAMPLE OUTPUT: [This corresponds to the sequence: 57, 74, 65, 61, 37, ...; 37 is the first number that is repeated.]