awoo's blog

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

1976A - Verify Password

Idea: BledDest

Tutorial
Solution (awoo)

1976B - Increase/Decrease/Copy

Idea: BledDest

Tutorial
Solution (Neon)

1976C - Job Interview

Idea: BledDest

Tutorial
Solution (BledDest)

1976D - Invertible Bracket Sequences

Idea: BledDest

Tutorial
Solution (Neon)

1976E - Splittable Permutations

Idea: BledDest

Tutorial
Solution (BledDest)

1976F - Remove Bridges

Idea: BledDest

Tutorial
Solution (awoo)

Full text and comments »

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

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

Neapolis University Pafos

Hello Codeforces!

The series of Educational Rounds continues thanks to the support of the Neapolis University Pafos.

On May/30/2024 17:35 (Moscow time) Educational Codeforces Round 166 (Rated for Div. 2) will start.

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, 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

Full text and comments »

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

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

1969A - Два друга

Idea: BledDest

Tutorial
Solution (awoo)

1969B - Сдвиги и сортировка

Idea: BledDest

Tutorial
Solution (adedalic)

1969C - Минимизация суммы

Idea: BledDest

Tutorial
Solution (Neon)

1969D - Игра в магазине

Idea: BledDest

Tutorial
Solution (Neon)

1969E - Уникальный массив

Idea: BledDest

Tutorial
Solution (Neon)

1969F - Пары карт

Idea: BledDest

Tutorial
Solution (BledDest)

Full text and comments »

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

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

Neapolis University Pafos

Hello Codeforces!

The series of Educational Rounds continues thanks to the support of the Neapolis University Pafos.

On Apr/29/2024 17:35 (Moscow time) Educational Codeforces Round 165 (Rated for Div. 2) will start.

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, 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

Full text and comments »

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

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

1954A - Painting the Ribbon

Idea: BledDest

Tutorial
Solution (BledDest)

1954B - Make It Ugly

Idea: BledDest

Tutorial
Solution (awoo)

1954C - Long Multiplication

Idea: BledDest

Tutorial
Solution (Neon)

1954D - Colored Balls

Idea: BledDest

Tutorial
Solution (Neon)

1954E - Chain Reaction

Idea: BledDest

Tutorial
Solution 1 (awoo)
Solution 2 (awoo)

1954F - Unique Strings

Idea: adedalic

Tutorial
Solution (adedalic)

Full text and comments »

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

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

Neapolis University Pafos

Hello Codeforces!

The series of Educational Rounds continues thanks to the support of the Neapolis University Pafos.

On Apr/12/2024 17:35 (Moscow time) Educational Codeforces Round 164 (Rated for Div. 2) will start.

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, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Big thanks to the tester shnirelman for his valuable advice and suggestions!

Good luck to all the participants!

UPD: Editorial is out

Full text and comments »

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

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

1948A - Special Characters

Idea: BledDest

Tutorial
Solution (Neon)

1948B - Array Fix

Idea: BledDest

Tutorial
Solution (Neon)

1948C - Arrow Path

Idea: BledDest

Tutorial
Solution (Neon)

1948D - Tandem Repeats?

Idea: BledDest

Tutorial
Solution (awoo)

1948E - Clique Partition

Idea: BledDest

Tutorial
Solution (BledDest)

1948F - Rare Coins

Idea: BledDest

Tutorial
Solution (Neon)

1948G - MST with Matching

Idea: BledDest

Tutorial
Solution (BledDest)

Full text and comments »

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

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

Neapolis University Pafos

Hello Codeforces!

We are pleased to announce a new long-term partnership between Codeforces and Neapolis University Pafos. Now educational rounds will be supported by Neapolis University Pafos. Stay tuned and you will find out more soon.

On Mar/15/2024 17:35 (Moscow time) Educational Codeforces Round 163 (Rated for Div. 2) will start.

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, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Big thanks to the testers shnirelman and Optoed for their valuable advice and suggestions! Special thanks to Vladosiya for his help with the round.

