codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

173A.md (2625B)


      1 Source: https://codeforces.com/problemset/problem/173/A
      2 
      3 A. Rock-Paper-Scissors
      4 
      5 time limit per test
      6 
      7 3 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Nikephoros and Polycarpus play rock-paper-scissors. The loser gets pinched (not too severely!).
     22 
     23 Let us remind you the rules of this game. Rock-paper-scissors is played by two players. In each round the players choose one of three items independently from each other. They show the items with their hands: a rock, scissors or paper. The winner is determined by the following rules: the rock beats the scissors, the scissors beat the paper and the paper beats the rock. If the players choose the same item, the round finishes with a draw.
     24 
     25 Nikephoros and Polycarpus have played *n* rounds. In each round the winner gave the loser a friendly pinch and the loser ended up with a fresh and new red spot on his body. If the round finished in a draw, the players did nothing and just played on.
     26 
     27 Nikephoros turned out to have worked out the following strategy: before the game began, he chose some sequence of items *A* = (*a*1, *a*2, ..., *a**m*), and then he cyclically showed the items from this sequence, starting from the first one. Cyclically means that Nikephoros shows signs in the following order: *a*1, *a*2, ..., *a**m*, *a*1, *a*2, ..., *a**m*, *a*1, ... and so on. Polycarpus had a similar strategy, only he had his own sequence of items *B* = (*b*1, *b*2, ..., *b**k*).
     28 
     29 Determine the number of red spots on both players after they've played *n* rounds of the game. You can consider that when the game began, the boys had no red spots on them.
     30 
     31 Input
     32 
     33 The first line contains integer *n* (1 ≤ *n* ≤ 2·109) — the number of the game's rounds.
     34 
     35 The second line contains sequence *A* as a string of *m* characters and the third line contains sequence *B* as a string of *k* characters (1 ≤ *m*, *k* ≤ 1000). The given lines only contain characters "R", "S" and "P". Character "R" stands for the rock, character "S" represents the scissors and "P" represents the paper.
     36 
     37 Output
     38 
     39 Print two space-separated integers: the numbers of red spots Nikephoros and Polycarpus have.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 7  
     47 RPS  
     48 RSPP
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 3 2
     55 ```
     56 
     57 Input
     58 
     59 ```
     60 5  
     61 RRRRRRRR  
     62 R
     63 ```
     64 
     65 Output
     66 
     67 ```
     68 0 0
     69 ```
     70 
     71 Note
     72 
     73 In the first sample the game went like this:
     74 
     75 * R - R. Draw.
     76 * P - S. Nikephoros loses.
     77 * S - P. Polycarpus loses.
     78 * R - P. Nikephoros loses.
     79 * P - R. Polycarpus loses.
     80 * S - S. Draw.
     81 * R - P. Nikephoros loses.
     82 
     83 Thus, in total Nikephoros has 3 losses (and 3 red spots), and Polycarpus only has 2.