Not Divisible

AtCoder

IDabc170_d

Time2000ms

Memory256MB

Difficulty—

Given is a number sequence $A$ of length $N$. Find the number of integers $i$ $\left(1 \leq i \leq N\right)$ with the following property: * For every integer $j$ $\left(1 \leq j \leq N\right)$ such that $i \neq j $ , $A_j$ does not divide $A_i$. ## Constraints * All values in input are integers. * $1 \leq N \leq 2 \times 10^5$ * $1 \leq A_i \leq 10^6$ ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $A_2$ $\cdots$ $A_N$ [samples]

Samples

Input #1

5
24 11 8 3 16

Output #1

3

The integers with the property are $2$, $3$, and $4$.

Input #2

4
5 5 5 5

Output #2

0

Note that there can be multiple equal numbers.

Input #3

10
33 18 45 28 8 19 89 86 2 4

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Not Divisible",
    "description": {
      "content": "Given is a number sequence $A$ of length $N$. Find the number of integers $i$ $\\left(1 \\leq i \\leq N\\right)$ with the following property: *   For every integer $j$ $\\left(1 \\leq j \\leq N\\right)$ such",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc170_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given is a number sequence $A$ of length $N$.\nFind the number of integers $i$ $\\left(1 \\leq i \\leq N\\right)$ with the following property:\n\n*   For every integer $j$ $\\left(1 \\leq j \\leq N\\right)$ such...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments