Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register
北京大学《ACM-ICPC竞赛训练》暑期课面向全球招生。容量有限,报名从速!
Language:
Rock, Paper, Scissors
Time Limit: 1000MSMemory Limit: 65536K
Total Submissions: 1661Accepted: 1027

Description

Rock, Paper, Scissors is a classic hand game for two people. Each participant holds out either a fist (rock), open hand (paper), or two-finger V (scissors). If both players show the same gesture, they try again. They continue until there are two different gestures. The winner is then determined according to the table below:

RockbeatsScissors
PaperbeatsRock
ScissorsbeatsPaper


Your task is to take a list of symbols representing the gestures of two players and determine how many games each player wins.
In the following example:

Turn : 1 2 3 4 5
Player 1 : R R S R S
Player 2 : S R S P S

Player 1 wins at Turn 1 (Rock beats Scissors), Player 2 wins at Turn 4 (Paper beats Rock), and all the other turns are ties.

Input

The input contains between 1 and 20 pairs of lines, the first for Player 1 and the second for Player 2. Both player lines contain the same number of symbols from the set {'R', 'P', 'S'}. The number of symbols per line is between 1 and 75, inclusive. A pair of lines each containing the single character 'E' signifies the end of the input.

Output

For each pair of input lines, output a pair of output lines as shown in the sample output, indicating the number of games won by each player.

Sample Input

RRSRS
SRSPS
PPP
SSS
SPPSRR
PSPSRS
E
E

Sample Output

P1: 1
P2: 1
P1: 0
P2: 3
P1: 2
P2: 1

Source

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator