Codeforces and Polygon may be unavailable from May 23, 4:00 (UTC) to May 23, 8:00 (UTC) due to technical maintenance. ×

try_kuhn's blog

By try_kuhn, 2 months ago, translation, In English

Hello, Codeforces!

The day before yesterday there was an NTO olympiad. And this Saturday we will hold an official mirror based on her tasks!

The mirror will be held on the Sort Me platform and will be ranked.

Due to the difference of a few days, this is not a mirror, but rather a front camera. But the conditions coincide with both the format of the NTO (except for debuffing) and the format of our rounds: 5 tasks, 2 hours, IOI (test groups), up to 100 points for each task.

The contest will be rated!

Please, participants of the NTO Finals refrain from participating in the mirror of the Olympiad!

Registration is available at link. The contest will start March 23 at 18:00 MSC.

Good luck! May the strongest one win!

Many thanks to Anecstasiya for help in the last task, and also to Alexey Egorov and MEPhI team for excellent organization of the contest and help in testing! Also thanks to sadfun for the opportunity to host the mirror of the Olympiad on the sort-me platform!

Full text and comments »

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

By try_kuhn, 20 months ago, translation, In English

Hello, Codeforces!

Congratulations to the 22 on the start of the new olympiad season! I wish your olympiad season a good one. I especially wish success to 11th graders, who will have to choose universities and apply for them this year.

I would like to invite you to participate in the mirror phase 1 of the National Olympiad in Informatics. The mirror will be held on codeforces.

This competition will be interesting rather for weaker participants (grey — turquoise on codeforces). The contest should not be difficult for experienced competitors.

The [contest_time:392106] will take place at [contest:392106].

  • The competition is by IOI standards (partial points, test groups). You will be given 4 tasks for 5 hours

  • Unrated round

  • Use of any material published before the round is permitted.

Tasks together with me were proofread for errors and tested by Irsanik, xyz., opPO, ma_sad.

Many thanks to MikeMirzayanov for Polygon and Codeforces.

Thanks a lot to Borunov for help with tournament setup in Yandex Contest system!

Registration link:

https://mirror.codeforces.com/contestInvitation/651d518fc4b205723d0e4ef98f78f0370a21fed6

If you have registered:

https://mirror.codeforces.com/contests/392106

Full text and comments »

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

By try_kuhn, 2 years ago, translation, In English

Editorial of [contest:368205].

[problem:375720A]

Editorial
Code

[problem:375720B]

Editorial
Code

[problem:375720C]

Editorial
Code

[problem:375720D]

Editorial
Code

[problem:375720E]

Editorial
Code

[problem:375720F]

Editorial
Code

[problem:375720G]

Editorial
Code

Full text and comments »

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

By try_kuhn, 2 years ago, translation, In English

Hello, Codeforces!

Due to Educational round, olympiad will start at 10 april

The mirror will start tomorrow, 11 of april, at 16:35

Registration closed

Final results were published. Diplomas are out

At [contest_time:368205] will be held [contest:368205]. Everyone can participate in the mirror of the contest. If you are a student of 6th — 9th forms, then fill the form to participate officially.

Contest will follow the IOI rules (test groups, partial solutions). You will be given from 5 to 7 tasks for 3 hours. Standings will be shown after ending of the round.

Thanks kefaa for amazing coordination of the round.

Tasks are checked and tested by oleh1421, gepardo, kartel, xyz., Wind_Eagle, opPO, Vlad.cpp, sadfun, Irpacci, quinque, stasevich_darina, High_Faev, Xennon.

Also thanks MikeMirzayanov for Polygon and Codeforces!

Link for registration to mirror:

https://mirror.codeforces.com/contestInvitation/81d217c46f623d0ee1687c42fa5b350d20c99a14

If you are studing in 6th — 9th grade, you can register to official round if you fill the form:

https://forms.gle/9WwuGwzLxJKpbVP19

After approving you will see contest here:

https://mirror.codeforces.com/contests/368205

Also there is a table, where you can see list of confirmed participants:

https://docs.google.com/spreadsheets/d/1u177Wdyng0GtiI440nJbu6EIMoX7slB-7q2uHUU2cQ8/edit?usp=sharing

In the round you will have english statements.

Final results:

https://drive.google.com/drive/folders/1R23TGM0pdSwioaFrcq49UgEonwtJDF3H?usp=sharing

Good luck! I wish you succesfull solves!

Full text and comments »

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

By try_kuhn, 2 years ago, translation, In English

Hello, Codeforces!

I didn't want to talk here about politics, but yet the thought that this can happen in a civilized society in the 21st century is frightening.

I constantly monitor the situation (I am from Belarus), but I see very conflicting information. Ukrainians, brothers, how are you doing now? Please reply, we are all very worried about you!

Hold on! I hope this fratricidal war ends soon. It's one thing to read about it in books, and another — see everything with your own eyes.

Full text and comments »

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

By try_kuhn, 3 years ago, translation, In English

Hello, Codeforces!

I'm happy to introduce autumn fees, which will be held on Misis platform! Participation is free.

approximate class schedule (it can vary depending on the level of participants)

There is an open question about lectures. Face-to-face lectures will be in Brest. I'm not sure about correspondence, because there is very few time(

Participants can communicate in our discord channel. Also I will be in it, and betweentimes answer the questions. Also, you can write to me in private messages and ask your questions. Unfortunately, I have no possibility to make English version, so it will be only in Russian.

For registration go to this link.

Preliminarily, contests will start at 11:00, will last 4 hours, for every contest will be opened upsolving.

In the misis rating system operates (you will have your color, as on CF, upsolving is rated too), so you will have motivetion to compete.

I want to thank misis, especially Daria Krohina for providing access to the MISiS system!

Good luck & high rating!

Full text and comments »

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

By try_kuhn, 3 years ago, translation, In English

Hello, Codeforces!

Today I wanted to start upsolving long, short tour and final of open olympiad. Where can I upsolve (or find materials of it)?

Full text and comments »

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

By try_kuhn, 3 years ago, translation, In English

Made diplomas of the Olympiad! As a result, we got the following ratio of diplomas:

Total diplomas — 29 (approximately 25%)

First diplomas — 7 (about 5%)

Second diplomas — 12 (about 10%)

Third diplomas — 10 (about 10%)

Link to diplomas:

https://drive.google.com/drive/folders/1RsYBfLAxHlRndZ_m4_FCTG7pPBG2oRdL?usp=sharing

Thank you all for participating in the Olympiad, I wish you all good luck, good mood and high ratings!

Here you can discuss today's Olympiad.

Full text and comments »

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

By try_kuhn, 3 years ago, translation, In English

[contest:329695]

Editorial in PDF:

https://drive.google.com/file/d/1KL723lzYE8tVlgIUveMt2lSWDbd4nccv/view?usp=sharing

[problem:329695A]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn

tutorial
code

[problem:329695B]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn

tutorial
code

[problem:329695C]

Task author: try_kuhn

Translate author: MatesV13

Solution author: Gareton

tutorial
code

[problem:329695D]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn

tutorial
code

[problem:329695E]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn

tutorial
code

[problem:329695F]

Task author: try_kuhn

Translate author: MatesV13

Solution author: Gareton

tutorial
code

[problem:329695G]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn

tutorial
code

[problem:329695H]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn

tutorial
code

[problem:329695I]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn

tutorial
code

[problem:329695J]

Task author: try_kuhn

Translate author: MatesV13

Solution author: try_kuhn, xyz.

tutorial
code

Full text and comments »

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