PikMike's blog

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

1167A - Telephone Number

Idea: Roms

Tutorial
Solution (Roms)

1167B - Lost Numbers

Idea: Vovuh

Tutorial
Solution (BledDest)

1167C - News Distribution

Idea: MikeMirzayanov

Tutorial
Solution (BledDest)
Solution (PikMike)

1167D - Bicolored RBS

Idea: adedalic

Tutorial
Solution (adedalic)

1167E - Range Deleting

Idea: Roms

Tutorial
Solution (Roms)

1167F - Scalar Queries

Idea: adedalic

Tutorial
Solution (adedalic)

1167G - Low Budget Inception

Idea: adedalic

Tutorial
Solution (adedalic)

Read more »

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

By PikMike, 7 months ago, translation, In English,

Hello Codeforces!

On May/15/2019 17:35 (Moscow time) Educational Codeforces Round 65 (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 7 problems and 2 hours to solve them.

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

Good luck to all participants!

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

Hello Codeforces!

We are collaborating with an external sponsor who is offering a unique scholarship opportunity for women who want to study Cybersecurity or Fintech, both for Bachelors and Masters level.

The scholarship includes:

  • An up to $10,000, one-time financial award, paid to the University
  • An all-expenses-paid trip to the EMEA Summit 28-30 October, 2019 in Berlin
  • A Cybersecurity professional to serve as an industry mentor

Apply before May 30th and Harbour.Space will also consider you for a scholarship from our own funds.

Don't miss this chance to study with us in Barcelona!

If you have questions about the scholarship, please contact us at hello@harbour.space!

APPLY HERE→

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 Radewoosh 7 174
2 mnbvmar 7 183
3 I_love_Tanya_Romanova 6 119
4 Farhod_Farmon 6 124
5 xiaowuc1 6 142

Congratulations to the best hackers:

Rank Competitor Hack Count
1 algmyr 57:-1
2 mnbvmar 16:-2
3 xavier_cai 11:-1
4 halyavin 10:-3
5 avm 7
291 successful hacks and 306 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A Dalgerok 0:01
B Farhod_Farmon 0:05
C DieOrBreakout 0:04
D nuip 0:10
E Farhod_Farmon 0:23
F ugly2333 0:13
G Dukkha 0:57

UPD: Editorial is out

Read more »

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

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

1156A - Inscribed Figures

Tutorial
Solution (PikMike)

1156B - Ugly Pairs

Tutorial
Solution (PikMike)

1156C - Match Points

Tutorial
Solution (BledDest)

1156D - 0-1-Tree

Tutorial
Solution (BledDest)

1156E - Special Segments of Permutation

Tutorial
Solution (BledDest)

1156F - Card Bag

Tutorial
Solution (Roms)

1156G - Optimizer

Tutorial
Solution (e-maxx)

Read more »

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

By PikMike, 7 months ago, translation, In English,

Hello Codeforces!

On May/01/2019 17:35 (Moscow time) Educational Codeforces Round 64 (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 7 problems and 2 hours to solve them.

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

Good luck to all participants!

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

Hi Codeforces!

Harbour.Space University, the International Tournament of Young Mathematicians (ITYM) and St. Paul International School Barcelona have designed a special online test for high school students, to take place on May 5th at 15.00 CET Time.

You can take part in the online test if all the following conditions are met:

  1. Between the ages of 12 to 18,
  2. Have not graduated from high school
  3. Eligible to take part in IOI/IMO 2020.
Register (before May 3) →

After the test, all participants will get a 20% discount link to attend Tech Scouts, the two-week summer camp we run from the 8th-19th of July in one of Barcelona's leading international schools, St.Paul’s, and the most successful performers will be interviewed and awarded a full tuition waiver to attend the advanced level of the Advanced Technical Track of Tech Scouts.

In order to register for the contest, please fill out this form before May 3rd, 2019.

We would love to see you guys at our camp this year — if you’re interested in joining, or if you just want to know more, just head over to the Tech Scouts website.

UPD: There are some minor issues with one of the problems, we'll use one of lesser-known problems by Maxim Babenko.

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 step_by_step 7 491
2 RimuruTempest 6 270
3 receed 6 280
4 I_love_Tanya_Romanova 6 286
5 dreamoon_love_AA 6 299

Congratulations to the best hackers:

Rank Competitor Hack Count
1 halyavin 64:-3
2 WileE.Coyote 39:-23
3 wzw19991105 18:-1
4 FST-OIer 14:-1
5 omaewamoushindeiruuuuuuu 2
153 successful hacks and 180 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A halyavin 0:06
B nuip 0:07
C quailty 0:04
D waynetuinfor 0:11
E step_by_step 0:05
F step_by_step 0:15
G step_by_step 1:22

UPD2: The editorial is out.

Read more »

 
 
 
 
  • Vote: I like it
  • -164
  • Vote: I do not like it

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

1155A - Reverse a Substring

Tutorial
Solution (Vovuh)

1155B - Game with Telephone Numbers

Tutorial
Solution (Roms)

1155C - Alarm Clocks Everywhere

Tutorial
Solution (Vovuh)

1155D - Beautiful Array

Tutorial
Solution (PikMike)

1155E - Guess the Root

Tutorial
Solution (adedalic)

1155F - Delivery Oligopoly

Tutorial
Solution (BledDest)

Read more »

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

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

Hello Codeforces!

On Apr/22/2019 17:35 (Moscow time) Educational Codeforces Round 63 (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 problems and 2 hours to solve them.

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

Good luck to all participants!

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

Hi Codeforces!

This summer, we want to invite you to Tech Scouts, the two-week summer camp we run from the 8th-19th of July in one of Barcelona's leading international schools, St.Paul’s.

This camp, divided into Creative and Technical tracks, is designed to lay out the foundation of knowledge for high-school students in the fields of technology, mathematics, business and design. Both tracks are taught in English.

We would love to see you guys at our camp this year — if you’re interested in joining, or if you just want to know more, just head over to the Tech Scouts website.

This camp is for anyone passionate about tech or design, so if you know someone who might be interested, be sure to let them know too!

Ps. Don’t wait too long — you still have an early bird discount, but only until May 20th

UPD: The round will contain 6 problems.

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 Um_nik 6 111
2 Cinro_9baka 6 207
3 Ilovebxy 6 247
4 ivan100sic 6 249
5 ainta 6 411

Congratulations to the best hackers:

Rank Competitor Hack Count
1 halyavin 292:-18
2 Haunted_Cpp 31
3 WileE.Coyote 30:-4
4 Disappointment 27:-1
5 czasem_tak_trzeba 23
790 successful hacks and 697 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A iaeyoayao 0:01
B MesyuraTheOldDumbGoblin 0:03
C NeKrasnyj 0:07
D FlyToTheSky 0:07
E Rezwan.Arefin01 0:17
F Um_nik 0:59

UPD: The editorial is out

Read more »

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

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

1140A - Detective Book

Tutorial
Solution (adedalic)

1140B - Good String

Tutorial
Solution (Roms)

1140C - Playlist

Tutorial
Solution (Roms)

1140D - Minimum Triangulation

Tutorial
Solution (adedalic)

1140E - Palindrome-less Arrays

Tutorial
Solution (adedalic)

1140F - Extending Set of Points

Tutorial
Solution (BledDest)

1140G - Double Tree

Tutorial
Solution (BledDest)

Read more »

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

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

Hello Codeforces!

On Mar/22/2019 18:05 (Moscow time) Educational Codeforces Round 62 (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 7 problems and 2 hours to solve them.

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

Good luck to all participants!

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

Hello Codeforces!

We want to remind you about the two fully funded scholarships we currently have available:

Master’s in Data Science Scholarship & Master’s in Robotics Scholarship

Both scholarship opportunities include: - Full coverage of the Programme’s tuition fee (€23,000 value) - 3 hours of study a day at Harbour.Space University - 4 hours of internship a day with one of our industrial partners - €12,000 euros a year (living allowance)

If you’re interested in applying for the Robotics Scholarship, apply here.

If you want to apply for the Data Science Scholarship, fill out the form below and we will contact you about the next steps.

GO TO FORM

If you need more information about either, please contact us at hello@harbour.space

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 QDEZ604 7 250
2 dotorya 7 254
3 300iq 7 586
4 dreamoon_love_AA 6 165
5 Hazyknight 6 169

Congratulations to the best hackers:

Rank Competitor Hack Count
1 Haunted_Cpp 8
2 7qk 4
3 Jobaidul 3
4 Abu_Musa_99 3
5 aihay 2
37 successful hacks and 149 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A Sonechko 0:01
B usertab34 0:04
C KhaleD_ 0:04
D edisonhello 0:02
E Roundgod 0:23
F QDEZ604 0:38
G 300iq 0:44

UPD: Editorial is out

Read more »

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

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

1132A - Regular Bracket Sequence

Tutorial
Solution (BledDest)

1132B - Discounts

Tutorial
Solution (Roms)

1132C - Painting the Fence

Tutorial
Solution (BledDest)

1132D - Stressful Training

Tutorial
Solution (PikMike)

1132E - Knapsack

Tutorial
Solution (BledDest)

1132F - Clear the String

Tutorial
Solution (Roms)

1132G - Greedy Subsequences

Tutorial
Solution (adedalic)

Read more »

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

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

Hello Codeforces!

On Mar/05/2019 18:05 (Moscow time) Educational Codeforces Round 61 (Rated for Div. 2) will start.

This round is organised in collaboration with Hello Muscat Programming Bootcamp and supported by Sberbank, General Partner of the boot camp and one of the largest banking leaders of Eastern Europe, providing thousands of jobs and innovation in the financial industry.

As the Hello Muscat Programming Bootcamp’s General Partner, Sberbank made it possible for students from some of the world’s top universities to attend the bootcamp, by sponsoring their participation. This includes students from Saint-Petersburg State University, Moscow Institute of Physics and Technology (MIPT), Penza State University, National Research Mordovia State University; MRSU, ITMO, Higher School of Economics / Moscow, Volgograd State Technical University, Lobachevsky State University of Nizhni Novgorod, Moscow Aviation Institute, Tyumen industrial University, University of Haifa, Northern (Arctic) Federal University, Saratov State University, Ural Federal University.

Hello Muscat Bootcamp will take place from 9th to 15th of March, and 120 students from 24 universities, including MIPT, Saint Petersburg State University and University of Tokyo will compete and practice side-by-side, smoothing the road towards the April World Finals in Porto.

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 7 problems and 2 hours to solve them.

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

Good luck to all participants!

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 V--gLaSsH0ldEr593--V 7 321
2 kmjp 7 380
3 Kilani 7 452
4 neal 7 721
5 I_love_Tanya_Romanova 6 204

Congratulations to the best hackers:

Rank Competitor Hack Count
1 algmyr 121
2 MarcosK 119:-6
3 mohammad.h915 60:-1
4 MohamedAhmed04 50
5 AhmedMaherAli 45:-1
1837 successful hacks and 1117 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A V--gLaSsH0ldEr593--V 0:01
B 1021869 0:03
C V--gLaSsH0ldEr593--V 0:08
D V--gLaSsH0ldEr593--V 0:24
E TripleM5da 0:20
F _Ash__ 0:06
G road_to_9k_mmr 0:25

UPD: Editorial is out

Read more »

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

By PikMike, history, 10 months ago, In English,

1117A - Best Subsegment

Tutorial
Solution (adedalic)

1117B - Emotes

Tutorial
Solution (Vovuh)

1117C - Magic Ship

Tutorial
Solution (Roms)

1117D - Magic Gems

Tutorial
Solution (Reziba)

1117E - Decypher the String

Tutorial
Solution (BledDest)

1117F - Crisp String

Tutorial
Solution (PikMike)

1117G - Recursive Queries

Tutorial
Solution (adedalic)

Read more »

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

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

Hello Codeforces!

On Feb/18/2019 18:40 (Moscow time) Educational Codeforces Round 60 (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 extented 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov, Abizer Reziba Lokhandwala and me.

Good luck to all participants!

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

Attention tech specialists!

Harbour.Space Barcelona is proud to announce a collaboration with one of our industrial partners to offer a fully funded scholarship for our one year Master’s in Data Science Programme at HSU Barcelona.

The Scholarship includes:

  • Full coverage of the Programme’s tuition fee (€23,000 value)
  • 3 hours of study a day at Harbour.Space University
  • 4 hours of internship a day with one of our industrial partners
  • €12,000 euros a year (living allowance)

Our data science programme will feature super star teachers like Mike Mirzayanov (Advanced Algorithms and Data Structures), Alexey Dral (Big Data: Map Reduce, Spark, BigTable/HBase) and Alex Dainiak (Discrete Optimisation), plus many more.

Harbour.Space is unique because:

  1. We don’t play by the rules. We bring practicing professionals, not only academic teachers, who come teach for intense, 3 week modules. HSU students are encouraged to experiment, fail, and try again, until they succeed.

  2. We are your home. Harbour.Space is a community of over 40 nationalities, and we're still growing.

  3. We provide an experience. Harbour.Space University is located in Barcelona, one of the most vibrant cities of our time.

If you are interested in the scholarship, fill out the form below and we will contact you about the next steps.

FILL OUT FORM

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 kmjp 7 258
2 dreamoon_love_AA 7 269
3 BigBag 7 376
4 Benq 7 573
5 step_by_step 6 178

Congratulations to the best hackers:

Rank Competitor Hack Count
1 FST-OIer 65:-8
2 stefdasca 23:-5
3 Orion 11
4 prohor.b 10
5 MattG 9
344 successful hacks and 480 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A tataky 0:01
B KieranHorgan 0:03
C step_by_step 0:11
D Gloid 0:11
E Benq 0:10
F TripleM5da 0:34
G tfg 0:16

UPD: The editorial is out

Read more »

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

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

1107A - Digits Sequence Dividing

Tutorial
Solution (Vovuh)

1107B - Digital root

Tutorial
Solution (Ne0n25)

1107C - Brutality

Tutorial
Solution (Vovuh)

1107D - Compression

Tutorial
Solution (Vovuh)

1107E - Vasya and Binary String

Tutorial
Solution (Roms)

1107F - Vasya and Endless Credits

Tutorial
Solution (Roms)

1107G - Vasya and Maximum Profit

Tutorial
Solution (Roms)

Read more »

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

By PikMike, history, 11 months ago, translation, In English,

Hello Codeforces!

On Jan/26/2019 18:35 (Moscow time) Educational Codeforces Round 59 (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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

UPD: You can discuss the problems after the contest on a local Discord server.

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

Hello Codeforces!

A quick reminder to check out the Hello Muscat Programming Bootcamp!

Every day, both the Hello Programming Bootcamp and the Moscow ICPC Workshop will be competing simultaneously, 4,000 kilometers from each other — our camp will take place in Oman, from March 9th to March 15th, 2019 — registration is still open for this unique opportunity, so be sure to give it a look, we would love to see you there with us!

REGISTER FOR THE BOOTCAMP

And, don’t forget that Harbour.Space University’s opportunity for a fully funded Master’s in Robotics programme scholarship is still open! Head over to their website to see the details, and apply before the registration date closes.

APPLY HERE

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 V--gLaSsH0ldEr593--V 7 198
2 Radewoosh 7 358
3 Rzepa 7 396
4 eddy1021 6 170
5 spacewanker 6 175

Congratulations to the best hackers:

Rank Competitor Hack Count
1 _bacali 39:-44
2 Kiri8128 8
3 tymo 5:-1
4 CoodeForces 4
5 Sevlll 5:-4
121 successful hacks and 527 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A V--gLaSsH0ldEr593--V 0:01
B neal 0:02
C neal 0:05
D V--gLaSsH0ldEr593--V 0:10
E DankShadow 0:10
F V--gLaSsH0ldEr593--V 0:44
G Kalam 0:17

UPD2: The editorial is out

Read more »

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

By PikMike, history, 11 months ago, In English,

1101A - Minimum Integer

Tutorial
Solution (BledDest)

1101B - Accordion

Tutorial
Solution (Vovuh)

1101C - Division and Union

Tutorial
Solution (adedalic)

1101D - GCD Counting

Tutorial
Solution (PikMike)

1101E - Polycarp's New Job

Tutorial
Solution (PikMike)

1101F - Trucks and Cities

Tutorial
Solution 1 (adedalic)
Solution 2 (adedalic)

1101G - (Zero XOR Subset)-less

Tutorial
Solution (PikMike)

Read more »

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

By PikMike, history, 11 months ago, translation, In English,

Hello Codeforces!

On Jan/11/2019 17:35 (Moscow time) Educational Codeforces Round 58 (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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Roms Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov, Grigory V--gLaSsH0ldEr593--V Reznikov and me.

Good luck to all participants!

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 krijgertje 7 182
2 dreamoon_love_AA 7 191
3 KrK 7 196
4 TadijaSebez 7 217
5 palayutm 7 217

Congratulations to the best hackers:

Rank Competitor Hack Count
1 _bacali 457:-133
2 MarcosK 252:-6
3 nikit523 129:-6
4 greencis 139:-29
5 djm03178 68:-3
1967 successful hacks and 1152 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A bazsi700 0:00
B sorry_stefdasca_snsdsux 0:04
C bazsi700 0:07
D Yuki_Matsui 0:17
E 504 0:03
F krijgertje 0:48
G RUSH_D_CAT 0:11

UPD: The editorial is out

Read more »

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

By PikMike, history, 11 months ago, translation, In English,

1096A - Find Divisible

Tutorial
Solution (PikMike)

1096B - Substring Removal

Tutorial
Solution (Vovuh)

1096C - Polygon for the Angle

Tutorial
Solution (adedalic)

1096D - Easy Problem

Tutorial
Solution (PikMike)

1096E - The Top Scorer

Tutorial
Solution (PikMike)

1096F - Inversion Expectation

Tutorial
Solution (PikMike)

1096G - Lucky Tickets

Tutorial
Solution 1 (adedalic)
Solution 2 (BledDest)

Read more »

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

By PikMike, history, 11 months ago, translation, In English,

Hello Codeforces!

On Dec/28/2018 17:35 (Moscow time) Educational Codeforces Round 57 (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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Ajosteen Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov, Soroush Tabesh Soroush.T and me.

Good luck to all participants!

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 chuochuo 7 222
2 Traxex_ 7 270
3 quailty 7 281
4 hitman623 7 285
5 E.Space 7 316

69 successful hacks and 296 unsuccessful hacks were made in total! The table doesn't look that interesting this time, so I won't include it.

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A irkstepanov 0:00
B ChiIIi 0:03
C Qing_Yang 0:06
D aleex 0:07
E chuochuo 0:57
F isaf27 0:19
G 300iq 0:06

UPD: Editorial is out

Read more »

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

By PikMike, history, 12 months ago, translation, In English,

1093A - Dice Rolling

Tutorial
Solution (Vovuh)

1093B - Letters Rearranging

Tutorial
Solution (Vovuh)

1093C - Mishka and the Last Exam

Tutorial
Solution (PikMike)
Naive (PikMike)

1093D - Beautiful Graph

Tutorial
Solution (Ajosteen)

1093E - Intersection of Permutations

Tutorial
Solution (PikMike)

1093F - Vasya and Array

Tutorial
Solution (Ajosteen)

1093G - Multidimensional Queries

Tutorial
Solution (BledDest)
Solution (PikMike)

Read more »

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

By PikMike, history, 12 months ago, translation, In English,

Hello Codeforces!

On Dec/15/2018 17:35 (Moscow time) Educational Codeforces Round 56 (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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Ajosteen Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

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

Hello Codeforces!

We are excited to announce that the Hello Muscat Programming Bootcamp registration is open! The camp will take place from March 9th to March 15th, 2019, and our early bird discount of 15% is going until December 15th!

This next edition in our Hello Programming Bootcamp will run in parallel with the traditional Moscow ICPC Workshop — both Bootcamps’ contests will be identical, and contestants will be able to see their position in the General Leaderboard. Every day, both camps will be competing simultaneously, 4,000 kilometers from each other!

REGISTER FOR THE BOOTCAMP

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 waynetuinfor 7 190
2 nuip 7 226
3 Ali.Sh 7 246
4 danya.smelskiy 7 252
5 Batrr 7 272

Congratulations to the best hackers:

Rank Competitor Hack Count
1 9646516 75:-20
2 interestingLSY 49:-24
3 NIKITA_BY 12:-1
4 katana_handler 11
5 marismmm 8
298 successful hacks and 565 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A sorry_stefdasca_snsdsux 0:01
B anti_my_abis 0:02
C Golovanov399 0:05
D Golovanov399 0:09
E ko_osaga 0:25
F gritukan 0:28
G tfg 0:09

UPD: Editorial is out

Read more »

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

By PikMike, history, 12 months ago, translation, In English,

1082A - Vasya and Book

Tutorial
Solution (Ajosteen)

1082B - Vova and Trophies

Tutorial
Solution (Ajosteen)

1082C - Multi-Subject Competition

Tutorial
Solution (adedalic)

1082D - Maximum Diameter Graph

Tutorial
Solution (PikMike)

1082E - Increasing Frequency

Tutorial
Solution (adedalic)

1082F - Speed Dial

Tutorial
Solution (PikMike)

1082G - Petya and Graph

Tutorial
Solution (Ajosteen)

Read more »

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

By PikMike, history, 12 months ago, translation, In English,

On Nov/28/2018 17:35 (Moscow time) Educational Codeforces Round 55 (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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Mike MikeMirzayanov Mirzayanov, Roman Ajosteen Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

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

Hello Codeforces!

We are excited to announce that the Hello Muscat Programming Bootcamp registration is open! The camp will take place from March 9th to March 15th, 2019, and our early bird discount of 15% is going until December 15th!

This next edition in our Hello Programming Bootcamp will run in parallel with the traditional Moscow ICPC Workshop — both Bootcamps’ contests will be identical, and contestants will be able to see their position in the General Leaderboard. Every day, both camps will be competing simultaneously, 4,000 kilometers from each other!

REGISTER FOR THE BOOTCAMP

We would also like to remind you that the deadline for applying to the Master’s in Robotics programme scholarship will close November 30th, so we encourage you to check out the website to see the all the requirements and apply!

APPLY HERE

UPD: You can discuss the problems after the contest at a local Discord server.

UPD2:

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 I_love_Tanya_Romanova 7 157
2 theodor.moroianu 7 330
3 halyavin 7 361
4 Radewoosh 6 158
5 palayutm2001 6 190

Congratulations to the best hackers:

Rank Competitor Hack Count
1 halyavin 131:-8
2 zdw1999 55:-4
3 Marcosk 42:-1
4 ismagilov.code 64:-48
5 garipov.roma 48:-24

1354 successful hacks and 1065 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A I_love_Tanya_Romanova 0:02
B Dalgerok 0:04
C I_love_Tanya_Romanova 0:08
D hitman623 0:15
E lqs2015 0:11
F ko_osaga 0:47
G RomaWhite 0:08

UPD3: Editorial is out

Read more »

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

By PikMike, history, 13 months ago, translation, In English,

1076A - Minimizing the String

Tutorial
Solution (Vovuh)

1076B - Divisor Subtraction

Tutorial
Solution (PikMike)

1076C - Meme Problem

Tutorial
Solution (adedalic)

1076D - Edge Deletion

Tutorial
Solution (BledDest)

1076E - Vasya and a Tree

Tutorial
Solution (Ajosteen)

1076F - Summer Practice Report

Tutorial
Solution (PikMike)

1076G - Array Game

Tutorial
Solution (BledDest)

Read more »

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

By PikMike, history, 13 months ago, translation, In English,

On Nov/12/2018 17:35 (Moscow time) Educational Codeforces Round 54 (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 extented ACM 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 7 problems and 2 hours to solve them.

The problems were invented and prepared by Roman Ajosteen Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

UPD: There certainly will be a discussion of the problems on the local Discord server shortly after the contest ends. I might join it as well)

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 FCB1234 7 266
2 HIR180 6 129
3 mrscherry 6 152
4 Vergara 6 158
5 Jeel_Vaishnav 6 185

Congratulations to the best hackers:

Rank Competitor Hack Count
1 teapotd 100:-4
2 vlad.raw 52:-5
3 Marcosk 32
4 tataky 28:-5
5 knotValid 23
721 successful hacks and 668 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A Dalgerok 0:01
B Nasic_number_one 0:03
C neal 0:03
D TAMREF 0:14
E shadowatyy 0:13
F killer_god 0:34
G HIT_Jerry 1:03

UPD2: There was an error in problem D which caused some incorrect solutions to get accepted. We will investigate the number of users who were affected by this issue and decide whether the round is rated.

UPD3: We discussed the issue and came up with the following decision:

Those who got accepted earlier and get WA now won't be affected by rating changes. For everyone else (for those who got correct verdict) the contest will be rated.

UPD4: Editorial is out

Read more »

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

By PikMike, history, 14 months ago, translation, In English,

1073A - Diverse Substring

Tutorial
Solution (PikMike)

1073B - Vasya and Books

Tutorial
Solution (Ajosteen)

1073C - Vasya and Robot

Tutorial
Solution (Ajosteen)

1073D - Berland Fair

Tutorial
Solution (PikMike)

1073E - Segment Sum

Tutorial
Solution (Vovuh)

1073F - Choosing Two Paths

Tutorial
Solution (Vovuh)

1073G - Yet Another LCP Problem

Tutorial
Solution (adedalic)

Read more »

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