It was 1.5 years ago When I first took part in a div2 competition, during which I sloved three problems. However i just solve A and B in today's div2. It seems that i just learn a lot of data structures and algorithms but my performance never progress.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 158 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2025 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.01.2025 22:48:38 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
us bro
let me tell you secrete.
once you know the cf101 things like you need to include
ios::sync_with_stdio(false), cin.tie(nullptr);for fast IOand learning common data structures like DSU, segtree and binary search..
rest of thing is all about talent, gain of progress over practice is illusion
someone become LGM in 2 year, someone suck at green for 2 year what difference?
money