문제2566--Run Length Encoding

### 2566: Run Length Encoding

실행시간 제한: 1 Sec  메모리사용 제한: 64 MB
제출: 3  통과: 1
[제출] [채점기록] [묻고답하기]

#### 문제 설명

Your task is to write a program that performs a simple form of run-length encoding, as described by the rules below.

Any sequence of between 2 to 9 identical characters is encoded by two characters. The first character is the length of the sequence, represented by one of the characters 2 through 9. The second character is the value of the repeated character. A sequence of more than 9 identical characters is dealt with by first encoding 9 characters, then the remaining ones.

Any sequence of characters that does not contain consecutive repetitions of any characters is represented by a 1 character followed by the sequence of characters, terminated with another 1. If a 1 appears as part of the sequence, it is escaped with a 1, thus two 1 characters are output.

#### 입력 설명

The input consists of letters (both upper- and lower-case), digits, spaces, and punctuation. Every line is terminated with a newline character and no other characters appear in the input.

#### 출력 설명

Each line in the input is encoded separately as described above. The newline at the end of each line is not encoded, but is passed directly to the output.

#### 입력 예시 Copy

AAAAAABCCCC
12344

#### 출력 예시 Copy

6A1B14C
11123124