哈希-poj-3349-相同的雪花
2014-04-16 19:28
295 查看
poj-3349-Snowflake Snow Snowflakes
Time Limit: 4000MS Memory Limit: 65536K
Description
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 flagged by your program as possibly identical.
Input
The first line of input will contain a single integer n, 0 < n ≤ 100000, 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 snow ake. 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.
Output
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 snow akes, your program should print the message:
Twin snowflakes found.
Sample Input
2
1 2 3 4 5 6
4 3 2 1 6 5
Sample Output
Twin snowflakes found.
Time Limit: 4000MS Memory Limit: 65536K
Description
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 flagged by your program as possibly identical.
Input
The first line of input will contain a single integer n, 0 < n ≤ 100000, 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 snow ake. 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.
Output
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 snow akes, your program should print the message:
Twin snowflakes found.
Sample Input
2
1 2 3 4 5 6
4 3 2 1 6 5
Sample Output
Twin snowflakes found.
相关文章推荐
- POJ 3349:Snowflake Snow Snowflakes 六片雪花找相同的 哈希
- POJ 3349:Snowflake Snow Snowflakes 六片雪花找相同的 哈希
- nyoj 130 相同的雪花 || poj 3349 Snowflake Snow Snowflakes
- poj 3349 相同的两片雪花
- poj 3349 && 南阳oj 130 Snowflake Snow Snowflakes(相同的雪花)
- POJ 3349 重复的雪花(哈希)
- poj 3349 hash(相同雪花)
- POJ_3349_Snowflake_哈希
- NYOJ 130 相同雪花(哈希入门)
- POJ 3349-Snowflake Snow Snowflakes-字符串哈希
- poj 3349:Snowflake Snow Snowflakes(哈希查找,求和取余法+拉链法)
- POJ 3349 Snowflake Snow Snowflakes(简单哈希)
- poj_3349 哈希
- poj_3349 Snowflake Snow Snowflakes(数字哈希)
- POJ 3349 - 数值哈希(这辈子只服数据量)
- [ACM] POJ 3349 Snowflake Snow Snowflakes(哈希查找,链式解决冲突)
- poj 3349 哈希 简单拉链(卡时间过去的。。。)
- POJ 3349 Snowflake Snow Snowflaks <数的哈希>
- nyoj-130 相同的雪花 (哈希)
- poj-3349-哈希