| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 15 초 (추가 시간 없음) | 1024 MB | 251 | 0 | 0 | 0.000% |
The rock-paper-scissors game is played as follows: Two players simultaneously pick their moves as ‘rock’, ‘paper’, or ‘scissors’. When both pick the same move, they each get zero points. When they pick different moves, the rock beats the scissors, the scissors beat the paper, and the paper beats the rock. The player who picked the winning move gets $+1$ and the loser $-1$ points. A match consists of a number of moves whose points are added. Thus, the sum of points of the two players at the end of a match will always be zero.
There are many rock-paper-scissors competitions where the main goal is to guess the opponent’s strategy and play against it.
The jury has implemented 10 simple programs that play rock-paper-scissors. Write a program to play against them and score as many points as possible.
Your program is started a new for each opponent. Your program should write its move, followed by a newline, to the standard output and then read the opponent’s move from the standard input. Each move is designated by a capital letter: K (rock), P (paper), or R (scissors). The match is managed by a judge program that gets the moves of the jury’s program in the same way and keeps track of the score. The end of the match is signaled by L as the opponent’s move and after that your program should terminate immediately.
If subtask score is negative, your score for subtask is zero.
| 번호 | 배점 | 제한 |
|---|---|---|
| 1 | 100000 | |
| 2 | 100000 | |
| 3 | 100000 | |
| 4 | 100000 | |
| 5 | 100000 | |
| 6 | 100000 | |
| 7 | 100000 | |
| 8 | 100000 | |
| 9 | 100000 | |
| 10 | 100000 |
K P R (99997 moves) L
K P R (99997 moves) L