poj3349(数的哈希)

  处理方式有好多种，算和，平方和，与，或之类的，我自己算的是个简单的，算和。主要是处理冲突，然后判断是否会出现相同的，可以顺时针，也可能是逆时针的。 

  但是自己过的很耗时，估计应该是开辟空间之类的造成的，还得好好研究一下。

  

#include "stdio.h"
#include "string.h"
#include "math.h"
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
using namespace std;

#define MAXM 1
#define MAXN 1
#define max(a,b) a > b ? a : b
#define min(a,b) a < b ? a : b
#define Mem(a,b) memset(a,b,sizeof(a))
int Mod = 1000000007;
double pi = acos(-1.0);
double eps = 1e-6;


int prime = 999983; //模的数目
typedef struct{
	int f,t,w,next;
}Edge;
Edge edge[MAXM];
int head[MAXN];
int kNum;

void addEdge(int f, int t, int w)
{
	edge[kNum].f = f;
	edge[kNum].t = t;
	edge[kNum].w = w;
	edge[kNum].next = head[f];
	head[f] = kNum ++;
}

struct Node{
	int num[6];
	int flag;
	struct Node *next;
};

Node node[1000000];
int n;

bool Comp(Node a, Node *b){
	
	for(int i = 0; i < 6; i ++){
		if( a.num[0] == b->num[i]){
			for(int j = 1, k = i + 1; j < 6; j ++, k ++){
				if( a.num[j] != b->num[k%6] )
					break;
				if( j == 5 )
					return true;
			}
		}
	}

	for(int i = 0; i < 6; i ++){
		if( a.num[0] == b->num[i]){
			for(int j = 1, k = i - 1 + 6; j < 6; j ++, k --){
				if( a.num[j] != b->num[k%6] )
					break;
				if( j == 5 )
					return true;
			}
		}
	}
	
	return false;

}

void solve(){
	for(int i = 0; i < prime; i ++){
		node[i].flag = -1;
		node[i].next = NULL;
	}

	Node a;
	int sum = 0;
	bool tag = false;
	for(int i = 0; i < n; i ++){
		sum = 0;
		for(int j = 0; j < 6; j ++){
			scanf("%d",&a.num[j]);
			sum = (sum + a.num[j]) % prime;
		}
		if( tag ) continue;
		if( node[sum].flag == -1 ){
			node[sum].flag = 0;
			node[sum].next = new struct Node;
			for(int j = 0; j < 6; j ++)
				node[sum].next->num[j] = a.num[j];
			node[sum].next->next = NULL; 
		}
		else{
			Node* b = node[sum].next, *c;
			while( b != NULL ){
				c = b;
				tag = Comp(a,b);
				if( tag ) break;
				b = b->next;
			}
			if( !tag ){
				c->next = new struct Node;
				for(int j = 0; j < 6; j ++)
					c->next->num[j] = a.num[j];
				c->next->next = NULL;
			}
		}
	}

	if( tag ){
		printf("Twin snowflakes found.\n");
	}
	else{
		printf("No two snowflakes are alike.\n");
	}
}


int main()
{
//	freopen("d:\\test.txt", "r", stdin);
	
	while(cin>>n){
		solve();
	}

	return 0;
}