Good luck to all the participants!

UPD: Unfortunately, there were issues with the problem E judgement during the contest. There were only 18 participants affected by it, so the round stays rated. Rated participants whose verdict on problem E changed may request unrated participation (they have received the directions on how to change their participation to unrated). If you have not received any personal notifications about it in the contest dashboard, you have not been affected.

UPD2: Editorial is out

Full text and comments »

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

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

1923A - Moving Chips

Idea: BledDest

Tutorial
Solution (BledDest)

1923B - Monsters Attack!

Idea: BledDest

Tutorial
Solution (Neon)

1923C - Find B

Idea: Roms

Tutorial
Solution (Roms)

1923D - Slimes

Idea: BledDest

Tutorial
Solution (Neon)

1923E - Count Paths

Idea: BledDest

Tutorial
Solution (awoo)

1923F - Shrink-Reverse

Idea: adedalic

Tutorial
Solution (adedalic)

Full text and comments »

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

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

Hello Codeforces!

On Feb/23/2024 17:35 (Moscow time) Educational Codeforces Round 162 (Rated for Div. 2) will start.

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, 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

Full text and comments »

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

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

1922A - Tricky Template

Idea: Roms

Tutorial
Solution (awoo)

1922B - Forming Triangles

Idea: Roms

Tutorial
Solution (Roms)

1922C - Closest Cities

Idea: BledDest

Tutorial
Solution (Roms)

1922D - Berserk Monsters

Idea: BledDest

Tutorial
Solution (Neon)

1922E - Increasing Subsequences

Idea: Roms

Tutorial
Solution (Neon)

1922F - Replace on Segment

Idea: Roms

Tutorial
Solution (Neon)

Full text and comments »

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

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

Hello Codeforces!

On Jan/18/2024 17:35 (Moscow time) Educational Codeforces Round 161 (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, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Big thanks to the testers shnirelman and Minder for their valuable advice and suggestions!

Good luck to all the participants!

UPD: Editorial is out

Full text and comments »

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

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

1914A - Problemsolving Log

Idea: BledDest

Tutorial
Solution (awoo)

1914B - Preparing for the Contest

Idea: Roms

Tutorial
Solution (BledDest)

1914C - Quests

Idea: Roms

Tutorial
Solution (Neon)

1914D - Three Activities

Idea: BledDest

Tutorial
Solution (awoo)

1914E1 - Game with Marbles (Easy Version)

1914E2 - Game with Marbles (Hard Version)

Idea: BledDest

Tutorial
Solution (adedalic)

1914F - Programming Competition

Idea: BledDest

Tutorial
Solution (Neon)

1914G1 - Light Bulbs (Easy Version)

1914G2 - Light Bulbs (Hard Version)

Idea: BledDest

Tutorial
Solution (BledDest)

Full text and comments »

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

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

Hello, Codeforces!

On Dec/19/2023 17:35 (Moscow time) the Codeforces Round 916 (Div. 3) will start. You will be offered 6-8 problems with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have a rating of 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks.

You will be given 2 hours and 15 minutes to solve 6-8 problems. The penalty for a wrong submission is equal to 10 minutes.

We remind you that only the trusted participants of the third division will be included in the official standings table. As it is written on the blog which you can access by this link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participant of the third division, you must:

  • take part in at least five rated rounds (and solve at least one problem in each of them),
  • not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

The problems were invented and prepared by Adilbek adedalic Dalabaev, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov, Alexander fcspartakm Frolov, and me. Also, big thanks to Vladislav Vladosiya Vlasov for his excellent coordination.

Thanks to Mike MikeMirzayanov Mirzayanov for Codeforces and Polygon systems!

And, the last but not the least, big thanks to the testers FBI, Kalashnikov and SonOfHonor for their valuable advice and suggestions!

Good luck in the contest! I hope you'll enjoy solving the problems we have prepared.

UPD: Editorial is out

Full text and comments »

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

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

1902A - Binary Imbalance

Idea: BledDest

Tutorial
Solution (awoo)

1902B - Getting Points

Idea: adedalic

Tutorial
Solution (adedalic)

1902C - Insert and Equalize

Idea: Roms и BledDest

Tutorial
Solution (awoo)

1902D - Robot Queries

Idea: BledDest

Tutorial
Solution (Neon)

1902E - Collapsing Strings

Idea: Roms

Tutorial
Solution (Roms)

1902F - Trees and XOR Queries Again

Idea: BledDest

Tutorial
Solution (BledDest)

Full text and comments »

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

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

Hello Codeforces!

On Dec/03/2023 17:35 (Moscow time) Educational Codeforces Round 159 (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, 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

Full text and comments »

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

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

1901A - Line Trip

Idea: BledDest

Tutorial
Solution (Neon)

1901B - Chip and Ribbon

Idea: Roms

Tutorial
Solution (Roms)

1901C - Add, Divide and Floor

Idea: BledDest

Tutorial
Solution (awoo)

1901D - Yet Another Monster Fight

Idea: BledDest

Tutorial
Solution (vovuh)

1901E - Compressed Tree

Idea: BledDest

Tutorial
Solution (Neon)

1901F - Landscaping

Idea: adedalic

Tutorial
Solution (adedalic)

Full text and comments »

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

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

Hello Codeforces!

On Nov/24/2023 17:35 (Moscow time) Educational Codeforces Round 158 (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, 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

Full text and comments »

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

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

1895A - Treasure Chest

Idea: BledDest

Tutorial
Solution (awoo)

1895B - Points and Minimum Distance

Idea: fcspartakm

Tutorial
Solution (fcspartakm)

1895C - Torn Lucky Ticket

Idea: BledDest

Tutorial
Solution (awoo)

1895D - XOR Construction

Idea: AcidWrongGod

Tutorial
Solution (Neon)

1895E - Infinite Card Game

Idea: BledDest

Tutorial
Solution (awoo)

1895F - Fancy Arrays

Idea: Neon

Tutorial
Solution (Neon)

1895G - Two Characters, Two Colors

Idea: BledDest

Tutorial
Solution (BledDest)

Full text and comments »

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

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

Hello Codeforces!

On Nov/03/2023 17:35 (Moscow time) Educational Codeforces Round 157 (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, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Artem Ferume Ilikaev, Ruslan AcidWrongGod Kapralov, Alexey ashmelev Shmelev, Alex fcspartakm Frolov, Dmitry DmitryKlenov Klenov, Dmitry dmitryme Mescheryakov, Elena elena Rogacheva and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Please note that the problems of this round partially intersect with the problems of the Southern and Volga Russian Regional Contest. If you took part in that contest, please refrain from participating in the round.

Good luck to all the participants!

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

Harbour.Space
WORK & STUDY OPPORTUNITY IN BARCELONA — BIMBA Y LOLA x HARBOUR.SPACE UNIVERSITY

BIMBA Y LOLA has partnered with Harbour.Space University to offer a Master's Degree scholarship in Computer Science, as well as work experience as a Junior Java Developer at the Development Team in BIMBA y LOLA.

At BIMBA Y LOLA, they understand the importance of counting on the most creative professionals, those with an enterprising spirit and passion for their work. They are seduced by talent, sensibility, initiative, an analytical nature, commitment to quality, a keen eye and a love for detail. And, of course, a clear vocation for fashion.

If you share these values, we are offering a young, dynamic and stimulating environment; one in which to progress and develop professionally; a company present in over 18 countries and embarked on an ambitious international expansion plan.

All successful applicants will be eligible for a 100% Tuition Fee Scholarship (29,900€/year) provided by BIMBA Y LOLA.

Requirements:

  • Spanish and English language proficiency is a MUST
  • Bachelor's degree in the field of Mathematics, Statistics, Data Science, Computer Science or similar

The candidate should be familiar with:

  • Agile Methodologies (scrum)
  • GIT
  • Java 8/11+
  • Spring
  • Maven
  • JUnit
  • Mockito
  • UML
  • HTML
  • CSS
  • Javascript
  • ReactJS
  • SQL Server/MySQL

Desirable skills:

  • Azure
  • Azure DevOps — Pipelines
  • Docker
  • Kubernetes
  • Helm
  • Jira
  • Confluence

Apprenticeship Summary:

  • 100% Tuition Fee Scholarship to study a Master’s Degree in Computer Science for one year.
  • 4 hours/day internship on campus.
  • Competitive compensation.
  • Opportunity to join the company full-time after graduation.
  • Please note that preselected candidates will be requested to pay a non-refundable Application Fee of 125€ for assessment.

Candidate’s commitment:

  • Study Commitment: 4 hours/day
  • ‍You will complete 15 modules (each three weeks long) in one year.
  • Daily class workload is 3 hours, plus homework to complete in your own time.
  • Work Commitment: 4+ hours/day

Immerse yourself in the professional world during your apprenticeship. You’ll learn from the best and get to apply your newly acquired knowledge in the field from day one.

Apply here →

UPD: Editorial is out

Full text and comments »

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

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

1886A - Sum of Three

Idea: fcspartakm

Tutorial
Solution (fcspartakm)

1886B - Fear of the Dark

Idea: BledDest

Tutorial
Solution (Neon)

1886C - Decreasing String

Idea: Roms

Tutorial
Solution (Roms)

1886D - Monocarp and the Set

Idea: Roms

Tutorial
Solution (Roms)

1886E - I Wanna be the Team Leader

Idea: BledDest

Tutorial
Solution (awoo)

1886F - Diamond Theft

Idea: BledDest

Tutorial
Solution (Neon)

Full text and comments »

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

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

Hello Codeforces!

On Oct/09/2023 17:35 (Moscow time) Educational Codeforces Round 156 (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, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov, Alex fcspartakm Frolov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Please note that the problems of this round partially intersect with the problems of the Qualification stage of the Southern and Volga Russian Regional Contest. If you took part in the qualification, please refrain from participating in the round.

Good luck to all the participants!

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

Harbour.Space
FULLY FUNDED SCHOLARSHIPS for Masters in Data Science and Computer Science

Scholarships for Master's students in Computer Science and Data Science are available in Harbour.Space University Barcelona campus!

Scholarship Summary:

  • Fully funded scholarship (29.900 €/year) to study a Master’s degree in Data Science or Computer Science for two years
  • Successful applicants will become part of the University’s “Talent pool” and will be shown to the sponsoring companies. In case the candidate is picked for the Work&Study Program from our industry partner, the student starts an internship with a commitment to study 3 hours/day and work for 4 hour/day

Please note preselected candidates will be requested to pay a non-refundable application fee of 85€ to study at Harbour.Space University.

Candidate’s commitment:

You will complete 15 modules (each three weeks long) in one year. The daily class workload is 3 hours, plus homework to complete in your own time.

Candidate’s requirements:

  • Bachelor's degree in the field of Mathematics, Statistics, Data Science, Computer Science or similar
  • English proficiency
  • Advanced knowledge and experience in Python, SQL, Spark/Scala, and bash
  • Experienced use of Big Data technologies: Spark, HDFS, Kafka, etc.
  • Hands-on experience with Data Science techniques: feature engineering,
  • Strong ML knowledge
  • Strong Software Engineering Background
  • Problem-solving aptitude

Note: These scholarships are only available for qualified applicants with a bachelor’s degree.

Apply here →

UPD: Editorial is out

Full text and comments »

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

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

Hello Codeforces!

On Sep/24/2023 17:35 (Moscow time) Educational Codeforces Round 155 (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, 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:

Harbour.Space
FULLY FUNDED SCHOLARSHIPS for Masters in Data Science and Computer Science

Scholarships for Master's students in Computer Science and Data Science are available in Harbour.Space University Barcelona campus!

Scholarship Summary:

  • Fully funded scholarship (29.900 €/year) to study a Master’s degree in Data Science or Computer Science for two years
  • Successful applicants will become part of the University’s “Talent pool” and will be shown to the sponsoring companies. In case the candidate is picked for the Work&Study Program from our industry partner, the student starts an internship with a commitment to study 3 hours/day and work for 4 hour/day

Please note preselected candidates will be requested to pay a non-refundable application fee of 85€ to study at Harbour.Space University.

Candidate’s commitment:

You will complete 15 modules (each three weeks long) in one year. The daily class workload is 3 hours, plus homework to complete in your own time.

Candidate’s requirements:

  • Bachelor's degree in the field of Mathematics, Statistics, Data Science, Computer Science or similar
  • English proficiency
  • Advanced knowledge and experience in Python, SQL, Spark/Scala, and bash
  • Experienced use of Big Data technologies: Spark, HDFS, Kafka, etc.
  • Hands-on experience with Data Science techniques: feature engineering,
  • Strong ML knowledge
  • Strong Software Engineering Background
  • Problem-solving aptitude
Apply here →

UPD: Editorial is out

Full text and comments »

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

By awoo, history, 10 months ago, In English

1861A - Prime Deletion

Idea: BledDest

Tutorial
Solution (BledDest)

1861B - Two Binary Strings

Idea: Roms

Tutorial
Solution (Roms)

1861C - Queries for the Array

Idea: BledDest

Tutorial
Solution 1 (Roms)
Solution 2 (BledDest)

1861D - Sorting By Multiplication

Idea: Roms

Tutorial
Solution (Roms)

1861E - Non-Intersecting Subpermutations

Idea: BledDest

Tutorial
Solution (BledDest)

1861F - Four Suits

Idea: BledDest

Tutorial
Solution (BledDest)

Full text and comments »

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

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

Hello Codeforces!

On Aug/31/2023 17:35 (Moscow time) Educational Codeforces Round 154 (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, Ivan BledDest Androsov, Maksim Neon Mescheryakov, Roman Roms Glazov and me. Also, huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Additionally, big thanks to the tester stAngel for their valuable advice and suggestions!

Good luck to all the participants!

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

Harbour.Space
WORK & STUDY OPPORTUNITY IN BARCELONA @HARBOUR.SPACE UNIVERSITY

Harbour.Space University has partnered with Giga (UNICEF) to offer Master’s degree scholarships in the field of Data Science, as well as work experience.

We are looking for various junior to mid level candidates:

Data Scientist:

  • Strong ML knowledge
  • Experience with Data Visualization Tools like matplotlib, ggplot, d3.js., Tableau that helps to visually encode data
  • Excellent Communication Skills – it is incredibly important to describe findings to a technical and non-technical audience
  • Strong Software Engineering Background
  • Hands-on experience with data science tools
  • Problem-solving aptitude
  • Analytical mind and great business sense
  • Degree in Computer Science, Engineering or relevant field is preferred

Data Analyst:

  • Cleansing and preparing data
  • Analyzing and exploring data
  • Expertise in statistics
  • Analyzing and visualizing data
  • Reports and dashboards
  • Communication and writing
  • Expertise in the domain
  • Solution-oriented

All successful applicants will be eligible for a 100% tuition fee scholarship (29.900 €/year) provided by the partner company.

CANDIDATE’S COMMITMENT

Study Commitment: 3 hours/day

You will complete 15 modules (each three weeks long) in one year. Daily class workload is 3 hours, plus homework to complete in your own time.

Work Commitment: 4+ hours/day

Immerse yourself in the professional world during your apprenticeship. You’ll learn from the best and get to apply your newly acquired knowledge in the field from day one.

REQUIREMENTS:

  • Industry experience
  • International exposure
  • Eager to learn
  • Sustainability is a key topic for you
  • You want to work for an NGO
Apply here →

UPD: Editorial is out

Full text and comments »

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