Many A+B Problems

AtCoder

IDabc288_a

Time2000ms

Memory256MB

Difficulty—

You are given $N$ pairs of integers: $(A_1, B_1), (A_2, B_2), \ldots, (A_N, B_N)$. For each $i = 1, 2, \ldots, N$, print $A_i + B_i$. ## Constraints * $1 \leq N \leq 1000$ * $-10^9 \leq A_i, B_i \leq 10^9$ * All values in the input are integers. ## Input The input is given from Standard Input in the following format: $N$ $A_1$ $B_1$ $A_2$ $B_2$ $\vdots$ $A_N$ $B_N$ [samples]

Samples

Input #1

4
3 5
2 -6
-5 0
314159265 123456789

Output #1

8
-4
-5
437616054

*   The first line should contain $A_1 + B_1 = 3 + 5 = 8$.
*   The second line should contain $A_2 + B_2 = 2 + (-6) = -4$.
*   The third line should contain $A_3 + B_3 = (-5) + 0 = -5$.
*   The fourth line should contain $A_4 + B_4 = 314159265 + 123456789 = 437616054$.

API Response (JSON)

{
  "problem": {
    "name": "Many A+B Problems",
    "description": {
      "content": "You are given $N$ pairs of integers: $(A_1, B_1), (A_2, B_2), \\ldots, (A_N, B_N)$. For each $i = 1, 2, \\ldots, N$, print $A_i + B_i$.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc288_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given $N$ pairs of integers: $(A_1, B_1), (A_2, B_2), \\ldots, (A_N, B_N)$. For each $i = 1, 2, \\ldots, N$, print $A_i + B_i$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 1000$\n*   $-10^9 \\leq A_i, B_i...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments