TWINSNOW - Snowflakes 哈希

题目描述
English Tiếng Việt You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collection of snowflakes, and search for a pair that may be identical. Each snowflake has six arms. For each snowflake, your program will be provided with a measurement of the length of each of the six arms. Any pair of snowflakes which have the same lengths of corresponding arms should be agged by your program as possibly identical.

输入格式

• The first line of input will contain a single integer n; the number of snowflakes to follow.
• This will be followed by n lines, each describing a snowflake. Each snowflake will be described by a line containing six integers (each integer is at least 0 and less than 10000000), the lengths of the arms of the snowflake. The lengths of the arms will be given in order around the snowflake (either clockwise or counterclockwise), but they may begin with any of the six arms. For example, the same snowflake could be described as 1 2 3 4 5 6 or 4 3 2 1 6 5.

输出格式
If all of the snowflakes are distinct, your program should print the message:

No two snowflakes are alike. If there is a pair of possibly identical snowflakes, your program should print the message:

Twin snowflakes found.

题意翻译
题目描述
你可能听说过，没有两片雪花是相同的。你要写一个程序，判断这是不是真的。你的程序会读到一些有关于这些雪花的信息，找到一对完全相同的雪花。每片雪花有六个角。对于每个雪花，你的程序会获得每个角的长度。我们认为两片雪花相同，当且仅当它们各自从某一个角开始，逆时针或顺时针记录长度，能得到两个相同的六元组。

输入输出格式
输入格式：
-第一行只有一个数字n，代表雪花的数量。

-接下来会有n行，每一行描述了一片雪花。每片雪花会按逆时针或顺时针给出六个角的长度a1,a2…a6。我们认为两片雪花相同，当且仅当它们各自从某一个角开始，逆时针或顺时针记录长度，能得到两个相同的六元组。例如，同一片雪花可以被描述为1 2 3 4 5 6 或 4 3 2 1 6 5。

输出格式
如果没有两片雪花是相同的，请输出 :
“No two snowflakes are alike. ”

否则，请输出：

“Twin snowflakes found.”

#include<cstdio>
#include<cstring>
const int SZ = 1e5+7, MOD = 99991;
int tot, snow[SZ][6], head[SZ], tail[SZ]