|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초 (추가 시간 없음)||1024 MB||109||95||93||87.736%|
You enjoy your new job as a teacher of young children. It’s fun to see them learning to count, recognize letters, draw, and interact with the world.
One common problem you’ve noticed is that children often forget numbers when counting. For example, early on they might count “one, two, three, five, six.” You have to remind them about that “four” that they didn’t say. And as they get more proficient and clever, they may use the “quick” way of counting: “one, two, skip a few, ninety-nine, one hundred!”
Please write a program that can help you (and your students) identify the missing numbers when they are counting.
The first line of input contains a single integer n, where 1 ≤ n ≤ 100. Each of the next n lines contains one number that the child recited. Each recited number is an integer between 1 and 200 (inclusive). They are listed in increasing order, and there are no duplicates.
If the child recited all the numbers between 1 and the last number they recited, then print
If the child missed any numbers between 1 and the last number they recited, then print those missing numbers in increasing numeric order, one per line.
9 2 4 5 7 8 9 10 11 13
1 3 6 12
5 1 2 3 4 5