| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | nik_exists | 131 |
| 8 | Dominater069 | 131 |
| 10 | Proof_by_QED | 130 |
|
0
don't really see the point of this argument. |
|
+13
You can see that the blog is 3 months old |
|
0
I don't think you understand the difference |
|
0
You did the exact same thing bro: https://codeforces.me/contest/2053/submission/298876992 You just made it a lambda function and changed the "% 2" into "& 1" and some other small parts so I don't see why you're saying this. |
|
0
a web scraper |
|
+24
You can't use any form of AI or outside access (CF, USACO.Guide, etc.), you can only use your language's documentation. While gpt o3 could possibly solve Bronze/Silver and maybe even Gold, you have to do a certified-promote to get to Platinum and because the amount of people that promote to Platinum isn't that high, they go through all the submissions (or that's what I've been told). They also have a plagiarism detection system. Tl;DR -> Plagarism detection system and you won't be able to get to Platinum with gpt o3 as they check all submissions (or that's what I've been told). |
|
-14
I think other people might use it |
|
0
Basically, a web-scraper with only certain websites to use |
|
0
Thank you. |
|
-7
dssfsuper2 Do you know where I can find the rules on AI? |
|
-7
Oh sorry I didn't know that. I guess that makes sense then. Thank you for letting me know in the future. |
|
-94
I didn't cheat, but I used Co-Pilot's autocomplete. |
|
+1
Nice technique! The only issue I have with this is that the constant factor is very high (~30 for 123gjweq2 and your time complexities) so it has no real advantage over a regular sorting function and a regular sorting function is also much shorter. But then again, I really like this technique, so thank you for sharing! |
|
0
He's so good he has to use C to limit himself so other people have a slightly better chance. |
|
0
I honestly agree but I think December and February (Gold) was easier than usually and that helped. |
|
+8
For anything CP-related, the only thing I did (that's major) is reaching USACO Platinum. Kinda sold in December, but I got a redemption I guess. |
| Name |
|---|


