HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > IMPC16 Group Contests > problem:


01. 50832 - Rock Paper Scissors Lizard Spock

IMPC16 Group Contests

Start: Jan.16.2016 at 10:00:00 AM
Finish: Jan.16.2016 at 02:00:00 PM
The contest is finished!
• Contest scoreboard

Guest
• Review clarifications (2)

Contest problems

• 01. 50832 - Rock Paper Scissor...
• 02. 50833 - Min of Odd Positions
• 03. 50834 - The train which leaves ...
• 11. 50859 - Low performance
• 12. 50860 - Number of Student Certi...
• 13. 50861 - The largest Student Group
• 14. 50862 - Sum of the Pairs
• 15. 50863 - Total Access Cost of a BST
• 21. 50873 - Max Frequency

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.
Question by Ibrahim Mesecan.

Rock Paper Scissors Lizard Spock

You know the famous game: Rock Paper Scissors. There is an extension of it: Rock Paper Scissors Lizard Spock. In which the rules are similar. Any of the five can win or lose against other four as seen in image on the right.

Question: Write a program that is going read n games between two people, and show the winner.
Note: If the two players show the same hand, they both take 0.

Input specification
You will be given an integer (n) the number of plays where 0 ≤ n ≤ 1000. Then, in the following n lines, you will be given two strings.

Output specification:
Show the score in the first line. Then, show one of the messages:

  • 1: if the first player wins
  • 2: if the second player wins
  • Tie: if they have the same score

Sample Input I
3
Rock Paper
Lizard Rock
Spock Scissors
 		Sample Output I
1 2
2

Explanation:

  1. Paper covers Rock
  2. Rock crushes Lizard
  3. Spock smashes Scissors



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

www.contester.ru