시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 1024 MB 8 4 3 60.000%

문제

A robot can move along a row of colored squares. Every square can be either red, green or blue. A command to the robot is a color. The robot responds by moving to the right until it stands on the color specified by the command. Write a program that, for a given sequence of squares and a number $N$, writes out the sequence of $N$ commands that makes the robot go as far to the right as possible.

Figure 1: An illustration of the third sample case.

입력

The first line containes an integer $N$, the number of commands to give to the robot. The second line contains a string of letters, R , G, or B, which specifies the color of each square in the row, from left to right. The string contains less than 200 characters, and is always sufficiently long that no sequence of $N$ commands may cause the robot to reach outside the row of squares.

출력

The program should output a string of $N$ characters, each being R, G, or B, which constitutes the sequence of commands you should give to the robot to make it move as far as possible along the row of squares. If there are several sequences that accomplish this, you may output anyone of them.

서브태스크

번호 배점 제한
1 20

$N=4$ and the sequence is 'RGBGGBGRBRBRGRGRB' (i.e. the case shown on this year's PO poster)

2 30

$1 \le N \le 4$

3 20

$5 \le N \le 10$

4 30

$20 \le N \le 25$

예제 입력 1

1
RRBBBGG

예제 출력 1

G

예제 입력 2

2
GBBRGRGBRG

예제 출력 2

RB

예제 입력 3

3
RGBGRRBGBBRG

예제 출력 3

BBR

예제 입력 4

4
RBRBRBBRBRBRGRGGRGGGRBBRBRRBBRBRBRGBGBGBBGBGBGBBBGBGR

예제 출력 4

GBGR

출처

Olympiad > Swedish Olympiad in Informatics > 2016 > Online Qualification C번

  • 문제를 만든 사람: Pär Söderhjelm

채점 및 기타 정보

  • 예제는 채점하지 않는다.