I'm disheartened after this 326850174. If you think this guy is joking, just view his other submissions
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
I'm disheartened after this 326850174. If you think this guy is joking, just view his other submissions
Incredible coding style to be honest
Last div3 submissions:
https://codeforces.me/contest/2106/submission/317069857
https://codeforces.me/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.
| Name |
|---|


