POJ3349 Snowflake Snow Snowflakes

#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=100005;
const int mod=260819;
inline int read(){
	int x=0,f=1,ch=getchar();
	while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
	while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
	return x*f;
}
int data[MAXN][6];
vector<int> v[mod+5];
inline bool same(int x,int y){
	for(int i=0;i<6;i++)
		if(data[x][0]==data[y][i]&&data[x][1]==data[y][(i+1)%6]&&
			data[x][2]==data[y][(i+2)%6]&&data[x][3]==data[y][(i+3)%6]&&
			data[x][4]==data[y][(i+4)%6]&&data[x][5]==data[y][(i+5)%6]
			||
			data[x][0]==data[y][i]&&data[x][1]==data[y][(i+5)%6]&&
			data[x][2]==data[y][(i+4)%6]&&data[x][3]==data[y][(i+3)%6]&&
			data[x][4]==data[y][(i+2)%6]&&data[x][5]==data[y][(i+1)%6])
			return 1;
	return 0;
}
int main(){
	int n=read();
	for(int i=1;i<=n;i++)
		for(int j=0;j<6;j++)
			data[i][j]=read();
	bool ok=0;
	for(int i=1;i<=n;i++){
		int sum=0;
		for(int j=0;j<6;j++) sum+=data[i][j];
		sum%=mod;
		for(int j=0;j<v[sum].size();j++)
			if(same(v[sum][j],i)){
				ok=1;
				break;
			}
		if(ok) break;
		v[sum].push_back(i);
	}
	if(ok) puts("Twin snowflakes found.");
	else puts("No two snowflakes are alike.");
	return 0;
}