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

建议使用的浏览器：

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

2498：Digits

题目描述


A googol written out in decimal has 101 digits. A googolplex has one plus a googol digits. That's a lot of digits!

Given any number x0, define a sequence using the following recurrence:

xi+1 = the number of digits in the decimal representation of xi

Your task is to determine the smallest positive i such that xi = xi-1.
输入解释
Input consists of several lines. Each line contains a value of x0. Every value of x0 is non-negative and has no more than one million digits. The last line of input contains the word END.
输出解释
For each value of x0 given in the input, output one line containing the smallest positive i such that xi = xi-1.
输入样例 
42
END
输出样例 
3
来自杭电HDUOJ的附加信息
Recommend chenrui
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 University of Waterloo Local Contest 2009.09
源链接： HDU-2498
最后修改于 2020-10-25T22:54:03+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)