My favorite website! Everything is so painfully slow. I can't open problems, submit, or view submissions.
What a pleasant experience!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 145 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
My favorite website! Everything is so painfully slow. I can't open problems, submit, or view submissions.
What a pleasant experience!
> billion dollar company > has the most dogshit contest format known in existence
what causes this?
slacking off. it's Monday buddy, WAKE UP!!!
I attempted to solve this problem E — Count Sequences 2 from the recent ABC. This was my submission, using my modint template. But it received WA on 45 testcases. Replacing my template with taking mod with % passed easily (submission). Is there a bug in my modint template? Please help me out, I can't figure out any mistake. The template is taken mostly from the-tourist/algo and atcoder library.
how to not get cucked by constructive problems? even after solving quite a few constructive problems, when I encounter one in a contest I just can't seem to solve them. Every time I lose 100+ elo in a contest it's because I got stuck on a constructive problem and was not able to solve it. please help!
My implementation skills are so bad it needs to be studied. I struggle to implement even the simplest solutions, even though I have the right idea in my mind. Please tell some really hard/heavy implementation problems that I can practice to get good. Thanks!
Given an array of integers and an integer m, in one operation, choose atmost m numbers of the array and increment them.
What is the minimum no of operations to make all the elements in the array equal?
1 <= nums[i] <= 1e5
1 <= m <= 1e5
| Name |
|---|


