PAT 1078 Hashing

# include <stdio.h># include <algorithm># include <string.h># include <iostream># include <    Math.h>using namespace Std;int prime[10100];int vis[10110];int cot;void init_prime () {memset (vis,0,sizeof (VIS));    cot=0;            for (int i=2; i<=10100; i++) {if (!vis[i]) {prime[cot++]=i;        for (int j=i*2; j<=10100; j+=i) vis[j]=1;    }}}int Main () {int n,size1,i,a,ans,j;    int map[10100];        while (~SCANF ("%d%d", &size1,&n)) {init_prime ();        memset (map,0,sizeof (map));                for (i=0; i<cot; i++) {if (prime[i]>=size1) {size1=prime[i];            Break            }} for (i=0; i<n; i++) {scanf ("%d", &a);            Ans=a%size1;                if (!map[ans]) {if (i==0) printf ("%d", ans);    else printf ("%d", ans);            Map[ans]=1; } else/* two-time method of the formula: hi= (H (key) +i*i)%size1 1≤i≤size1-1/= Di=i2 that the probe sequence is d=h (key), d+1^2 , d+2^2,...d+ (size1-1) ^2*/{for (j=1; j<size1; J + +) {int kk= (                    ANS+J*J)%size1;                        if (!map[kk]) {map[kk]=1;                        if (i==0) printf ("%d", KK);                        else printf ("%d", KK);                    Break }} if (J==size1) {if (i==0) printf (                    "-");                else printf ("-");    }}} printf ("\ n"); } return 0;}

PAT 1078 Hashing