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 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
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.
Examples
Input
3 2 8
Output
3 10 2008 13726
Input
1 2 -18
Output
0
Input
2 2 -1
Output
4 1 31 337 967
s(x)表示x的每个位数的和
#include <bits/stdc++.h>
using namespace std;
long long ksm(long long a, long long b) {
long long ans = 1, base = a;
while(b != 0) {
if(b & 1 != 0) {
ans *= base;
}
base *= base;
b >>= 1;
}
return ans;
}
int cou(int x) //计算s(x)
{
int res = 0;
while(x > 0){
res += x % 10;
x /= 10;
}
return res;
}
int main()
{
vector<int> v;
int a,b,c,cnt = 0;
cin >> a >> b >> c;
for(int i = 1;i <= 81; i++)
{
long long result = ksm(i,a)*b + c;
if(result > 1e9 || result < 0) continue;
else{
if(i == cou(result)){
v.push_back(result);
}
}
}
if(v.size() == 0) cout << 0;
else{
cout << v.size() << "\n";
for(int i = 0;i < v.size(); i++){
if(i) cout << " ";
cout << v[i];
}
}
return 0;
}