# Little Dima and Equation

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

### Description

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 < x < 109) of the equation:

x = b·s(x)a + c,

where abc 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: abc. Dima got sick of getting bad marks and he asks you to help him solve this challenging problem.

### Input

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

### Output

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

Input

`3 2 8`

Output

`310 2008 13726 `

Input

`1 2 -18`

Output

`0`

Input

`2 2 -1`

Output

```41 31 337 967

``` 1 //2016.8.2
2 #include <iostream>
3 #include <cstdio>
4 #include <vector>
5
6 using namespace std;
7
8 int S(int x)
9 {
10     int ans = 0;
11     while(x)
12     {
13         ans += x%10;
14         x /= 10;
15     }
16     return ans;
17 }
18
19 long long pow(int a, int b)
20 {
21     long long ans = 1;
22     while(b--)
23     {
24         ans *= a;
25     }
26     return ans;
27 }
28
29 int main()
30 {
31     int a, b, c;
32     long long x;
33     while(scanf("%d%d%d", &a, &b, &c)!=EOF)
34     {
35         vector<long long> v;
36         for(int i = 1; i <= 81; i++)
37         {
38             x = b*pow(i, a)+c;
39             if(x >= 1000000000 || x < 0)continue;
40             if(S(x)==i)v.push_back(x);
41         }
42         cout << v.size()<<endl;
43         if(!v.empty())
44             for(vector<long long>::iterator it = v.begin(); it != v.end(); it++)
45                 if(it == v.begin())cout<<*it;
46                 else cout << " " << *it;
47           cout << endl;
48     }
49     return 0;
50 }```

## Codeforces Round #262 (Div. 2) (460A 460B 460C 460D)

460A Vasya and Socks 题意:n个物品每天用一个  m天得一个  问  最多连续用几天 思路: 没思路-  就是暴力- 代码: #include<cstdio> #include<iostream> #include<string> #include<cstring> #include<algorithm> #include<cmath> #include<map> #include<set>

## Codeforces 841D Leha and another game about graph - 差分

Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges. Graph can contain multiple edges, but can not contain self loops. Each vertex has an integer di, which can be equal to 0, 1 or  - 1. To pass th

## Codeforces 772A Voltage Keepsake - 二分答案

You have n devices that you want to use simultaneously. The i-th device uses ai units of power per second. This usage is continuous. That is, in λ seconds, the device will use λ·ai units of power. The i-th device currently has bi units of power store

## Codeforces Round #408 (Div. 2) B

Description Zane the wizard is going to perform a magic show shuffling the cups. There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the table at the position x?=?i. The probl