Codeforces #262 (Div. 2) B. Little Dima and Equation（数学：简单）

最新推荐文章于 2016-08-03 07:59:11 发布

原创最新推荐文章于 2016-08-03 07:59:11 发布 · 456 阅读

0 ·

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

收录于

数学／数论

本文提供了一种方法来解决一个复杂的数学问题，即在给定的参数下找到所有满足特定等式的整数解。通过直接枚举的方法，作者详细解释了如何在限制条件下找到解，并提供了实现此过程的代码示例。

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 

乍一看可能会觉得很难，其实直接枚举即可

因为限定了x < 109.

所以可知s(x)的范围

枚举判断即可

中间数据b*s(x)^a+c可能会爆int，所以要用long long

代码如下：

#include <bits/stdc++.h>
#define LL long long
#define MOD 1000000000
using namespace std;

vector<LL> vec;

LL pows(LL ans, LL a) {
    LL tmp = ans;
    for(int i=1; i<a; ++i)
        ans *= tmp;
    return ans;
}

int get(LL tmp) {
    int ans = 0ll;
    while(tmp) {
        ans += tmp%10;
        tmp /= 10;
    }
    return ans;
}

int main(void) {
    LL a, b, c, cnt, tmp;
    cin >> a >> b >> c;
    tmp = cnt = 0ll;
    vec.clear();
    for(int i=1; i<=90; ++i) {
        tmp = pows(i, a)*b+c;
        if(tmp >= MOD)
            break;
        else if(tmp <= 0)
            continue;
        else if(get(tmp) == i) {
            vec.push_back(tmp);
            cnt++;
        }
    }
    cout << cnt << endl;
    for(int i=0; i<cnt; ++i)
        cout << vec[i] << " ";
    puts("");

    return 0;
}