Not coprime

AtCoder

IDarc114_a

Time2000ms

Memory256MB

Difficulty—

Given are $N$ integers between $2$ and $50$ (inclusive): $X_1, X_2, \cdots, X_N$. Find the minimum positive integer $Y$ that satisfies the following for every $i = 1, 2, \cdots, N$: * $X_i$ and $Y$ are not coprime. ## Constraints * $1 \leq N \leq 49$ * $2 \leq X_i \leq 50$ * $X_i \neq X_j (i \neq j)$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $X_1$ $X_2$ $\ldots$ $X_N$ [samples]

Samples

Input #1

2
4 3

Output #1

6

Being not coprime with $4$ requires being even, and being not coprime with $3$ requires being a multiple of $3$.

Input #2

1
47

Output #2

Input #3

7
3 4 6 7 8 9 10

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Not coprime",
    "description": {
      "content": "Given are $N$ integers between $2$ and $50$ (inclusive): $X_1, X_2, \\cdots, X_N$. Find the minimum positive integer $Y$ that satisfies the following for every $i = 1, 2, \\cdots, N$: *   $X_i$ and $Y$",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc114_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given are $N$ integers between $2$ and $50$ (inclusive): $X_1, X_2, \\cdots, X_N$. Find the minimum positive integer $Y$ that satisfies the following for every $i = 1, 2, \\cdots, N$:\n\n*   $X_i$ and $Y$...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments