CCC '18 J4/S2 - Sunflowers

View as PDF

Submit solution


Points: 3 (partial)
Time limit: 1.0s
Memory limit: 256M

Problem type
Canadian Computing Competition: 2018 Stage 1, Junior #4, Senior #2

Barbara plants N different sunflowers, each with a unique height, ordered from smallest to largest, and records their heights for N consecutive days. Each day, all of her flowers grow taller than they were the day before.

She records each of these measurements in a table, with one row for each plant, with the first row recording the shortest sunflower's growth and the last row recording the tallest sunflower's growth.

The leftmost column is the first measurement for each sunflower, and the rightmost column is the last measurement for each sunflower.

If a sunflower was smaller than another when initially planted, it remains smaller for every measurement.

Unfortunately, her children may have altered her measurements by rotating her table by a multiple of 90 degrees.

Your job is to help Barbara determine her original data.

Input Specification

The first line of input contains the number N (2 \le N \le 100). The next N lines each contain N positive integers, each of which is at most 10^9 . It is guaranteed that the input grid represents a rotated version of Barbara's grid.

Output Specification

Output Barbara's original data, consisting of N lines, each of which contain N positive integers.

Sample Input 1

2
1 3
2 9

Sample Output 1

1 3
2 9

Explanation for Sample Output 1

The data has been rotated a multiple of 360 degrees, meaning that the input arrangement is the original arrangement.

Sample Input 2

3
4 3 1
6 5 2
9 7 3

Sample Output 2

1 2 3
3 5 7
4 6 9

Explanation for Sample Output 2

The original data was rotated 90 degrees to the right/clockwise.

Sample Input 3

3
3 7 9
2 5 6
1 3 4

Sample Output 3

1 2 3
3 5 7
4 6 9

Explanation for Sample Output 3

The original data was rotated 90 degrees to the left/counter-clockwise.


Comments


  • 1
    Zunair74  commented on Oct. 1, 2018, 9:27 p.m.

    Ill never solve this.


    • 7
      Medi  commented on Nov. 23, 2018, 12:11 p.m.

      If you're stuck and have no idea on how to solve a problem, get some pencil and paper. Look at a few examples, and solve them manually. After a few examples, you'll notice that you're following a series of steps for every example. Once you have that pattern down, transcribe your steps one by one into code. It'll become a lot easier if you break a problem up into parts and doing it's steps one by one.


    • 3
      bonnehomme  commented on Nov. 22, 2018, 9:37 p.m.

      Don't say I'll never solve this. I thought that but I'm in a club with people who can. I still can't despite people trying to explain it to me for a long time. I haven't given up though.


  • -3
    xxsc  commented on April 8, 2018, 12:14 p.m.

    "...each with a unique height, ordered..."

    Shouldn't "a" be "an"?


    • 4
      TimothyW553  commented on April 8, 2018, 5:24 p.m.

      It's not the actual letter that determines it, but rather what the first letter sounds like


    • 2
      wleung_bvg  commented on April 8, 2018, 12:46 p.m.

      Owl Purdue has an article on it: https://owl.english.purdue.edu/owl/resource/591/01/

      Take a look at the bottom section on exceptions.


    • 3
      injust  commented on April 8, 2018, 12:44 p.m.

      No, correct usage is a unique. English is weird.


  • 37
    MakanDey  commented on Feb. 26, 2018, 12:54 p.m. edited

    This question should be 5 points, it's a lot harder than some Junior 2 questions that are worth 5.