Intersection

AtCoder

IDabc199_b

Time2000ms

Memory256MB

Difficulty—

You are given sequences of length $N$ each: $A = (A_1, A_2, A_3, \dots, A_N)$ and $B = (B_1, B_2, B_3, \dots, B_N)$. Find the number of integers $x$ satisfying the following condition: * $A_i \le x \le B_i$ holds for every integer $i$ such that $1 \le i \le N$. ## Constraints * $1 \le N \le 100$ * $1 \le A_i \le B_i \le 1000$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $A_2$ $A_3$ $\dots$ $A_N$ $B_1$ $B_2$ $B_3$ $\dots$ $B_N$ [samples]

Samples

Input #1

2
3 2
7 5

Output #1

3

$x$ must satisfy both $3 \le x \le 7$ and $2 \le x \le 5$.  
There are three such integers: $3$, $4$, and $5$.

Input #2

3
1 5 3
10 7 3

Output #2

0

There may be no integer $x$ satisfying the condition.

Input #3

3
3 2 5
6 9 8

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Intersection",
    "description": {
      "content": "You are given sequences of length $N$ each: $A = (A_1, A_2, A_3, \\dots, A_N)$ and $B = (B_1, B_2, B_3, \\dots, B_N)$.   Find the number of integers $x$ satisfying the following condition: *   $A_i \\le",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc199_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given sequences of length $N$ each: $A = (A_1, A_2, A_3, \\dots, A_N)$ and $B = (B_1, B_2, B_3, \\dots, B_N)$.  \nFind the number of integers $x$ satisfying the following condition:\n\n*   $A_i \\le...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments