awoo's blog

By awoo, history, 31 hour(s) ago, translation, In English

1681A - Game with Cards

Idea: BledDest

Tutorial
Solution (BledDest)

1681B - Card Trick

Idea: BledDest

Tutorial
Solution (awoo)

1681C - Double Sort

Idea: BledDest

Tutorial
Solution (awoo)

1681D - Required Length

Idea: BledDest

Tutorial
Solution (BledDest)

1681E - Labyrinth Adventures

Idea: BledDest

Tutorial
Solution (awoo)

1681F - Unique Occurrences

Idea: BledDest

Tutorial
Solution 1 (awoo)
Solution 2 (awoo)

Read more »

 
 
 
 
  • Vote: I like it
  • +69
  • Vote: I do not like it

By awoo, history, 3 days ago, translation, In English

Hello Codeforces!

On May/23/2022 17:35 (Moscow time) Educational Codeforces Round 129 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +53
  • Vote: I do not like it

By awoo, history, 11 days ago, translation, In English

1680A - Minimums and Maximums

Idea: BledDest

Tutorial
Solution (BledDest)

1680B - Robots

Idea: BledDest

Tutorial
Solution (BledDest)

1680C - Binary String

Idea: BledDest

Tutorial
Solution (BledDest)

1680D - Dog Walking

Idea: vovuh and BledDest

Tutorial
Solution (vovuh)

1680E - Moving Chips

Idea: vovuh

Tutorial
Solution (vovuh)

1680F - Lenient Vertex Cover

Idea: BledDest

Tutorial
Solution (awoo)

Read more »

 
 
 
 
  • Vote: I like it
  • +45
  • Vote: I do not like it

By awoo, history, 13 days ago, translation, In English

Hello Codeforces!

On May/13/2022 17:35 (Moscow time) Educational Codeforces Round 128 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Harbour.Space

Harbour.Space takes over SWERC by winning gold and silver for the first time in its history and will go to the ICPC World Finals. Congratulations to all of our participants and coaches that made this a reality!

This is a very important moment in Harbour.Space and Codeforces long partnership, with 127 educational rounds being organized and a big Harbour.Space Scholarship Contest held on July 22th. We have selected contest winners (antOntrygubX_y, Meijer and windazz) to form our current teams.

Since its creation, one of Harbour.Spaces’s goals has been to win SWERC and compete at a high level in the ICPC globally. On April 24th, that objective was accomplished when Harbour.Space’s team RAW POTS (read it backwards!) won the gold medal and the overall contest against Southwestern Europe’s top contenders.

Harbour.Space

Team Raw Pots — gold medal:

Maksym Oboznyi (MaksymOboznyi), Marco Meijer (Meijer), and Danil Zashikhin (antOntrygubX_y)

Team Kempirqosaq — silver medal:

Temirlan Baibolov (bthero), Dinmukhamed Tursynbay (DimmyT), and Amanbol Kanatuly (windazz), ranked 4th and won a silver medal.

Team Harbour.Backspace — ranked 27th:

Anier Velasco (aniervs), Fadi Younes, and Ekaterina Podruzhko, ranked 27th.

The faculty, current students, alumni, and everyone involved with Harbour.Space would like to congratulate the winners and participants at SWERC 2021-2022 for their wonderful performance and hard work.

As usual, we are always excited to see Codeforces participants as our students here at Harbour.Space. That’s why we encourage you to apply to our latest apprenticeship program in partnership with Hansgrohe, as a Kotlin Developer until May 31st, 2022.

Apply | Scholarship

Harbour.Space University Team

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +169
  • Vote: I do not like it

By awoo, history, 5 weeks ago, translation, In English

1671A - String Building

Idea: BledDest

Tutorial
Solution (BledDest)

1671B - Consecutive Points Segment

Idea: vovuh

Tutorial
Solution (vovuh)

1671C - Dolce Vita

Idea: vovuh and BledDest

Tutorial
Solution (adedalic)

