I'm disheartened after this 326850174. If you think this guy is joking, just view his other submissions
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 163 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
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://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.
| Name |
|---|


