POJ1316 Self Numbers【水题】
来源:互联网 发布:现在开淘宝店赚钱吗 编辑:程序博客网 时间:2024/06/07 21:06
Self Numbers
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24481 Accepted: 13690
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
Mid-Central USA 1998
问题链接:POJ1316 Self Numbers
问题简述:(略)
问题分析:
这个问题的关键是设计一个标记数组,是与不是用逻辑真假区分开,根据标记输出就可以了。需要注意的是有可能重复标记,另外标记时下标有可能越界,需要加以限定。
程序说明: 这个题与参考链接的题是同一问题,只是输出范围不同,程序常量N改一下就好。
题记:
共同的功能封装到函数,想快的话加上修饰inline就可以了。
参考链接:HDU1128 UVA640 UVALive5326 ZOJ1180 Self Numbers【水题】
/* POJ1316 Self Numbers */#include <iostream>#include <string.h>#include <stdio.h>using namespace std;const int BASE = 10;const int N = 10000;bool flag[N + 1];inline int getsumdigit(int n){ int sum = 0; while(n) { sum += n % BASE; n /= BASE; } return sum;}int main(){ int k; memset(flag, false, sizeof(flag)); for(int i=1; i<=N; i++) { k = i + getsumdigit(i); if(k <= N) flag[k] = true; if(!flag[i]) printf("%d\n", i); } return 0;}
阅读全文
0 0
- POJ1316 Self Numbers【水题】
- POJ1316 Self Numbers
- poj1316--Self Numbers
- poj1316 Self Numbers
- POJ1316 Self Numbers
- POJ1316 Self Numbers
- 寻找特别的数字poj1316-Self Numbers
- POJ1316 Self Numbers——筛素数的思想
- poj1316 self number
- POJ1316-Self number
- Poj 1316 Self Numbers(水题)
- Self Numbers - POJ 1316 水题
- [1316]Self Numbers (水题)POJ
- poj1316
- poj1316
- poj1316
- POJ1316
- poj1316
- 方法二
- java中日期使用毫秒值注意问题
- Html5 canvas学习2-圆 贝塞尔曲线
- Kafka简介、基本原理、执行流程与使用场景
- 【转】23种设计模式之单例模式
- POJ1316 Self Numbers【水题】
- drawableLayout=侧滑
- 关于Python中的import(一)
- 几个连接HiveServer的客户端界面工具
- faster rcnn报错:TypeError: slice indices must be integers or None or have an __index__ method
- 禁用 Python GC,Instagram 性能提升10%
- Android蓝牙开发与蓝牙模块进行通讯(基于eclipse)
- 属性动画
- PostgreSQL学习手册(表的继承和分区)