Self Numbers
来源:互联网 发布:数据库查找 编辑:程序博客网 时间:2024/05/17 06:19
Self Numbers
Time Limit: 1000MS
Memory Limit: 10000KTotal Submissions: 22335
Accepted: 12567
Memory Limit: 10000KTotal Submissions: 22335
Accepted: 12567
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.
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.
Input
No input for this problem.
Output
Write a program to output all positive self-numbers less than 10000 in increasing order, one per line.
Sample Input
Sample Output
135792031425364 | | <-- a lot more numbers |9903991499259927993899499960997199829993
Source
0 0
- Self Numbers
- Self Numbers
- Self Numbers
- Self Numbers
- zoj1180 Self Numbers
- POJ 1316 Self Numbers
- fjnu 1884 Self Numbers
- ACM题-Self Numbers
- pku 1316 Self Numbers
- zoj 1180 Self Numbers
- POJ 1316 Self Numbers
- hdu 1128 Self Numbers
- 0377---Self Numbers
- POJ1316 Self Numbers
- zoj 1180 Self Numbers
- poj 1316 Self Numbers
- POJ 1316 Self Numbers
- HDU 1128 self numbers
- 欢迎使用CSDN-markdown编辑器
- Effective C++——条款49(第8章)
- 第四周--项目二--建立“单链表”算法库
- 第四周项目1-建立单链表
- 获取app版本信息
- Self Numbers
- 顺序表的基本运算。
- Framework中的连接管理机制(原)
- 第三周 项目2 建设“顺序表”算法库
- Bitmap与Drawable相互转化
- Java面试宝典
- C++语言中函数参数传递的三种方式
- 项目3 -- 单链表的应用(1)
- Tomcat无法访问,404错误