A8223 | Sum of Digits
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Having watched the last Harry Potter film, little Gerald also decided to practice magic. He found in his father's magical book a spell that turns any number in the sum of its digits. At the moment Gerald learned that, he came across a number $n$ . How many times can Gerald put a spell on it until the number becomes one-digit?
输入格式
The first line contains the only integer $n$ ( $0<=n<=10^{100000}$ ). It is guaranteed that $n$ doesn't contain any leading zeroes.
输出格式
Print the number of times a number can be replaced by the sum of its digits until it only contains one digit.
输入输出样例
输入 #1
0
输出 #1
0
输入 #2
10
输出 #2
1
输入 #3
991
输出 #3
3
In the first sample the number already is one-digit — Herald can't cast a spell.
The second test contains number $10$ . After one casting of a spell it becomes $1$ , and here the process is completed. Thus, Gerald can only cast the spell once.
The third test contains number $991$ . As one casts a spell the following transformations take place: $991→19→10→1$ . After three transformations the number becomes one-digit.
The second test contains number $10$ . After one casting of a spell it becomes $1$ , and here the process is completed. Thus, Gerald can only cast the spell once.
The third test contains number $991$ . As one casts a spell the following transformations take place: $991→19→10→1$ . After three transformations the number becomes one-digit.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted