The next contest is on 14th september, I want more Div2s.
14th september is too long, please i will die without contests. I cant survive of codechef ewww sorry
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 157 |
| 6 | Qingyu | 155 |
| 7 | djm03178 | 151 |
| 7 | adamant | 151 |
| 9 | luogu_official | 150 |
| 10 | awoo | 147 |
→ Find user
→ Recent actions
Why are you implementing new features on this website MikeMirzayanov when it can not even handle 40k people, even leetcode does better than that.
Come one MikeMirzayanov, you can do better than that. This is not something new, please make codeforces worthy and make it able to handle its users properly.
I believe there are thousands of extremely frustrated users like me who are annoyed because of this.
Such a shame and pity.
Editorial says Let's fix one x and try to solve this task for it.
okay makes our time complexity q*(something), moving on...
How to find number of i that ai mod x ≤ m for some m
We can use binary search of some sort, making our complexity
q*log(x)*checkerForM, how in the world is this complexity not TLE
Can anyone explain it to me.
The next contest is on 14th september, I want more Div2s.
Spoiler
14th september is too long, please i will die without contests. I cant survive of codechef ewww sorry
I am doing ABC in div2 consistently, sometimes i can do till D/E depends on situation.
Can I reach expert if I keep doing this or what change in plan do I need to adapt ?
Any guidance would be helpful.
I am very good at linking old stuff to a newer problem (thats why I like problem making too). If I have solved say 10 tough problems and you give me a problem thats twice as tough as them but is similar in some aspect to some of them I am most likely able to solve it. But since memory is limited as I practice, I want to keep standard problem ideas in my mind only, around 50 problems for each data structure and 300-400 problems in total. (I will obviously solve more problems but will keep on discarding the problems which I will find similar to my existing knowledge).
PS: I'm someone who doesn't need to solve a ton of problems to get better, I need to solve a particular idea only once and Im pretty sure I would be able to solve a ~40% similar to that kind of problem. So I don't want to spend my time solving more and more problems.
What is the best source for such problems is it CSES problem set, TLE Eliminators, or something else ?
Any help would be appreciated.
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/22/2025 23:42:36 (g1).
Desktop version, switch to mobile version.
Supported by
