Reachable Numbers

题目描述

 

输入

The first line contains one integer n (1≤ n ≤ 10^9) . 

 

输出

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

 

样例输入

1098

样例输出

20

提示

多实例测试

 代码：

#include<iostream> #include<stdio.h> #include<string.h> #include<string> #include<algorithm> #include<queue> #include<math.h> #include<set> using namespace std; #define INF 1e9 typedef long long ll; #define PI acos(-1) int a[10]; int main() { ll n,ans; while(~scanf("%lld",&n)) { memset(a,0,sizeof(a)); ans=1; if(n <10) printf("9\n"); else { while(1) { n++; while(n == 0) n/=10; if(n < 10 && a[n] == 1) break; else { if(n < 10) a[n] = 1; ans++; } } printf("%lld\n",ans); } } return 0; }