Codeforces Round #262 (Div. 2) B. Little Dima and Equation

B. Little Dima and Equation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 < 10⁹) of the equation:

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

where a, b,c are some predetermined constant values and functions(x) determines the sum of all digits in the decimal representation of numberx.

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 printn integers in the increasing order — the solutions of the given equation. Print only integer solutions that are larger than zero and strictly less than10⁹.

Sample test(s)

Input

3 2 8

Output

310 2008 13726 

Input

1 2 -18

Output

0

Input

2 2 -1

Output

41 31 337 967 

数学问题，找感觉

#include <iostream>#include <stdio.h>#include <string.h>#include <stdlib.h>#include <math.h>#include <ctype.h>#include <algorithm>#include <queue>using namespace std;#define LL __int64LL aa[100];int main(){    LL n, a, b, c, ans=0, i, y, zz, j;    LL x, z;    scanf("%I64d%I64d%I64d",&a,&b,&c);    for(i=1;i<=81;i++)    {        zz=1;        for(j=1;j<=a;j++)            zz*=i;        x=zz*b+c;        y=0;        z=x;        while(z)        {            y+=z%10;            z/=10;        }        if(y==i&&x>=1&&x<1e9)        {            aa[ans++]=x;        }    }    printf("%I64d\n",ans);    for(i=0;i<ans;i++)    {        printf("%I64d ",aa[i]);    }    return 0;}