1671D - Insert a Progression

Idea: vovuh and BledDest

Tutorial
Solution (awoo)

1671E - Preorder

Idea: BledDest

Tutorial
Solution (BledDest)

1671F - Permutation Counting

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

 
 
 
 
  • Vote: I like it
  • +78
  • Vote: I do not like it

By awoo, history, 5 weeks ago, translation, In English

Hello Codeforces!

On Apr/22/2022 17:35 (Moscow time) Educational Codeforces Round 127 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +241
  • Vote: I do not like it

By awoo, history, 6 weeks ago, translation, In English

1661A - Array Balancing

Idea: BledDest

Tutorial
Solution (adedalic)

1661B - Getting Zero

Idea: adedalic

Tutorial
Solution (adedalic)

1661C - Water the Trees

Idea: vovuh

Tutorial
Solution 1 (vovuh)
Solution 2 (awoo)

1661D - Progressions Covering

Idea: vovuh

Tutorial
Solution (vovuh)

1661E - Narrow Components

Idea: BledDest

Tutorial
Solution (awoo)

1661F - Teleporters

Idea: vovuh

Tutorial
Solution (BledDest)

Read more »

 
 
 
 
  • Vote: I like it
  • +88
  • Vote: I do not like it

By awoo, history, 7 weeks ago, translation, In English

Hello Codeforces!

On Apr/09/2022 17:35 (Moscow time) Educational Codeforces Round 126 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +145
  • Vote: I do not like it

By awoo, history, 2 months ago, translation, In English

1657A - Integer Moves

Idea: BledDest

Tutorial
Solution (Neon)

1657B - XY Sequence

Idea: adedalic

Tutorial
Solution (adedalic)

1657C - Bracket Sequence Deletion

Idea: BledDest

Tutorial
Solution (vovuh)

1657D - For Gamers. By Gamers.

Idea: BledDest

Tutorial
Solution (awoo)

1657E - Star MST

Idea: BledDest

Tutorial
Solution (awoo)

1657F - Words on Tree

Idea: BledDest

Tutorial
Solution (awoo)

Read more »

 
 
 
 
  • Vote: I like it
  • +119
  • Vote: I do not like it

By awoo, history, 2 months ago, translation, In English

Hello Codeforces!

On Mar/22/2022 17:45 (Moscow time) Educational Codeforces Round 125 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out.

Read more »

 
 
 
 
  • Vote: I like it
  • +167
  • Vote: I do not like it

By awoo, history, 2 months ago, translation, In English

1651A - Playoff

Idea: BledDest

Tutorial
Solution (BledDest)

1651B - Prove Him Wrong

Idea: adedalic

Tutorial
Solution (awoo)

1651C - Fault-tolerant Network

Idea: adedalic

Tutorial
Solution (adedalic)

1651D - Nearest Excluded Points

Idea: BledDest

Tutorial
Solution (vovuh)

1651E - Sum of Matchings

Idea: BledDest

Tutorial
Solution (BledDest)

1651F - Tower Defense

Idea: BledDest

Tutorial
Solution (awoo)

Read more »

 
 
 
 
  • Vote: I like it
  • +105
  • Vote: I do not like it

By awoo, history, 3 months ago, translation, In English

Hello Codeforces!

On Mar/10/2022 17:35 (Moscow time) Educational Codeforces Round 124 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +196
  • Vote: I do not like it

By awoo, history, 3 months ago, translation, In English

1644A - Doors and Keys

Idea: BledDest

Tutorial
Solution (awoo)

1644B - Anti-Fibonacci Permutation

Idea: BledDest

Tutorial
Solution (Neon)

1644C - Increase Subarray Sums

Idea: BledDest

Tutorial
Solution (awoo)

1644D - Cross Coloring

Idea: BledDest

Tutorial
Solution 1 (awoo)
Solution 2 (awoo)

1644E - Expand the Path

Idea: BledDest

Tutorial
Solution (awoo)

1644F - Basis

Idea: BledDest

Tutorial

Read more »

 
 
 
 
  • Vote: I like it
  • +54
  • Vote: I do not like it

By awoo, history, 3 months ago, translation, In English

Hello Codeforces!

On Feb/22/2022 17:35 (Moscow time) Educational Codeforces Round 123 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Harbour.Space

Hey, Codeforces!

Once again, it is time for another exciting scholarship opportunity from Harbour.Space!

We have partnered with various tech companies to offer Bachelor’s or Master’s degree scholarships in Computer Science, Data Science, Cyber Security, and Front-end Development and work experience in the partnered companies.

We are looking for various junior to mid-level positions to fill in different fields such as:

  • Java Spring / Node.js Back-End Developer
  • DevOps Engineer
  • Kotlin Web App Developer
  • React / React Native Front-End Developer
  • Cyber Security Specialist

Requirements:

  1. High School Diploma for Bachelor degree applicants or Bachelor’s degree for Master degree applicants
  2. Professional fluency in English
  3. Previous experience is a must for Master student applicants and a plus for Bachelor student applicants

Make sure to apply before Mar 13, 2022, to be eligible for the scholarship and reduced application fee.

APPLY NOW →

Keep in touch and follow us on LinkedIn for more scholarship opportunities. And follow us on Instagram to evidence student life, events, and success stories from students.

Good luck on your round, and see you next time!

Harbour.Space University

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +201
  • Vote: I do not like it

By awoo, history, 4 months ago, translation, In English

Hello Codeforces!

On Jan/31/2022 17:35 (Moscow time) Educational Codeforces Round 122 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out.

Read more »

 
 
 
 
  • Vote: I like it
  • +243
  • Vote: I do not like it

By awoo, history, 4 months ago, translation, In English

1626A - Equidistant Letters

Idea: BledDest

Tutorial
Solution (awoo)

1626B - Minor Reduction

Idea: BledDest

Tutorial
Solution (awoo)

1626C - Monsters And Spells

Idea: BledDest

Tutorial
Solution (awoo)

1626D - Martial Arts Tournament

Idea: BledDest

Tutorial
Solution (awoo)

1626E - Black and White Tree

Idea: BledDest

Tutorial
Solution (BledDest)

1626F - A Random Code Problem

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

 
 
 
 
  • Vote: I like it
  • +121
  • Vote: I do not like it

By awoo, history, 4 months ago, translation, In English

Hello Codeforces!

On Jan/16/2022 17:35 (Moscow time) Educational Codeforces Round 121 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Unfortunately, the round is unrated. We are sorry for the inconvenience. You can upsolve the problems using the Codeforces archive.

UPD: Editorial is out.

Read more »

 
 
 
 
  • Vote: I like it
  • +1670
  • Vote: I do not like it

By awoo, history, 5 months ago, translation, In English

1622A - Construct a Rectangle

Idea: BledDest

Tutorial
Solution (Neon)

1622B - Berland Music

Idea: adedalic

Tutorial
Solution (awoo)

1622C - Set or Decrease

Idea: adedalic

Tutorial
Solution (adedalic)

1622D - Shuffle

Idea: BledDest

Tutorial
Solution (BledDest)

1622E - Math Test

Idea: BledDest

Tutorial
Solution (Neon)

1622F - Quadratic Set

Idea: Neon

Tutorial
Solution (Neon)

Read more »

 
 
 
 
  • Vote: I like it
  • +80
  • Vote: I do not like it

By awoo, history, 5 months ago, translation, In English

Hello Codeforces!

On Dec/27/2021 17:35 (Moscow time) Educational Codeforces Round 120 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +422
  • Vote: I do not like it

By awoo, history, 5 months ago, translation, In English

1620A - Equal or Not Equal

Idea: BledDest

Tutorial
Solution (Neon)

1620B - Triangles on a Rectangle

Idea: BledDest

