After a long (short for us mortals) journey antontrygubO_o finally will hopefully reach a well deserved LGM title, also I want to thank him for his invaluable contribution to the community as coordinator and problem setter, best wishes for you <3
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
After a long (short for us mortals) journey antontrygubO_o finally will hopefully reach a well deserved LGM title, also I want to thank him for his invaluable contribution to the community as coordinator and problem setter, best wishes for you <3
Hello, Codeforces!
I'm very glad to invite you to the first Cuban round Codeforces Round 659 (Div. 1) and Codeforces Round 659 (Div. 2) which will take place on 24.07.2020 17:35 (Московское время).
All problems in this round were created and prepared by mnaeraxr, gilcu3, dcordb, jcg and me. We tried to make them interesting and diverse and hope that you will enjoy them!
You will be given 2 hours to solve 6 problems in both divisions, and we highly encourage you to read all of them :)
We would like to thank:
antontrygubO_o for amazing coordination of this round.
Um_nik, gamegame, ffao, eatmore, isaf27, balbit, Tlatoani, prabowo, Kuroni, hugopm, MagentaCobra, qlf9, faremy, golions for testing the problems and providing invaluable feedback.
MikeMirzayanov for providing Codeforces and Polygon platforms.
The score distribution will be announced shortly before the round (or earlier).
UPD: Here is the score distribution:
Div2: 500 — (500 + 750) — 1750 — 1750 — 2500 — 2500
Div1: 1000 — 1000 — 1750 — 1750 — 2000 — 2250
Good luck and have fun!
UPD: The editorial is ready Editorial
UPD: Congratulations to the winners!
Especially for tourist, Benq and Radewoosh who solved all the problems!!!
Div. 1:
Div. 2:
Название |
---|