Please give me some hard implementation problems in the rating range of 1800-2100. Thanks
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ 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-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 15:31:08 (i1).
Desktop version, switch to mobile version.
Supported by
