awoo's blog

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

1207A - There Are Two Types Of Burgers

Idea: BledDest

Tutorial
Solution (Roms)

1207B - Square Filling

Idea: BledDest

Tutorial
Solution (BledDest)

1207C - Gas Pipeline

Idea: adedalic

Tutorial
Solution (adedalic)

1207D - Number Of Permutations

Idea: Roms

Tutorial
Solution (Roms)

1207E - XOR Guessing

Idea: adedalic, Neon, BledDest

Tutorial
Solution (BledDest)

1207F - Remainder Problem

Idea: BledDest

Tutorial
Solution (BledDest)

1207G - Indie Album

Idea: adedalic

Tutorial
Solution (PikMike)

Read more »

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

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

Hello Codeforces!

On Aug/22/2019 17:35 (Moscow time) Educational Codeforces Round 71 (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 Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all participants!

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

Hello Codeforces,

We are opening a new campus in Bangkok, Thailand!

We are delighted to introduce a strategic partnership between Harbour.Space University and the University of the Thai Chamber of Commerce – a collaborative effort powered by B.Grimm.

After 3 years of successfully disrupting education in Barcelona, with a unique educational model founded on active learning in entrepreneurship, technology, and design, as well as the most extraordinary academic and professional community on the planet to show for it, we are ready to bring the revolution to our new campus in Bangkok, Thailand.

Scholarships for our Bangkok campus are designed to completely eliminate the barrier between exceptional talents and sophisticated education: they cover the entire tuition fee as well as the cost of living expenses, and furthermore, they provide the student the valuable experience of both studying and working at Harbour.Space University.

Unique opportunities reserved for the most brilliant students from anywhere in the world, our scholarships are more than financial support – they are portals from your past to your future.

If you are graduating or have already completed a bachelor's degree, we are waiting for your applications for fully-funded Master's degree scholarships by the link below.

APPLY HERE→

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 hehezhou 7 235
2 pekempey 7 235
3 TadijaSebez 7 238
4 Barichek 7 241
5 ixy 7 247

467 successful hacks and 688 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A vintage_Vlad_Makeev 0:01
B Dalgerok 0:04
C kmjp 0:12
D KenMuse 0:13
E AkshajK 0:10
F AnotherRound 0:07
G danya.smelskiy 0:26

UPD: Editorial is out

Read more »

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

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

1202A - You Are Given Two Binary Strings...

Idea: adedalic

Tutorial
Solution (adedalic)

1202B - You Are Given a Decimal String...

Idea: adedalic

Tutorial
Solution (adedalic)

1202C - You Are Given a WASD-string...

Idea: adedalic

Tutorial
Solution (adedalic)

1202D - Print a 1337-string...

Idea: Roms

Tutorial
Solution (Roms)

1202E - You Are Given Some Strings...

Idea: Roms

Tutorial
Solution (adedalic)

1202F - You Are Given Some Letters...

Idea: adedalic

Tutorial
Solution (PikMike)

Read more »

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

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

Hello Codeforces!

On Aug/07/2019 17:35 (Moscow time) Educational Codeforces Round 70 (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 Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all participants!

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

Hello Codeforces!

Ready to get deep?

Take a minute and ask yourselves — what skills are I missing, that I would love to have? What are those key qualities that would take me from being a decent developer to an extraordinary one? Am I where I want to be, in terms of personal progress?

At Harbour.Space, we focus on the key technical and social requirements of the jobs of the future. Our three-week courses are designed for students to acquire and develop specific skills through seminars, workshops, projects, and case studies in a very short amount of time.

Mike Mirzayanov’s course, Advanced Algorithms and Data Structures, is a great example of this:

This, in combination with our unique academic environment, extensive professional network, and our seaside campus in the beautiful city of Barcelona, provides for a truly unique learning experience.

Interested?

Fill out the form below, get more information, and see how you can come attend Mike’s course to see what all the fuss is about!

APPLY HERE→

See you soon!

Harbour.Space

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 CSWhisky 6 258
2 tfg 6 302
3 Heltion 6 310
4 jiangly 6 338
5 Geothermal 5 195

109 successful hacks and 290 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A nantf 0:03
B Denverjin 0:11
C Geothermal 0:20
D dhxh 0:10
E lqs2015 0:19
F duxing201606 0:59

UPD: Editorial is out

Read more »

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

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

1197A - DIY Wooden Ladder

Idea: adedalic

Tutorial
Solution (adedalic)

1197B - Pillars

Idea: BledDest

Tutorial
Solution (BledDest)

1197C - Array Splitting

Idea: Roms

Tutorial
Solution (Roms)

1197D - Yet Another Subarray Problem

Idea: BledDest

Tutorial
Solution (Roms)

1197E - Culture Code

Idea: adedalic

Tutorial
Solution (adedalic)

1197F - Coloring Game

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

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

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

Hello Codeforces!

On Jul/22/2019 17:35 (Moscow time) Educational Codeforces Round 69 (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 Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all participants!

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

Hello Codeforces!

We hope your summer is going well!

Last Friday we finished the second edition of the Tech Scouts Summer Camp, with 70 participants, 20 different nationalities and many solved problems. We had 6 participants with a full scholarship thanks to the collaboration between Harbour.Space and Codeforces and we are working on increasing this number next year.

We would also like to remind you that we offer scholarships for our technical programmes, such as Computer Science, Data Science and Cyber Security.

They are set in such a way that doesn’t require additional applications — we believe in merit and potential, and so what you put in your application to the university will be our criteria.

You could be just the diamond we’re looking for, but you’ll never know unless you apply!

APPLY HERE→

UPD2: There will be 6 problems in the contest.

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 Um_nik 6 111
2 Golovanov399 6 174
3 PinkRabbit 6 190
4 dreamoon_love_AA 6 198
5 _twilight 6 232
6 HIR180 6 252

Congratulations to the best hackers:

Rank Competitor Hack Count
1 greencis 122:-29
2 Ali_Zaiback 26
3 racsosabe 22:-7
4 plusplus6408 14
5 F1aMiR3 14:-3
6 crvineeth97 13:-2
397 successful hacks and 420 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A dorijanlendvaj 0:01
B Um_nik 0:04
C beefman 0:06
D Um_nik 0:12
E Benq 0:11
F Um_nik 0:31

UPD3: Editorial is out

Read more »

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

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

1194A - Remove a Progression

Idea: adedalic

Tutorial
Solution (adedalic)

1194B - Yet Another Crosses Problem

Idea: MikeMirzayanov

Tutorial
Solution (PikMike)

1194C - From S To T

Idea: Roms

Tutorial
Solution (Roms)

1194D - 1-2-K Game

Idea: adedalic

Tutorial
Solution (adedalic)

1194E - Count The Rectangles

Idea: adedalic

Tutorial
Solution (Roms)

1194F - Crossword Expert

Idea: adedalic

Tutorial
Solution (adedalic)

1194G - Another Meme Problem

Idea: vovuh

Tutorial
Solution (BledDest)

Read more »

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

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

Hello Codeforces!

On Jul/14/2019 17:45 (Moscow time) Educational Codeforces Round 68 (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 Neon 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 Benq 7 347
2 Geothermal 6 120
3 tmwilliamlin168 6 168
4 neal 6 174
5 square1001 6 174

Congratulations to the best hackers:

Rank Competitor Hack Count
1 algmyr 8:-4
2 Half-Blood_Prince 3:-1
3 El_Profesor_Aegon 2
4 plusplus6408 2
5 Benq 2:-1
47 successful hacks and 344 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A dorijanlendvaj 0:01
B MesyuraTheOldDumbGoblin 0:04
C aneesh2312 0:04
D Benq 0:09
E Denisov 0:21
F Benq 0:15
G ecnerwala 1:07

UPD: Editorial is out

Read more »

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

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

1187A - Stickers and Toys

Idea: MikeMirzayanov

Tutorial
Solution (adedalic)

1187B - Letters Shop

Idea: MikeMirzayanov

Tutorial
Solution (PikMike)

1187C - Vasya And Array

Idea: Roms

Tutorial
Solution (Roms)

1187D - Subarray Sorting

Idea: Roms

Tutorial
Solution (Roms)

1187E - Tree Painting

Idea: BledDest

Tutorial
Solution (Vovuh)
Alternative solution (PikMike)

1187F - Expected Square Beauty

Idea: Roms and adedalic

Tutorial
Solution (adedalic)

1187G - Gang Up

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

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

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

Hello Codeforces!

On Jun/30/2019 17:45 (Moscow time) Educational Codeforces Round 67 (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 Neon 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 Radewoosh 7 220
2 kefaa2 7 346
3 Retired_MiFaFaOvO 6 120
4 square1001 6 136
5 HIR180 6 153

Congratulations to the best hackers:

Rank Competitor Hack Count
1 2014CAIS01 76:-1
2 Prateek 50:-1
3 takumi152 32:-2
4 Holland_Pig 28
5 sys. 37:-24
1268 successful hacks and 1683 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A Geothermal 0:01
B arknave 0:02
C HIR180 0:06
D RUSH_D_CAT 0:22
E Noam527 0:06
F zhoutb 0:28
G Luma 0:46

UPD: Editorial is out

Read more »

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

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

1175A - From Hero to Zero

Idea: Roms

Tutorial
Solution (Roms)

1175B - Catch Overflow!

Idea: awoo

Tutorial
Solution (PikMike)

1175C - Electrification

Idea: adedalic

Tutorial
Solution (adedalic)

1175D - Array Splitting

Idea: adedalic

Tutorial
Solution (Roms)

1175E - Minimal Segment Cover

Idea: adedalic

Tutorial
Solution 1 (PikMike)
Solution 2 (PikMike)

1175F - The Number of Subpermutations

Idea: Roms

Tutorial
Solution (Roms)

1175G - Yet Another Partiton Problem

Idea: adedalic

Tutorial
Solution (adedalic)

Read more »

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

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

Hello Codeforces!

On Jun/05/2019 17:35 (Moscow time) Educational Codeforces Round 66 (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 Neon Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all participants!

UPD:

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

Codeforces! What is the next step in your development?

We understand all about doing things by yourself — after all, we are a startup university, and our student body is exceptional in part because of it’s made up of people who didn’t wait for anyone to show them the way.

If this is you, you belong at Harbour.Space. The purpose of our University is to create a global community of these kinds of people, regardless of age or nationality, because when you’re working by yourself, you can change for the better, but when you work with others, you can change the world.

If you believe you have what it takes, we want you!

The curriculum is part of what makes the modules so special, and the other half? Our outstanding teachers who are leaders in their own respective industries.

Our scholarships are set in such a way that doesn’t require additional applications — we believe in merit and potential, and so what you put in your application to the university will be our criteria.

You could be just the diamond we’re looking for, but you’ll never know unless you apply!

APPLY NOW→

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 mango_lassi 6 145
2 E869120 6 148
3 kefaa2 6 154
4 Egor.Lifar 6 154
5 Yuu 6 157

Congratulations to the best hackers:

Rank Competitor Hack Count
1 Radewoosh 97:-19
2 test_hack 56:-37
3 alvinvaja 30:-10
4 AryaKnight 48:-48
5 nikolapesic2802 30:-14
779 successful hacks and 1077 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A Geothermal 0:01
B mango_lassi 0:05
C nuip 0:07
D Yushen 0:04
E Sehnsucht 0:20
F ---------- 0:05
G LgndryGrandmasturbator 0:47

UPD: The editorial is out

Read more »

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

By awoo, history, 2 years 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 awoo, 2 years 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 Neon 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 sillysilly 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 awoo, history, 2 years 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 awoo, 2 years 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 Neon 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 LiM_256 14:-1
5 hentai_lover_ 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 awoo, history, 2 years 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 awoo, history, 2 years 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 Neon 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 Cirno_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 Nazikk 0:07
D Maripium 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 awoo, history, 2 years 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 awoo, history, 2 years 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 Neon 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 Tqk 4
3 Jobaidul 3
4 Abu_Musa_99 3
5 yahia 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 awoo, history, 2 years 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 awoo, history, 2 years 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 Neon 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 vintage_Vlad_Makeev 7 321
2 kmjp 7 380
3 Shanks 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 Bakry_ 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 vintage_Vlad_Makeev 0:01
B 1021869 0:03
C vintage_Vlad_Makeev 0:08
D vintage_Vlad_Makeev 0:24
E DeadPillow 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 awoo, history, 2 years 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 awoo, history, 2 years 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 LiM_256 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 DeadPillow 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 awoo, history, 2 years 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