Self Numbers
来源:互联网 发布:android开发入门软件 编辑:程序博客网 时间:2024/05/16 17:28
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 Output
135792031425364 | | <-- a lot more numbers |9903991499259927993899499960997199829993#include <iostream>using namespace std;int a[10100];int p(int n){ int t;t=n; while(n!=0) { t+=n%10; n=n/10; } return t;}int main(){int i,j;memset(a,0,sizeof(a));for(i=1;i<10000;i++){j=p(i);a[j]=1;}for(i=1;i<10000;i++)if(a[i]!=1)cout<<i<<endl;return 0;}筛选法
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
- redis-cli 命令总结
- CSS动画属性性能
- 基于JSP实现数据库中图片的存储与显示(已经通过测试)
- DPC2.0使用说明
- 会几百年
- Self Numbers
- Windows内核函数的命名
- VS2010/MFC 入门编程十一(颜色对话框的运用)
- RSA加密和解密
- senchatouch在模拟器中正常在浏览器中异常的解决方法
- win7创建虚拟无线网络
- 电池容量足够低如何触发自动关机
- 为什么需要将继承层次中类的析构函数定义成virtual的?
- COM 接口 Interface