CCO '07 P2 - Snowflakes

View as PDF
Submit solution
Points: 10 (partial)
Time limit: 1.0s
Memory limit: 64M
Problem type
Canadian Computing Competition: 2007 Stage 2, Day 1, Problem 2

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.

Note: The original CCO data were weak and have been augmented with some custom test cases.

Input Specification

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 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.

Output Specification

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.

Sample Input

Copy
2
1 2 3 4 5 6
4 3 2 1 6 5

Output for Sample Input

Copy
Twin snowflakes found.

Comments


  • 0
    Millenia  commented 23 days ago

    Why don't I pass case 21? How does it differ from the rest of the cases?


  • 5
    OneYearOld  commented on Nov. 26, 2020, 10:26 p.m.

    For C++ users, if you do not put a newline at the end of your message, you will get a Presentation Error.


  • -4
    vinith2  commented on May 23, 2019, 11:35 p.m. ← edit 2

    Could someone please explain what is wrong with my most recent answer?


    • 5
      Plasmatic  commented on May 24, 2019, 1:59 p.m.

      From a cursory examination of your code, I think it's that you assume all arm lengths are one digit long.

      Besides, your code is far too slow (like 100x too slow) to pass all the test cases even if it was correct.


  • -4
    Plasmatic  commented on Sept. 16, 2018, 2:24 a.m.

    Solvable using one line (w/o semicolons) if you abuse Python enough


  • 1
    aeternalis1  commented on July 21, 2017, 4:38 p.m.

    Are all the arms of a specific snowflake distinct integers?


    • 1
      wleung_bvg  commented on July 21, 2017, 5:18 p.m.

      Not necessarily


  • -5
    Kirito  commented on Dec. 12, 2016, 4:28 p.m.

    This comment is hidden due to too much negative feedback. Show it anyway.


    • 0
      JimmyDeng12345  commented on Sept. 16, 2018, 6:08 p.m. ← edited

      Could u explain it a bit :) Oh nvm LOL