## Problem

The count-and-say sequence is the sequence of integers with the first five terms as following:

`1`

is read off as `"one 1"`

or `11`

.`11`

is read off as `"two 1s"`

or `21`

.`21`

is read off as `"one 2`

, then `one 1"`

or `1211`

.

Given an integer n where 1 ≤ n ≤ 30, generate thenthterm of the count-and-say sequence.

Note: Each term of the sequence of integers will be represented as a string.

### Examples:

**Input:**

1

4

**Output:**

“1”

“1211”

## Solutions

- 直接对上一次的结果进行从左往右的遍历，暴力求解
- 要注意的就是里面的细节和边界

## C++ Codes

1 | class Solution { |