Problem statement: You are given a number N, please find an array of length N so that, no two elements divide each other, and the total sum is minimized.↵
N <= 1e5↵
Example:↵
N =21: arr = {1}↵
N =32: arr = {2, 3}↵
↵
Caveat: it isn't the first N primes.
N <= 1e5↵
Example:↵
N =
N =
↵
Caveat: it isn't the first N primes.
