Logo
(追記) (追記ここまで)

8270번 - Tulips 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB23021518793.970%

문제

15 thousand kinds of tulips are known in Byteland (approximately the same number of cultivars of tulips is known in the "real" world). For many years Byteasar has been maintaining his private tulip index in which each kind of these magnificent flowers has received a catalogue number between 1 and 15 000.

Recently the board of directors of the Bytean Botanic Garden has made an interest in Byteasar's index. In the garden grow lots of different kinds of tulips. The board of directors figured out that if they are able to collect all different kinds of tulips, this would significantly increase the popularity of the garden. They asked Byteasar to find out how many kinds of tulips are still missing in the garden.

Byteasar has already managed to identify the kinds of tulips that grow in the respective beds of the garden. Unfortunately, it is hard for him to count the number of kinds of tulips that are still missing. Could you help him with that?

입력

The first line of the standard input contains one integer n (1 ≤ n ≤ 20 000) that denotes the number of beds of tulips in the garden. The second line contains n integers from the interval [1,15000] that denote the catalogue numbers of kinds of tulips that grow in the respective beds in the garden.

출력

Your program should write to the standard output one line with a single integer: the number of kinds of tulips that the board of directors has to buy to have all the kinds of tulips in the garden.

제한

예제 입력 1

8
3 6 2 2 4 6 3 7

예제 출력 1

14995

힌트

출처

Contest > Algorithmic Engagements > PA 2011 0-1번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /