N-choice question

AtCoder

IDabc300_a

Time2000ms

Memory256MB

Difficulty—

Given integers $A$ and $B$, find $A+B$. This is a $N$\-choice problem; the $i$\-th choice is $C_i$. Print the **index** of the correct choice. ## Constraints * All values in the input are integers. * $1 \le N \le 300$ * $1 \le A,B \le 1000$ * $1 \le C_i \le 2000$ * $C_i$ are pairwise distinct. In other words, no two choices have the same value. * There is exactly one $i$ such that $A+B=C_i$. In other words, there is always a unique correct choice. ## Input The input is given from Standard Input in the following format: $N$ $A$ $B$ $C_1$ $C_2$ $\dots$ $C_N$ [samples]

Samples

Input #1

3 125 175
200 300 400

Output #1

2

We have $125+175 = 300$.  
The first, second, and third choices are $200$, $300$, and $400$, respectively.  
Thus, the $2$\-nd choice is correct, so $2$ should be printed.

Input #2

1 1 1
2

Output #2

1

The problem may be a one-choice problem.

Input #3

5 123 456
135 246 357 468 579

Output #3

API Response (JSON)

{
  "problem": {
    "name": "N-choice question",
    "description": {
      "content": "Given integers $A$ and $B$, find $A+B$.   This is a $N$\\-choice problem; the $i$\\-th choice is $C_i$.   Print the **index** of the correct choice.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc300_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given integers $A$ and $B$, find $A+B$.  \nThis is a $N$\\-choice problem; the $i$\\-th choice is $C_i$.  \nPrint the **index** of the correct choice.\n\n## Constraints\n\n*   All values in the input are inte...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments