3089.Little Dima and Equation

Time Limit: 1s Memory Limit: 256MB

Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.

Find all integer solutions x (0 \lt x \lt 109) of the equation:
x=b \cdot s(x)a+c,
where a, b, c are some predetermined constant values and function s(x) determines the sum of all digits in the decimal representation of number x.

The teacher gives this problem to Dima for each lesson. He changes only the parameters of the equation: a, b, c. Dima got sick of getting bad marks and he asks you to help him solve this challenging problem.

Input Format(From the terminal/stdin)

The first line contains three space-separated integers: a,b,c (1 \le a \le 5;1 \le b \le 10000;-10000 \le c \le 10000).

Output Format(To the terminal/stdout)

Print integer n - the number of the solutions that you've found. Next print n integers in the increasing order - the solutions of the given equation. Print only integer solutions that are larger than zero and strictly less than 109.

Sample Input 1

Copy 
3 2 8
 · · \n

Sample Output 1

Copy 
3
10 2008 13726 
 \n
  ·    ·     \n

Sample Input 2

Copy 
1 2 -18
 · ·   \n

Sample Output 2

Copy 
0
 \n

Sample Input 3

Copy 
2 2 -1
 · ·  \n

Sample Output 3

Copy 
4
1 31 337 967 
 \n
 ·  ·   ·   \n

Submit

请先 登录
 Submit
题解(0)
© 2025 FAQs