Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) C. Classroom Watch

C. Classroom Watch

Problem Statement

    Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the answer to the arithmetic task for first-graders. In the textbook, a certain positive integer x was given. The task was to add x to the sum of the digits of the number x written in decimal numeral system.
    Since the number n on the board was small, Vova quickly guessed which x could be in the textbook. Now he wants to get a program which will search for arbitrary values of the number n for all suitable values of x or determine that such x does not exist. Write such a program for Vova.

Input

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

Output

    In the first line print one integer k — number of different values of x satisfying the condition.
    In next k lines print these values in ascending order.

Examples

Example 1
    Input
        21
    Output
        1
        15
Example 2
    Input
        20
    Output
        0

Note

    In the first test case x = 15 there is only one variant: 15 + 1 + 5 = 21.
    In the second test case there are no such x.

题意

    给定一个n求出所有数字满足该数字和所有位数之和加上本身恰好等于n。

思路

    根据范围我们可以看到，小于等于$10^{10}$的数中，最大的各位数之和就是999999999，和为81，所以我们只要从max(n-81,0)开始扫到n就可以统计出个数了，因为大于n的数是不可能加上自身各位数还会变小的，我为了保险点就从max(n-100,0)开始了。

Code

#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline void readInt(int &x) {
    x=0;int f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    x*=f;
}
inline void readLong(ll &x) {
    x=0;int f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    x*=f;
}
/*================Header Template==============*/
int n;
set<int> s;
inline int get(int x) {
    int res=0;
    while(x) {
        res+=x%10;
        x/=10;
    }
    return res;
}
int main() {
    readInt(n);
    for(int i=max(n-100,0);i<=n;i++)
        if(i+get(i)==n)
            s.insert(i);
    printf("%d\n",s.size());
    if(s.size()) {
        for(set<int>::iterator it=s.begin();it!=s.end();it++)
            printf("%d ",*it);
        puts("");
    }
    return 0;
}