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

地址：http://codeforces.com/contest/876/problem/C

题目：

C. Classroom Watch

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

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 ≤ 109).

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

input

21

output

1
15

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.

 

思路：

　　分析一下可以发现，x最多是9位数，所以x的每一位数字之和最大也就是100,。

　　所以直接从n向下枚举100多就可以了。

#include <bits/stdc++.h>

using namespace std;

#define MP make_pair
#define PB push_back
typedef long long LL;
typedef pair<int,int> PII;
const double eps=1e-8;
const double pi=acos(-1.0);
const int K=1e6+7;
const int mod=1e9+7;

int n;
vector<int>vc;
int main(void)
{
    cin>>n;
    for(int i=n;i>0&&i>n-200;i--)
    {
        int x=i,ls=1e9,sum=i;
        while(x)
            sum+=x/ls,x%=ls,ls/=10;
        if(sum==n)
            vc.PB(i);
    }
    printf("%d\n",vc.size());
    reverse(vc.begin(),vc.end());
    for(auto &x:vc)
        printf("%d ",x);
    return 0;
}