HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > "Informatics Stars" Online Contests - 2011-2014 > problem:


2012-02-4. 50594 - Transformations

"Informatics Stars" Online Contests - 2011-2014

Start: Oct.20.2012 at 10:00:00 AM
Finish: Oct.20.2012 at 03:00:00 PM
The contest is finished!
• Contest scoreboard

Guest
• Review clarifications (1)

Contest problems

• 2011-04-2. 50585 - Inner Product
• 2011-04-3. 50587 - Modular Convers...
• 2011-05-1. 50767 - Censor
• 2011-05-2. 50652 - Prime Factorization
• 2011-05-3. 50653 - Long Divide
• 2011-11-1. 50565 - Binary numbers
• 2011-11-3. 50588 - Processing the li...
• 2012-02-2. 50577 - Perfect Numbers...
• 2012-02-4. 50594 - Transformat...
• 2012-02-5. 50768 - Where is Waldorf?
• 2012-02-7. 50704 - Connected?
• 2012-02-8. 50596 - Your Ride Is He...
• 2012-02-8. 50596 - Your Ride Is He...
• 2012-03-01. 50563 - Long Modulus
• 2012-03-02. 50567 - Input Data No...
• 2012-03-04. 50597 - Drawing Diam...
• 2012-10-02. 50555 - Frequency of L...

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.

Transformations (USACO Olympiads)

Shqip

A square pattern of black and white tiles is transformed into another square. Write a program that will recognize the minimum transformation that has been applied to the original pattern given the following list of possible transformations:

    ROTATED 90 DEGREES: The pattern was rotated to the right 90 degrees.
    ROTATED 180 DEGREES: The pattern was rotated to the right 180 degrees.
    ROTATED 270 DEGREES: The pattern was rotated to the right 270 degrees.
    VERTICAL REFLECTION: The pattern was reflected vertically.
    NOT TRANSFORMED: The original pattern was not changed.
    IMPROPER TRANSFORMATION: The new pattern was not obtained by any of the above methods.

Test Case 1:
Input:
5
X...X ....X
.X... ...X.
...X. .X...
..X.X ..X..
....X XX..X

Output:
ROTATED 90 DEGREES


Test Case 2:
Input:
2
X. X.
.X .X

Output:
NOT TRANSFORMED


Test Case 3:
Input:
5
X.... .X...
.X... ..X..
.X... ..X..
...X. ....X
....X X....

Output:
IMPROPER TRANSFORMATION


Input specification
There will be a number (n) in the first line where 1 < n ≤ 10. The following n lines will contain two patterns where every line is composed of the characters "." or "X".

Output specification
Show only one of the transformation messages given above.
There will be only one transformation.

Для отправки решений необходимо выполнить вход.

www.contester.ru