Tutorial
Solution (awoo)

1620C - BA-String

Idea: BledDest

Tutorial
Solution (awoo)

1620D - Exact Change

Idea: adedalic

Tutorial
Solution (adedalic)

1620E - Replace the Numbers

Idea: Neon

Tutorial
Solution 1 (Neon)
Solution 2 (Neon)

1620F - Bipartite Array

Idea: BledDest and Neon

Tutorial
Solution 1 (Neon)
Solution 2 (Neon)

1620G - Subsequences Galore

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

 
 
 
 
  • Vote: I like it
  • +66
  • Vote: I do not like it

By awoo, history, 5 months ago, translation, In English

Hello Codeforces!

On Dec/18/2021 18:35 (Moscow time) Educational Codeforces Round 119 (Rated for Div. 2) will start. Please, note the unusual start time.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Codeforces and Harbour.Space

Hello once again, Codeforces!

Almost 5 months have passed since we organized the Harbour.Space Scholarship Contest 2021-2022. It’s been quite a tough challenge with more than 15,000 participants. However, we were able to select the ones who were ready to take the opportunity and join Harbour.Space this year. In addition to the contest, we carefully reviewed all scholarship applications and awarded a total of 11 students.

We would like to introduce you our Competitive Programming Scholarship Winners who have already arrived to Barcelona:

aniervs, MaksymOboznyi, mhq, Meijer, bthero,windazz, DimmyT, Batrr

We are looking forward to achieving incredible results with our new ICPC teams. One of them, Harbour.Backspace (MaksymOboznyi, mhq, Batrr), has already finished in 3rd place during Moscow Workshops. We wish them the best in the upcoming contests.

Codeforces and Harbour.Space

As usual, we are always excited to see Codeforces participants as our students here at Harbour.Space

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +206
  • Vote: I do not like it

By awoo, history, 6 months ago, translation, In English

1613A - Long Comparison

Idea: BledDest

Tutorial
Solution (awoo)

1613B - Absent Remainder

Idea: BledDest

Tutorial
Solution (Neon)

1613C - Poisoned Dagger

Idea: BledDest

Tutorial
Solution (Neon)

1613D - MEX Sequences

Idea: BledDest

Tutorial
Solution (Neon)

1613E - Crazy Robot

Idea: BledDest

Tutorial
Solution (awoo)

1613F - Tree Coloring

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

 
 
 
 
  • Vote: I like it
  • +88
  • Vote: I do not like it

By awoo, history, 6 months ago, translation, In English

Hello Codeforces!

On Dec/01/2021 17:35 (Moscow time) Educational Codeforces Round 118 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out

Read more »

 
 
 
 
  • Vote: I like it
  • +271
  • Vote: I do not like it

By awoo, history, 6 months ago, translation, In English

Hello Codeforces!

On Nov/22/2021 12:35 (Moscow time) Educational Codeforces Round 117 (Rated for Div. 2) will start.

The problems are based on the Southern Russia and Volga Cup 2021, which is a regional contest of ICPC. If you have participated in it or are planning to play it as a virtual contest, please refrain from taking part in the Educational Round.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

This round will be rated for the participants with rating lower than 2100. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally.

You will be given 6 or 7 problems and 2 hours to solve them.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: Editorial is out.

Read more »

 
 
 
 
  • Vote: I like it
  • +176
  • Vote: I do not like it

By awoo, history, 7 months ago, translation, In English

1606A - AB Balance

Idea: BledDest

Tutorial
Solution (adedalic)

1606B - Update Files

Tutorial
Solution (Neon)

1606C - Banknotes

Idea: BledDest

Tutorial
Solution (Neon)

1606D - Red-Blue Matrix

Idea: BledDest

Tutorial
Solution (awoo)

1606E - Arena

Idea: BledDest

Tutorial
Solution (Neon)

1606F - Tree Queries

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

 
 
 
 
  • Vote: I like it
  • +99
  • Vote: I do not like it