HDUoj-------(1128)Self Numbers
Self Numbers
Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6227 Accepted Submission(s): 2728
Problem Description
In 1949 the Indian mathematician D.R. Kaprekar discovered a class of numbers called self-numbers. For any positive integer n, define d(n) to be n plus the sum of the digits of n. (The d stands for digitadition, a term coined by Kaprekar.) For example, d(75) = 75 + 7 + 5 = 87. Given any positive integer n as a starting point, you can construct the infinite increasing sequence of integers n, d(n), d(d(n)), d(d(d(n))), .... For example, if you start with 33, the next number is 33 + 3 + 3 = 39, the next is 39 + 3 + 9 = 51, the next is 51 + 5 + 1 = 57, and so you generate the sequence 33, 39, 51, 57, 69, 84, 96, 111, 114, 120, 123, 129, 141, ... The number n is called a generator of d(n). In the sequence above, 33 is a generator of 39, 39 is a generator of 51, 51 is a generator of 57, and so on. Some numbers have more than one generator: for example, 101 has two generators, 91 and 100. A number with no generators is a self-number. There are thirteen self-numbers less than 100: 1, 3, 5, 7, 9, 20, 31, 42, 53, 64, 75, 86, and 97. Write a program to output all positive self-numbers less than or equal 1000000 in increasing order, one per line.
Sample Output
1
3
5
7
9
20
31
42
53
64
|
|
<-- a lot more numbers
|
9903
9914
9925
9927
9938 9949 9960 9971 9982 9993 | | |
Source
尼玛,太简单了,之间就水过去了.....
代码:
1 #include<cstdio>
2 #include<cstring>
3 #define maxn 1000001
4 /*求个位数之和*/
5 int work(int n)
6 {
7 int sum=0;
8 while(n>0){
9 sum+=n%10;
10 n/=10;
11 }
12 return sum;
13 }
14 bool ans[maxn];
15 int main(){
16 int pos;
17 //freopen("test.out","w",stdout);
18 memset(ans,0,sizeof(ans));
19 for(int i=1;i<maxn;i++){
20 pos=i+work(i);
21 if(pos<=1000000&&!ans[pos]) ans[pos]=1;
22 }
23 for(int i=1;i<maxn;i++){
24 if(!ans[i])printf("%dn",i);
25 }
26 return 0;
27 }
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法
- Angular module加载的原理研究
- NullInjectorError No provider for EffectsRootModule!
- Web 中文字体性能优化实践
- Java反射到底慢在哪?不看后悔
- win10 edge 打开闪退问题
- dotnet Open XML 如何判断一份 Office 文档是否被加密
- 【项目实战】ETL 数据导入
- asp dotnet core 记一次应用拒绝响应调试 开启线程等待同步用光线程池
- 使用 EasyPOI 优雅导出Excel模板数据(含图片)
- 不用一行代码,用 API 操作数据库,你信吗
- 实战 | PyQt5制作雪球网股票数据爬虫工具
- 数据结构:图文详解 - 动态查找、静态查找、散列查找
- 关于tf.train.ExponentialMovingAverage使用的详细解析
- 【课后作业】Azkaban 自动化调度
- 【项目实战】Azkaban 自动化调度