codeforces——875A —— Classroom Watch

A. 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.
주어진 숫자가 그 자체와 각 위치의 값으로 구할 수 있는지, 가능한 모든 상황을 출력할 수 있는지...
폭력, 입력당 최대 100개 상황, 직접 누적(n-100, n)

#include 
#include 
#include 
#include 
#include 
#include