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

最新推荐文章于 2021-05-07 12:58:27 发布

原创最新推荐文章于 2021-05-07 12:58:27 发布 · 1.9k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#algorithm

Codeforces 专栏收录该内容

61 篇文章

订阅专栏

本文介绍了一个数学挑战问题：寻找特定方程的所有整数解。该方程涉及未知数x与其十进制表示中各数字之和s(x)的关系。文章提供了解决方案，并通过示例展示了如何使用编程技巧来枚举所有可能的解。

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.

Sample test(s)

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)，S(x)只可能从1到81，x就唯一对应，且单调增.
代码：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn=1100;
long long ans[maxn];
int main()
{
    int a,b,c;
    while(~scanf("%d%d%d",&a,&b,&c))
    {
        int k=0;
        for(int i=1;i<=100;i++)
        {
            long long temp,temc=1;
            for(int j=0;j<a;j++)
            temc=temc*i;
            temp=(long long)b*temc+c;
            if(temp>1000000000)
            continue;
            int ans2=temp;
            int mi=0;
            while(temp)
            {
                mi+=temp%10;
                temp=temp/10;
            }
            if(i==mi)
            {
                ans[k++]=ans2;
            }
        }
        printf("%d\n",k);
        if(k)
        {
            printf("%I64d",ans[0]);
        for(int j=1;j<k;j++)
        {
             printf(" %I64d",ans[j]);
        }
        printf("\n");
        }
    }
    return 0;
}