Mex

AtCoder

IDabc245_b

Time2000ms

Memory256MB

Difficulty—

You are given a sequence of length $N$ consisting of integers: $A=(A_1,\ldots,A_N)$. Find the smallest non-negative integer not in $(A_1,\ldots,A_N)$. ## Constraints * $1 \leq N \leq 2000$ * $0 \leq A_i \leq 2000$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $\ldots$ $A_N$ [samples]

Samples

Input #1

8
0 3 2 6 2 1 0 0

Output #1

4

The non-negative integers are $0,1,2,3,4,\ldots$.  
We have $0,1,2,3$ in $A$, but not $4$, so the answer is $4$.

Input #2

3
2000 2000 2000

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Mex",
    "description": {
      "content": "You are given a sequence of length $N$ consisting of integers: $A=(A_1,\\ldots,A_N)$. Find the smallest non-negative integer not in $(A_1,\\ldots,A_N)$.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc245_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence of length $N$ consisting of integers: $A=(A_1,\\ldots,A_N)$.\nFind the smallest non-negative integer not in $(A_1,\\ldots,A_N)$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2000$\n*   $0 ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments