Reachable Numbers

最新推荐文章于 2021-10-02 22:38:13 发布

知思言乐

最新推荐文章于 2021-10-02 22:38:13 发布

阅读量320

点赞数

本文链接：https://blog.csdn.net/qq_41548486/article/details/90579501

版权

题目描述

输入

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

输出

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

样例输入

样例输出

提示

多实例测试

代码：

#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%10 == 0)
                    n/=10;
                if(n < 10 && a[n] == 1)
                    break;
                else
                {
                    if(n < 10)
                        a[n] = 1;
                    ans++;
                }
            }
            printf("%lld\n",ans);
        }
    }
    return 0;
}