A. Reachable Numbers（C语言）

Let’s denote a function f(x) in such a way: we add 1 to x, then, while there is at least one trailing zero in the resulting number, we remove that zero. For example,

f(599)=6: 599+1=600→60→6;
f(7)=8: 7+1=8;
f(9)=1: 9+1=10→1;
f(10099)=101: 10099+1=10100→1010→101.
We say that some number y is reachable from x if we can apply function f to x some (possibly zero) times so that we get y as a result. For example, 102 is reachable from 10098 because f(f(f(10098)))=f(f(10099))=f(101)=102; and any number is reachable from itself.

You are given a number n; your task is to count how many different numbers are reachable from n.

Input
The first line contains one integer n (1≤n≤109).

Output
Print one integer: the number of different numbers that are reachable from n.

Examples
Input
1098
Output
20
Input
10
Output
19
Note
The numbers that are reachable from 1098 are:

1,2,3,4,5,6,7,8,9,11,12,13,14,15,16,17,18,19,1098,1099.
思路：先用定义一函数实现加以删0的操作，再找数学规律。
本题输入的n小于十则次数都是9，而大于9的话就将大于等于十的次数加9结果为最终次数。

#include<stdio.h>
int main()
{
	long long hanshu(long long x);
	long long n,cnt = 0,x;
	scanf_s("%lld", &n);
	x = n;
	while (n >= 10)
	{
		n=hanshu(n);
		cnt++;
	}
	cnt += 9;
	if (x >= 10)
		printf("%lld\n", cnt);
	else printf("9\n");
	return 0;
}
long long hanshu(long long x)
{
	x += 1;
	while (1)
	{
		if (x % 10 == 0)
			x = x / 10;
		else
			break;
	}
	return x;
}