hdoj1128 Self Numbers//哈希

Self Numbers

Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9736    Accepted Submission(s): 4191

 

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

|

|

|

哈希(hash)：
 1. 以空间(hash空间,通常用数组来做)换取时间。
    把查找数据的关键字 转换为 hash空间的地址(数组下标)，
    该地址处的数据元素代表所查数据的某个属性。如素数筛选中的prime[]，本例中的hash[]都是哈希空间。

 2.在构造hash空间时，有时会把范围很大的空间 映射到 一个相对较小的空间， 以提升算法的效率。
   例: 关键字:18位身份证号码或11位的手机号 --> 最后的若干位 -->  10万以内

   在映射(把关键字转换为地址)时，通常要采用某个性能较好的函数来实现，这个函数叫散列函数。
   1)一个好的散列函数能够使映射后的地址值尽量平均分布。
   2)哈希算法中还有处理地址冲突的方法。
   3)还有双散列函数：在位置d冲突后，再次使用另一个散列函数产生一个与散列表桶容量m互质的数c，
     依次试探(d+n*c)%m，使探查序列跳跃式分布。

#include<stdio.h>
#include<string.h>
#define MAX 1000005
int hash[MAX+100]; //标记数组，hash空间, 打表

void fun(int n)
{
    int sum=n;
    while(n){
        sum +=n%10;
        n/=10;
    }
    hash[sum]=1;//非自私数-----哈希思想
}

int main()
{
    using namespace std;
    memset(hash,0,sizeof(hash));//假定所有的数都是自私数
    for(int i=1;i<MAX;i++)
        fun(i);

    for(int i=1;i<MAX;i++)
        if(!hash[i])
          printf("%d\n",i);

    return 0;

}