Snowflake Snow Snowflakes POJ - 3349 Hash

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=1200010;
const int MOD=1200007;
int HashTable[maxn];
int cur=0;
struct Node{
    int num[7];
    int next;
}node[MOD+10];

unsigned  getHash(int*num){
    unsigned  sum=0;
    for(int i=0;i<6;i++)
        sum=(sum+num[i])%MOD;
    return sum%MODhttps:
}
void insertHash(int*num,unsigned key){
    for(int i=0;i<6;i++)node[cur].num[i]=num[i];
    node[cur].next=HashTable[key];
    HashTable[key]=cur;
    cur++;
}
bool cmp(int*num1,int*num2){
    for(int i=0;i<6;i++){
        if(num1[i]!=num2[i])return 0;
    }
    return 1;
}
bool searchHash(int*num){
      unsigned key=getHash(num);
      int next=HashTable[key];
      while(next!=-1){
          if(cmp(num,node[next].num))return 1;
          next=node[next].next;
      }
      //insertHash(num,key);//不能边查边插,否则会自己匹配自己
      return 0;
}
int main(){
    int n;
    int num[2][300];
    bool flag=0;
    cur=0;
    memset(HashTable,-1,sizeof(HashTable));
    scanf("%d",&n);
    while(n--){
        for(int i=0;i<6;i++){
            scanf("%d",&num[0][i]);
            num[0][i+6]=num[0][i];
        }
        if(flag)continue;
        for(int i=0;i<6;i++){
            num[1][i+6]=num[1][i]=num[0][5-i];
        }
        for(int i=0;i<6;i++){
            if(searchHash(num[0]+i)||searchHash(num[1]+i)){
                flag=1;
            //    cout<<111<<endl;
                break;
            }
        }
        for(int i=0;i<6;i++){//这里改成了之后插入  
            insertHash(num[0]+i,getHash(num[0]+i));
                insertHash(num[1]+i,getHash(num[1]+i));
        }
    }
    if(flag)printf("Twin snowflakes found.\n");
    else printf("No two snowflakes are alike.\n");

    return 0;
}