大致上是poj 3349的改版
out put有點不一樣!
有大大有辦法用Java寫出來嗎??
c++不太熟..如果有也可以!
Snowflake Snow Snowflakes
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 snowflake with 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 are possibly identical snowflakes, your program should print the message:
The following snowflakes are identical:
<a list of identical snowflakes>
Sample Input 1
4
1 2 3 4 5 6
4 3 2 1 6 5
1 3 4 2 5 6
6 5 2 4 3 1
Sample Output 1
The following snowflakes are identical:
1 2 3 4 5 6
4 3 2 1 6 5
The following snowflakes are identical:
1 3 4 2 5 6
6 5 2 4 3 1
Sample Input 2
2
1 2 3 4 5 6
4 5 2 1 6 3
Sample Output 2
No two snowflakes are alike.
如果能的話麻煩順便附上
1. 問題描述
2. 解題構想
3. 資料結構與演算法
4. 程式流程圖
5. 程式執行畫面
6. 程式碼 (含註解)
感謝!!!!!!!!!!!!!!!!!!
This entry passed through the Full-Text RSS service — if this is your content and you're reading it on someone else's site, please read the FAQ at fivefilters.org/content-only/faq.php#publishers.