Please give me some hard implementation problems in the rating range of 1800-2100. Thanks
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
I solved many problems of difficulty 1600-2100. But I am stuck in 1600 rating.What should I do for increase my rating?Please give me suggestions.Thanks
I can't find the time complexity of the following program. Even I can't find a way to calculate its complexity with master theorem. Please help me about how to calculate it. Thanks
My submission : https://codeforces.net/contest/128/submission/114386842
Problem link : https://codeforces.net/contest/128/problem/B
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/22/2025 07:35:52 (l2).
Desktop version, switch to mobile version.
Supported by
