【Codeforces Round 262 (Div 2)B】【暴力枚举】Little Dima and Equation b乘数位之和的a次方+c=数字
来源:互联网 发布:旋转轮胎修改数据损伤 编辑:程序博客网 时间:2024/06/05 10:59
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.
The first line contains three space-separated integers: a, b, c (1 ≤ a ≤ 5; 1 ≤ b ≤ 10000; - 10000 ≤ c ≤ 10000).
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.
3 2 8
310 2008 13726
1 2 -18
0
2 2 -1
41 31 337 967
#include<stdio.h>#include<iostream>#include<string.h>#include<string>#include<ctype.h>#include<math.h>#include<set>#include<map>#include<vector>#include<queue>#include<bitset>#include<algorithm>#include<time.h>using namespace std;void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(x,y,sizeof(x))#define MP(x,y) make_pair(x,y)#define ls o<<1#define rs o<<1|1typedef long long LL;typedef unsigned long long UL;typedef unsigned int UI;template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }const int N = 0, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;int a, b, c;LL mul(int x, int p){LL y = 1;while (p--)y = y*x;return y;}int d[100];void solve(){int ans = 0;for (int i = 1; i <= 81; ++i){LL x = b*mul(i, a) + c;if (x <= 0 || x >= 1e9)continue;int y = x;int sum = 0;while (x){sum += x % 10;x /= 10;}if (sum == i)d[++ans] = y;}sort(d + 1, d + ans + 1);printf("%d\n", ans);for (int i = 1; i <= ans; ++i)printf("%d ", d[i]);puts("");}int main(){while (~scanf("%d%d%d", &a,&b,&c)){solve();}return 0;}/*【trick&&吐槽】枚举范围比较小的参量是很好的思想,比如位数。*/
- 【Codeforces Round 262 (Div 2)B】【暴力枚举】Little Dima and Equation b乘数位之和的a次方+c=数字
- Codeforces Round #262 (Div. 2)B. Little Dima and Equation
- Codeforces Round #262 (Div. 2) B. Little Dima and Equation
- Codeforces Round #262 (Div. 2) B. Little Dima and Equation
- Codeforces Round #262 (Div. 2) 460B. Little Dima and Equation(枚举)
- Codeforces Round #262(div2) B. Little Dima and Equation
- Codeforces 460B Little Dima and Equation(暴力)
- Codeforces 460B Little Dima and Equation【思维+暴力】
- Codeforces #262 (Div. 2) B. Little Dima and Equation(数学:简单)
- codeforces-#460B Little Dima and Equation
- [Codeforces] 460B - Little Dima and Equation
- Codeforces 460B Little Dima and Equation
- Codeforces Round #243 (Div. 2) A,B,C(暴力枚举)
- 【Codeforces Round 272 (Div 2)C】【暴力】Dreamoon and Sums 所有除b结果是模b结果[1,a]倍数字之和
- codeforces #262 DIV2 B题 Little Dima and Equation
- B. Little Dima and Equation
- B. Little Dima and Equation
- B. Little Dima and Equation
- 【CROC 2016 - Elimination RoundE】【DP】Intellectual Inquiry 长度为m字符串后添加n位最大本质不同子串个数
- 【gdx ashley】入门
- 射线与长方体
- 【Codeforces Round 262 (Div 2)A】【水题】Vasya and Socks 妈妈买袜子 最多穿几天
- 使用XLSTransformer生成报表的步骤和流程
- 【Codeforces Round 262 (Div 2)B】【暴力枚举】Little Dima and Equation b乘数位之和的a次方+c=数字
- 第一次使用Markdown在线编译器写博客
- nyoj--284 坦克大战(bfs+优先队列)
- 【Codeforces Round 262 (Div 2)C】【二分】浇花使得最小的尽可能大
- POJ 1010 题目翻译+题解
- 【Codeforces Round 262 (Div 2)D】【构造】Little Victor and Set 集合最多取k数使得异或值尽可能小
- 【Codeforces Round 262 (Div 2)E】【爆搜 估价函数剪枝 搜索步长剪枝】Roland and Rose 整格放点 点对欧几里得距离平方和尽可能大
- Activity的最佳实践
- JQuery对HTML进行操作