CodeForces 460B
Little Dima and Equation
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 460BDescription
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:
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 Input
Input3 2 8Output
3Input
10 2008 13726
1 2 -18Output
0Input
2 2 -1Output
4
1 31 337 967
枚举s(x),最大为81
//2016.8.2 #include <iostream> #include <cstdio> #include <vector> using namespace std; int S(int x) { int ans = 0; while(x) { ans += x%10; x /= 10; } return ans; } long long pow(int a, int b) { long long ans = 1; while(b--) { ans *= a; } return ans; } int main() { int a, b, c; long long x; while(scanf("%d%d%d", &a, &b, &c)!=EOF) { vector<long long> v; for(int i = 1; i <= 81; i++) { x = b*pow(i, a)+c; if(x >= 1000000000 || x < 0)continue; if(S(x)==i)v.push_back(x); } cout << v.size()<<endl; if(!v.empty()) for(vector<long long>::iterator it = v.begin(); it != v.end(); it++) if(it == v.begin())cout<<*it; else cout << " " << *it; cout << endl; } return 0; }
- CodeForces - 460B (暴力)
- [Codeforces] 460B - Little Dima and Equation
- Codeforces 280C Game on Tree 概率dp 树上随机删子树 求删完次数的期望
- Codeforces 542F 构造
- Codeforces 78C Beaver Game(数论、博弈)
- codeforces 397div2 D Artsem and Saunders
- codeforces 788A Functions again(dp之最大子段和)【模板】
- Codeforces-898D:Alarm Clock(双端队列)
- codeforces 492D Vanya and Computer Game(额。。。数学题?水题吧)
- CodeForces 577B 模和vecto
- codeforces 276E. Little Girl and Problem on Trees (线段树)
- Vacations -CodeForces-698A
- Codeforces 626E Simple Skewness(三分)
- codeforces724G - Xor-matic Number of the Graph
- Codeforces 6A. Triangle
- 【Codeforces 282E】Sausage Maximization 中文题意&题解&代码(C++)
- CodeForces 366C Dima and Salad
- Codeforces 339D Xenia and Bit Operations 线段树
- CodeForces 363C Fixing Typos
- Codeforces 538 A Cutting Banner