I'm disheartened after this 326850174. If you think this guy is joking, just view his other submissions

The person:

Incredible coding style to be honest

Last div3 submissions:

https://mirror.codeforces.com/contest/2106/submission/317069857

https://mirror.codeforces.com/contest/2106/submission/317069857

Furthermore, "his" entire last div3 submissions were skipped, I wonder why...

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 = 1: arr = {1} N = 2: arr = {2, 3}

Caveat: it isn't the first N primes.