Codeforces Round #262 (Div. 2) B
来源:互联网 发布:浪潮软件利好消息 编辑:程序博客网 时间:2024/06/05 20:17
题目:
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 <cstdio>#include <cmath>#include <algorithm>#include <cstring>#include <iostream>using namespace std;int d[100000];int main(){ int a,b,c,sum,cou; long long temp,flag; while(cin>>a>>b>>c) { memset(d,0,sizeof(d)); cou=0; for(int i=1;i<=81;i++) { sum=0; temp=1; for(int j=0;j<a;j++) { temp*=i; } temp=b*temp; temp=c+temp; //printf("%d ",temp); flag=temp; while(temp) { sum+=temp%10; temp/=10; } if(sum==i&&flag>0&&flag<(1e9)) d[cou++]=flag; } if(cou==0) printf("0\n"); else { printf("%d\n%d",cou,d[0]); for(int i=1;i<cou;i++) { printf(" %d",d[i]); } printf("\n"); }}}
- Codeforces Round #262 (Div. 2) B
- Codeforces Round #262 (Div. 2) B
- Codeforces Round #262 (Div. 2)B. Little Dima and Equation
- Codeforces Round #262 (Div. 2) A,B,C
- Codeforces Round #262 (Div. 2)-A,B,C,D
- Codeforces Round #262 (Div. 2) B. Little Dima and Equation
- Codeforces Round #262 (Div. 2) B. Little Dima and Equation
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Codeforces Round #173 (Div. 2) Problem B
- Codeforces Round #181 (Div. 2) B. Coach
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #171 (Div. 2) B
- Codeforces Round #169 (Div. 2) B题
- Codeforces Round #188 (Div. 2) B题
- Codeforces Round #192 (Div. 2) B
- Codeforces Round #203 (Div. 2) B. Resort
- Android系统onKeyDown监控/拦截/监听/屏蔽返回键、菜单键和Home键
- javascript node element
- SQL2008 数据库根据事物日志的还原
- 为什么我写的文章没了?
- HDU 4970 Killing Monsters 离线 差分
- Codeforces Round #262 (Div. 2) B
- 如何解决Xcode5上传应用时找不到图标的问题。
- 用KMP来求字符串的循环节
- 校验中文长度和英文长度
- EL表达式
- QImage类
- 2014-08-21 09:14:00
- mysql maser-slave
- svn 下载东西