| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Good mood and pure thoughts to everyone who comes here.
1422A - Fence
Author aropan
Solution 94875319
1422B - Nice Matrix
Author andrew
Solution 94875245
1422C - Bargain
Author aropan
Solution 94875502
1422D - Returning Home
Author aropan
Solution 94875536
1422E - Minlexes
Author aropan
Solution 94875558
1422F - Boring Queries
Author andrew
Solution 94875580, author's solution with persistent segment tree 94875295
Tutorial of Codeforces Round 675 (Div. 2)
Tryam, Codeforces!
Perhaps you are waiting for us to announce the final of BSUIR championship, but for now we are only glad to invite you to Codeforces Round 675 (Div. 2), which will be held on Oct/04/2020 19:05 (Moscow time). This round will be rated for the participants with rating lower than 2100.
The problems were prepared for you by andrew, hloya_ygrt, AleXman111 and Vladik together with me. We think that we have prepared good problems for [contest:297213]. After that we selected the best ones for this round.
The company Andersen has been holding a competition for the second year already, which is primarily intended to support students of regional universities in Belarus and Ukraine (starting this year).
First of all, we would like to thank MikeMirzayanov and everyone involved in the development of Codeforces and Polygon platforms. No less thanks to KAN for coordination — thanks to him you will be able to understand our problems. And also to all our coaches and parents who taught us to do everything that we can do.
The score distribution promises to be like this: 500 — 750 — 1000 — 1500 — 2000 — 2750.
Good luck and clean code to everyone!
UPD
Congratulations to the winners of the official standings:
1. Yukikaze_
2. lunabbit
3. kamer
4. Potassium_Fan
5. 2018LZY
And overall winners:
1. awoo
2. dlalswp25
3. tfg
4. Sugar_fan
5. hank55663
The editorial will come later.
UPD
The editorial came.
Announcement of Codeforces Round 675 (Div. 2)
Search standings of author now available https://clist.by/standings/?search=writer:Ashishgup: 
You can also view your results on the author’s contests https://clist.by/coder/?search=writer:Ashishgup: 
If you are unregistered (strange, because registration is free) then you can use this link https://clist.by/account/${YOUR_HANDLE}/resource/codeforces.com/?search=writer:Ashishgup, example: 
Currently available only for codeforces and atcoder.
Such graphs can be seen here:
But of course it is better to look right here.
Can I have the same ones??
Sure. Sign up, add your accounts and enjoy.
UPD
There is also a rating distribution for different resources, for example:
But its relevance may diverge due to inactive participants.
https://clist.by/standings/tco20-algorithm-stage-3-17680999/?detail=true
With showing who has advanced next.
Next SRM 784 is tomorrow.
Previous stages:
https://clist.by/standings/tco20-algorithm-stage-2-17680998/?detail=true
https://clist.by/standings/tco20-algorithm-stage-1-17679686/?detail=true
https://clist.by/standings/code-jam-qualification-round-16820931/?detail=true
There is search by participants, countries and languages. And viewing solutions without downloading file.
UPD
Added grouping by country (and not only for code jam) and languages:
https://clist.by/standings/code-jam-round-1a-16820932/?detail=true&groupby=country
https://clist.by/standings/code-jam-round-1a-16820932/?detail=true&groupby=languages
The results and upsolving of the semifinal are available at link. Many thanks to all guys who made this contest for you: hloya_ygrt, teleport, wilcot, Qwertenx, rui-de, Vladik, vilcheuski, netman, Tkach1024 and jklementseva.
The 9th BSUIR Open Programming Championship will be held from March 13 till April 25, 2019 (Minsk, Belarus).
The 8th BSUIR Open Programming Championship will be held from February 16 till April 13, 2018 (Minsk, Belarus).
The 7th BSUIR Open Programming Championship will be held from March 31 till April 28, 2017 (Minsk, Belarus).
The 6th BSUIR Open Programming Championship will be held from March 26 till April 28, 2016 (Minsk, Belarus). Undergraduates and postgraduates of BSUIR, students of other educational institutions, students from other universities and CIS countries are invited to participate in the Championship.
The competition will take place in three rounds:
- first qualifying round (distance, problems in russian) — March 26-29;
- second qualifying round (distance/onsite semi-final, russian and english problems) — April 5;
- Championship final (onsite, only english problems) — April 26-28.
First qualifying round is required only for BSUIR and high school teams but other registered teams can also take part in it. Second qualifying round is required for all teams; BSUIR and high school teams from Minsk take part onsite, other teams — distance.
To participate in the Championship teams need to be registered prior to 03.04.2016 incl (prior to 28.03.2016 for BSUIR and high school teams). Participation is free of charge — have fun.
The finalists are 42 teams, showed the best results in the qualifying rounds, but no more than:
- 7 teams of undergraduates and postgraduates of BSUIR;
- 5 school teams (one team from each of the educational institution);
- 2 teams from each of the university of Belarus and near and far abroad.
Open BSUIR Programming Championship is held by the ACM rules. During the Championship, the teams will be given 5 hours to solve 8 to 12 programming problems. The problems are written in English.
More information about the championship, as well as the problems and results of previous years, you may find at acm.bsuir.by. A little bit of last year video:
UPD Broadcast of Final link.
The V BSUIR Open Programming Championship will be held from 7 till 24 April, 2015 (Minsk, Belarus). Undergraduates and postgraduates of BSUIR, students of other educational institutions, students from other universities and CIS countries are invited to participate in the Championship.
The competition will take place in three rounds:
first qualifying round (distance) — April 7̶-̶9̶ 10-13;
second qualifying round (onsite semi-final) — April 14-16;
Championship final — April 22-24.
Teams from the universities of near and far abroad are invited immediately to the final of the competition (no more than 2 from the same university). To participate in the Championship teams need to be registered prior to 17.04.2015 incl. Qualifying rounds (quarter-finals and semi-finals) are required only for the teams from BSUIR and high school teams. Other registered teams can also take part in the qualifying rounds.
Open BSUIR Programming Championship is held by the ACM rules. During the Championship, the teams will be given 5 hours to solve 8 to 12 programming problems. The problems are written in English. More information about the championship, as well as the problems and results of previous years, you may find at acm.bsuir.by.
UPD. April 5. Moved the date of first qualifying round.
UPD. May 8. Practice and virtual participation of all the stages of the championship is available on Yandex.Contest. Statements are also available on the championship website. Analysis is coming.
Qualification round page - https://www.facebook.com/hackercup/problems.php?round=146094915502528
Countdown - http://fb.me/1glVt0CnM
