Hello, Codeforces!↵
↵
It's our pleasure to announce the the finals of the 11th [Bubble Cup](http://www.bubblecup.org/)! Bubble Cup is a programming competition organized by [Microsoft Development Center Serbia (MDCS)](https://www.microsoft.com/sr-latn-rs/mdcs). The contest will take place on [Saturday, 22nd of September at 11:00 UTC+2](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Bubble+Cup+11+Finals+-+onsite&iso=20180922T11&p1=35&ah=5) in Belgrade, and will last for 5 hours. Live results will be available on the [official Bubble Cup website](http://www.bubblecup.org/CompetitorsCorner/Finals/358). Results will be frozen during the last hour of the competition. The winners will be announced at the closing ceremony.↵
↵
The format of the competition is very similar to ACM-ICPC — teams consisting of up to three people are allowed, and they have one computer and five hours to solve problems without partial scoring. Ties are broken using the usual time penalty rules. ↵
↵
Just like in the previous years, there will be an online mirror of the finals here at Codeforces, starting on [Saturday, 22nd of September at 12:35 UTC+2](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Bubble+Cup+11+finals+-+mirror&iso=20180922T1235&p1=35&ah=5). Unlike in the previous years, the mirror will be on the same day as the onsite finals.↵
↵
This year, the onsite competition is divided in two "divisions", called Premier League and Rising Stars. The two contests will have most of their problems in common, but the Rising Stars competition will feature some easier tasks targeted at high school contestants. We do not guarantee that every problems unique to Div2 is easier than every problem that is not.↵
↵
Both of the contests will be mirrored here on Codeforces, with Premier League mapping to the Div1 contest and Rising Stars mapping to the Div2 contest. The mirror will use native Codeforces ACM-ICPC team contest rules.↵
↵
Both contests will be **unrated**, due to the format and the length of the mirror being dissimilar to the standard Codeforces rated rounds. Note that this is a **team contest**, i.e. competing in teams up to three people is allowed. (Of course, you can also compete in a 1-person team.)↵
There will be at least 9 problems in each division.↵
↵
_As of now, Codeforces does not support rating-based divisions in team contests, so we came with the following ad-hoc rule:_↵
_teams with the maximum rated member having rating less than 1900 should enter the Div2 contest. Teams with the maximum rated member having rating at least 2100 should definitely enter the Div1 contest. The teams not covered by the previous two criteria are free to choose._↵
↵
Here are the past Bubble Cup mirrors on Codeforces:↵
↵
↵
[Bubble Cup 8 — Finals [Online Mirror]](https://codeforces.me/contest/575)↵
↵
[Bubble Cup 9 — Finals [Online Mirror]](https://codeforces.me/contest/717)↵
↵
[Bubble Cup X — Finals [Online Mirror]](https://codeforces.me/contest/852)↵
↵
↵
The problems and their solutions were created by employees and interns of Microsoft: [user:Milanin,2018-09-19], [user:ibra,2018-09-17], [user:balsa_knez,2018-09-20], [user:Kole,2018-09-17], [user:radras,2018-09-17], [user:fulu,2018-09-20], [user:pedja,2018-09-20], [user:niksmiljkovic,2018-09-19], [user:davidmilicevic97,2018-09-17], [user:FilipVesovic,2018-09-17], yours truly, and many more. Most of the team works in MDCS. ↵
↵
We express gratitude to [user:KAN,2018-09-20] for round coordination, and [user:MikeMirzayanov,2018-09-19] and the rest of the team for the great Codeforces and the wonderful Polygon platform.↵
We thank testers [user:DBradac,2018-09-20] and especially the extremely helpful [user:knightL,2018-09-19], for helping prevail various difficulties.↵
↵
The full editorial, together with the statements and solutions of the tasks from the qualification rounds, will be available in the [booklet section](http://www.bubblecup.org/Home/Booklets) of the Bubble Cup website on Sunday. An editorial with short descriptions of solutions may appear on Codeforces before that.↵
↵
Good luck to all participants!↵
↵
It's our pleasure to announce the the finals of the 11th [Bubble Cup](http://www.bubblecup.org/)! Bubble Cup is a programming competition organized by [Microsoft Development Center Serbia (MDCS)](https://www.microsoft.com/sr-latn-rs/mdcs). The contest will take place on [Saturday, 22nd of September at 11:00 UTC+2](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Bubble+Cup+11+Finals+-+onsite&iso=20180922T11&p1=35&ah=5) in Belgrade, and will last for 5 hours. Live results will be available on the [official Bubble Cup website](http://www.bubblecup.org/CompetitorsCorner/Finals/358). Results will be frozen during the last hour of the competition. The winners will be announced at the closing ceremony.↵
↵
The format of the competition is very similar to ACM-ICPC — teams consisting of up to three people are allowed, and they have one computer and five hours to solve problems without partial scoring. Ties are broken using the usual time penalty rules. ↵
↵
Just like in the previous years, there will be an online mirror of the finals here at Codeforces, starting on [Saturday, 22nd of September at 12:35 UTC+2](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Bubble+Cup+11+finals+-+mirror&iso=20180922T1235&p1=35&ah=5). Unlike in the previous years, the mirror will be on the same day as the onsite finals.↵
↵
This year, the onsite competition is divided in two "divisions", called Premier League and Rising Stars. The two contests will have most of their problems in common, but the Rising Stars competition will feature some easier tasks targeted at high school contestants. We do not guarantee that every problems unique to Div2 is easier than every problem that is not.↵
↵
Both of the contests will be mirrored here on Codeforces, with Premier League mapping to the Div1 contest and Rising Stars mapping to the Div2 contest. The mirror will use native Codeforces ACM-ICPC team contest rules.↵
↵
Both contests will be **unrated**, due to the format and the length of the mirror being dissimilar to the standard Codeforces rated rounds. Note that this is a **team contest**, i.e. competing in teams up to three people is allowed. (Of course, you can also compete in a 1-person team.)↵
There will be at least 9 problems in each division.↵
↵
_As of now, Codeforces does not support rating-based divisions in team contests, so we came with the following ad-hoc rule:_↵
_teams with the maximum rated member having rating less than 1900 should enter the Div2 contest. Teams with the maximum rated member having rating at least 2100 should definitely enter the Div1 contest. The teams not covered by the previous two criteria are free to choose._↵
↵
Here are the past Bubble Cup mirrors on Codeforces:↵
↵
↵
[Bubble Cup 8 — Finals [Online Mirror]](https://codeforces.me/contest/575)↵
↵
[Bubble Cup 9 — Finals [Online Mirror]](https://codeforces.me/contest/717)↵
↵
[Bubble Cup X — Finals [Online Mirror]](https://codeforces.me/contest/852)↵
↵
↵
The problems and their solutions were created by employees and interns of Microsoft: [user:Milanin,2018-09-19], [user:ibra,2018-09-17], [user:balsa_knez,2018-09-20], [user:Kole,2018-09-17], [user:radras,2018-09-17], [user:fulu,2018-09-20], [user:pedja,2018-09-20], [user:niksmiljkovic,2018-09-19], [user:davidmilicevic97,2018-09-17], [user:FilipVesovic,2018-09-17], yours truly, and many more. Most of the team works in MDCS. ↵
↵
We express gratitude to [user:KAN,2018-09-20] for round coordination, and [user:MikeMirzayanov,2018-09-19] and the rest of the team for the great Codeforces and the wonderful Polygon platform.↵
We thank testers [user:DBradac,2018-09-20] and especially the extremely helpful [user:knightL,2018-09-19], for helping prevail various difficulties.↵
↵
The full editorial, together with the statements and solutions of the tasks from the qualification rounds, will be available in the [booklet section](http://www.bubblecup.org/Home/Booklets) of the Bubble Cup website on Sunday. An editorial with short descriptions of solutions may appear on Codeforces before that.↵
↵
Good luck to all participants!↵
