易企秀 旗下 网站建设,个人简历空白表可编辑,网站兼容手机浏览器,网站开发 图片库本文主要向大家介绍了C/C知识点之Self Numbers C语言 UVA640#xff0c;通过具体的内容向大家展示#xff0c;希望对大家学习C/C知识点有所帮助。In 1949 the Indian mathematician D.R. Kaprekar discovered a class ofnumbers called self-numbers. For any positive integ…本文主要向大家介绍了C/C知识点之Self Numbers C语言 UVA640通过具体的内容向大家展示希望对大家学习C/C知识点有所帮助。In 1949 the Indian mathematician D.R. Kaprekar discovered a class ofnumbers called self-numbers. For any positive integer n, define d(n) tobe n plus the sum of the digits of n. (The d stands for digitadition, aterm coined by Kaprekar.) For example, d(75) 75 7 5 87. Givenany positive integer n as a starting point, you can construct theinfinite 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 yougenerate the sequence33, 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, 33is 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, 101has two generators, 91 and 100. A number with no generators is aself-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 Output135792031425364|| |9903991499259927993899499960997199829993用离线计算的方法计算出1000000以内的所有非自我数将这些数筛掉后再从小到大按序输出。1 //UVA 6402 #include 34 int a[1000001];56 int main(void){7 int i,b,c;8 for(i0;i1000000;i){9 bi;ci;10 while(c){11 bc%10;12 c/10;13 }14 a[b]1;15 }16 for(i1;i1000000;i)17 if (!a[i]) printf(%d\n,i);18 return 0;19 }View Code本文由职坐标整理并发布希望对同学们有所帮助。了解更多详情请关注职坐标编程语言C/C频道
