Vladosiya's blog

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

1932A - Thorns and Coins

Idea: denk

Tutorial
Solution

1932B - Chaya Calendar

Idea: Vladosiya

Tutorial
Solution

1932C - LR-remainders

Idea: MikeMirzayanov

Tutorial
Solution

1932D - Card Game

Idea: goncharovmike

Tutorial
Solution

1932E - Final Countdown

Idea: step_by_step

Tutorial
Solution

1932F - Feed Cats

Idea: denk

Tutorial
Solution

1932G - Moving Platforms

Idea: denk

Tutorial
Solution

Full text and comments »

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

By Vladosiya, history, 10 days ago, translation, In English

1931A - Recovering a Small String

Idea: myav Prepared by: myav

Tutorial
Solution

1931B - Make Equal

Idea: MikeMirzayanov Prepared by: Vladosiya

Tutorial
Solution

1931C - Make Equal Again

Idea: senjougaharin Prepared by: senjougaharin

Tutorial
Solution

1931D - Divisible Pairs

Idea: MikeMirzayanov Prepared by: Vladosiya

Tutorial
Solution

1931E - Anna and the Valentine's Day Gift

Idea: Gornak40 Prepared by: Gornak40

Tutorial
Solution

1931F - Chat Screenshots

Idea: senjougaharin Prepared by: senjougaharin

Tutorial
Solution

1931G - One-Dimensional Puzzle

Idea: senjougaharin Prepared by: senjougaharin

Tutorial
Solution

Full text and comments »

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

By Vladosiya, history, 12 days ago, translation, In English

Hello! Codeforces Round 925 (Div. 3) will start at Feb/13/2024 17:35 (Moscow time). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 7 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Problems have been created and written by our team: myav, Gornak40, senjougaharin and Vladosiya.

We would like to thank:

  1. MikeMirzayanov for help with ideas and Polygon and Codeforces platforms.

  2. nigus for red testing.

  3. vladmart, Gheal, KseniaShk for yellow testing.

  4. htetgm for purple testing.

  5. natalina, SashaT9, lockdown, bma20006 for blue testing.

  6. RedDreams for cyan testing.

  7. the_Incharge, Aurora__, Longqiang for green testing

Good luck!

P.S. Happy Valentine's Day!

UPD: Let's continue streak of announces with photo of the authors :)

UPD2: Editorial

Full text and comments »

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

By Vladosiya, history, 2 weeks ago, In English

1927A - Make it White

Idea: MikeMirzayanov

Tutorial
Solution

1927B - Following the String

Idea: MikeMirzayanov

Tutorial
Solution

1927C - Choose the Different Ones!

Idea: MikeMirzayanov

Tutorial
Solution

1927D - Find the Different Ones!

Idea: MikeMirzayanov

Tutorial
Solution

1927E - Klever Permutation

Idea: MikeMirzayanov

Tutorial
Solution

1927F - Microcycle

Idea: MikeMirzayanov

Tutorial
Solution

1927G - Paint Charges

Idea: MikeMirzayanov

Tutorial
Solution

Full text and comments »

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

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

1907A - Rook

Idea: pashka

Tutorial
Solution

1907B - YetnotherrokenKeoard

Idea: pashka, MikeMirzayanov

Tutorial
Solution

1907C - Removal of Unattractive Pairs

Idea: Vladosiya

Tutorial
Solution

1907D - Jumping Through Segments

Idea: MikeMirzayanov, Vladosiya

Tutorial
Solution

1907E - Good Triples

Idea: pashka

Tutorial
Solution

1907F - Shift and Reverse

Idea: pashka

Tutorial
Solution

1907G - Lights

Idea: pashka

Tutorial
Solution

Full text and comments »

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

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

Hello! Codeforces Round 913 (Div. 3) will start at 05.12.2023 17:45 (Московское время). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 6-8 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Problems have been created and written by pashka, MikeMirzayanov and me.

Part of the problems in this round were in the Cyprus Programming Challenge. If you participated in it, please refrain from participating in this round.

We would like to thank:

  1. peltorator, FairyWinx for red testing.
  2. Vladithur, Valters07 for yellow testing.
  3. stefanbalaz2, FBI, SlavicG, flamestorm, SashaT9, mesanu, trainerherp, Ush1su for purple testing.
  4. dan_dolmatov, Yousef.Osama for blue testing.
  5. Sergey140146659, Pa_sha, gas for cyan testing.

Good luck!

UPD: Editorial

Full text and comments »

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

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

Hello, Codeforces!

I wanted to add CERC 2021 to gyms, but I can't seem to find the tests, checkers, and solutions. If you know where they can be found or someone who might have them, please let me know.

UPD: Thanks everyone for help and xiaowuc1 who shared the archive to me!

Full text and comments »

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

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

1881A - Don't Try to Count

Idea: Vladosiya

Tutorial
Solution

1881B - Three Threadlets

Idea: Gornak40

Tutorial
Solution

1881C - Perfect Square

Idea: myav, MikeMirzayanov, Vladosiya

Tutorial
Solution

1881D - Divide and Equalize

Idea: myav

Tutorial
Solution

1881E - Block Sequence

Idea: MikeMirzayanov

Tutorial
Solution

1881F - Minimum Maximum Distance

Idea: senjougaharin

Tutorial
Solution

1881G - Anya and the Mysterious String

Idea: Gornak40

Tutorial
Solution

Full text and comments »

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

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

Hello! Codeforces Round 903 (Div. 3) will start at Oct/12/2023 17:35 (Moscow time). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 7 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Problems have been created and written by our team: myav, Gornak40, senjougaharin and Vladosiya.

We would like to thank:

  1. MikeMirzayanov for Polygon and Codeforces platforms.

  2. SomethingNew, rniya, zwezdinv for red testing.

  3. makrav, snowysecret, AlexanderL, KseniaShk, pavlekn for yellow testing.

  4. gigabuffoon, EgorUlin, KerakTelor, Pa_sha, I_love_geom, petyb, MinaRagy06, toniskrijelj, FynjyBath for purple testing.

  5. Abo_Samrah, dan_dolmatov, pedrosorio, ezdp, azureglow, Chrisedyong, Apachee, arseny2606 for blue testing.

  6. t0rtik, Sergey140146659, hader239, Modern for cyan testing.

  7. mkshh, petertromso for green testing.

Good luck!

UPD: Editorial

Full text and comments »

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

By Vladosiya, history, 5 months ago, In English

Hello, Codeforces!

We've compiled a list of command lines that Codeforces uses to compile and run solutions in various languages and compilers.

It is up-to-date as of today (2023-10-06), and we will make efforts to keep it current in the future, but this is not guaranteed.

Full text and comments »

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

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

Hello, Codeforces! A month ago, I started working part-time with MikeMirzayanov. It's time to share the results of the first month!

Overall, I've been involved in several things:

Full text and comments »

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

By Vladosiya, history, 6 months ago, In English

Hello, Codeforces!

Today, MikeMirzayanov taught me how to add contests to the Gym, so we've started adding old Google Code Jam rounds. We think it's a good idea to create a comprehensive (or almost comprehensive) archive of all GCJ rounds in the Gym.

I've added 2015 Google Code Jam Round 1A (GCJ 15 Round 1A) and 2015 Google Code Jam Round 1C (GCJ 15 Round 1C) today. It seems that for the 2015 season, only the Finals are missing now. I'll be adding that soon as well!

While Google's archives don't include solutions, we did find a user-generated archive at https://github.com/kamyu104/GoogleCodeJam-2015. However, it would be great to have additional sources for verification.

Would any of you be able to help us find other reliable sources for correct solutions? This way, we can be absolutely sure that all uploaded problems are accurate.

Thank you!

Full text and comments »

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

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

Hello, Codeforces! I made announces of rounds quite often, so some time ago I made a script that gives out the entire list of testers divided by colors. Of course, you can rewrite it a little, so that the order is whatever you want.

Script uses Codeforces API, so first of all you need to go to your account settings and generate API keys and put the open one in the "key" file, and the secret one in the "secret" file in the same folder with the script (or just assign them to the corresponding variables in the script). Now you just need to fill in the array contestids with ids of mashups that you used for testing and run the script. At the end of its work, the script will create file "en.txt " with thanks to all the testers.

I hope it will help you to quickly change the list of testers. Good luck to all and successful rounds!

Script

Full text and comments »

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

By Vladosiya, history, 7 months ago, In English

1851A - Escalator Conversations

Idea: Vladosiya, prepared: Aris

Tutorial
Solution

1851B - Parity Sort

Idea: Vladosiya, prepared: myav

Tutorial
Solution

1851C - Tiles Comeback

Idea: Vladosiya, prepared: myav

Tutorial
Solution

1851D - Prefix Permutation Sums

Idea: Gornak40, prepared: senjougaharin

Tutorial
Solution

1851E - Nastya and Potions

Idea: Vladosiya, prepared: Vladosiya

Tutorial
Solution

1851F - Lisa and the Martians

Idea: Gornak40, prepared: Gornak40

Tutorial
Solution

1851G - Vlad and the Mountains

Idea: Vladosiya, prepared: Vladosiya

Tutorial
Solution

Full text and comments »

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

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

Hello! Codeforces Round 888 (Div. 3) will start at Jul/25/2023 17:35 (Moscow time). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 7 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Problems have been created and written by our team: myav, Aris, Gornak40, senjougaharin and Vladosiya.

We would like to thank:

  1. MikeMirzayanov for Polygon and Codeforces platforms.

  2. tute7627 for red testing

  3. oversolver, sevlll777, pavlekn, zwezdinv, Sokol080808, 74TrAkToR, vladmart, EJIC_B_KEDAX, Vladithur, KseniaShk, Be_dos for yellow testing

  4. moonpie24, FBI, meowcneil, NintsiChkhaidze, Phantom_Performer, SashaT9, spike1236, Kalashnikov for purple testing

  5. TheGoodest, Pa_sha, Sasha0738 for blue testing

  6. Syuzi777, Tahseen for cyan testing

Good luck!

UPD: Editorial

Full text and comments »

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

By Vladosiya, history, 9 months ago, In English

1833A - Musical Puzzle

Idea: Vladosiya, prepared: Vladosiya

Tutorial
Solution

1833B - Restore the Weather

Idea: myav, prepared: myav

Tutorial
Solution

1833C - Vlad Building Beautiful Array

Idea: Vladosiya, prepared: Vladosiya

Tutorial
Solution

1833D - Flipper

Idea: Gornak40, prepared: Aris

Tutorial
Solution

1833E - Round Dance

Idea: MikeMirzayanov, Vladosiya, prepared: senjougaharin

Tutorial
Solution

1833F - Ira and Flamenco

Idea: Gornak40, prepared: Gornak40

Tutorial
Solution

1833G - Ksyusha and Chinchilla

Idea: Gornak40, prepared: Gornak40

Tutorial
Solution

Full text and comments »

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

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

Hello! Codeforces Round 874 (Div. 3) will start at May/19/2023 17:35 (Moscow time). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 6-8 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of our work. Problems have been created and written by ITMO University team: MikeMirzayanov, myav, Aris, Gornak40, senjougaharin and Vladosiya.

We would like to thank: pavlekn, KoT_OsKaR, natalina, vladmart, Phantom_Performer, Be_dos, ctraxxd, diskoteka, lunchbox, kzyKT, MODDI, molney, FEDIKUS, Nickir, 74TrAkToR, kamishogun, KseniaShk, Sokol080808, NintsiChkhaidze, Asad5059, heon for testing the contest and valuable feedback. List of testers will be updated.

Good luck!

UPD: Editorial

Full text and comments »

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

By Vladosiya, 11 months ago, translation, In English

1811A - Insert Digit

Idea: senjougaharin, prepared: senjougaharin

Tutorial
Solution

1811B - Conveyor Belts

Idea: Vladosiya, prepared: senjougaharin

Tutorial
Solution

1811C - Restore the Array

Idea: MikeMirzayanov, prepared: myav

Tutorial
Solution

1811D - Umka and a Long Flight

Idea: Gornak40, prepared: Gornak40

Tutorial
Solution

1811E - Living Sequence

Idea: Aris, prepared: Aris

Tutorial
Solution

1811F - Is It Flower?

Idea: Vladosiya, prepared: Vladosiya

Tutorial
Solution

1811G1 - Vlad and the Nice Paths (easy version)

Idea: Vladosiya, prepared: Vladosiya

Tutorial
Solution

1811G2 - Vlad and the Nice Paths (hard version)

Idea: Vladosiya, prepared: Vladosiya

Tutorial
Solution

Full text and comments »

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

By Vladosiya, 11 months ago, translation, In English

Hello! Codeforces Round 863 (Div. 3) will start at Apr/04/2023 17:35 (Moscow time). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 6-8 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of our work. Problems have been created and written by ITMO University team: MikeMirzayanov, myav, Aris, Gornak40, senjougaharin and Vladosiya.

We would like to thank: Sugar_fan, doreshnikov, powergee101, pashka, KseniaShk, 74TrAkToR, stefanbalaz2, playerr17, diskoteka, BF_OF_Priety, nigus, erankyun, plourde27, Be_dos, donghoony, lucasxia01, Jostic11, sansen, gigabuffoon, akulenok, pwned, vrintle for testing the contest and valuable feedback. List of testers will be updated.

Good luck!

UPD: Editorial

Full text and comments »

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

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

1800A - Is It a Cat?

Idea: Vladosiya, MikeMirzayanov

Tutorial
Solution

1800B - Count the Number of Pairs

Idea: myav

Tutorial
Solution

1800C1 - Powering the Hero (easy version)

Idea: Vladosiya

Tutorial
Solution

1800C2 - Powering the Hero (hard version)

Idea: Vladosiya

Tutorial
Solution

1800D - Remove Two Letters

Idea: MikeMirzayanov

Tutorial
Solution

1800E1 - Unforgivable Curse (easy version)

Idea: Aris, talant

Tutorial
Solution

1800E2 - Unforgivable Curse (hard version)

Idea: Aris, Vladosiya

Tutorial
Solution

1800F - Dasha and Nightmares

Idea: Gornak40

Tutorial
Solution

1800G - Symmetree

Idea: Vladosiya

Tutorial
Solution

Full text and comments »

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

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

I found a small shortage of materials in English on this topic and I want to start with translated article of rationalex:

The problem

We want to learn how to compare root trees for isomorphism (equality up to the renumbering of vertices + the root of one tree necessarily goes to the root of another tree).

Hash of vertex

Note that since we cannot appeal to the vertex numbers, the only information we can operate on is the structure of our tree.

We will consider as a hash of a vertex without children some constant (for example, 179), and for a vertex with children we will use as a hash some function from the sorted list of hashes of children (since we do not know the true order in which the children should go, we need to bring them to the same form). The hash of the root tree will be considered the hash of the root.

By construction, the hashes of isomorphic root trees coincide (the author leaves the proof by induction on the number of levels in the tree to the reader as an exercise).

Polynomial hash is not suitable

Consider 2 trees:

If we calculate for them to take a polynomial hash as a function of children, we get: $$$h(T1)=179+179p+179p^2=179+p(179+179p)=h(T2)$$$

Which hash is suitable?

As a good hash function, for example, this is suitable

$$$h(v)=42 + \sum_{u \in sorted\_by\_hash(child(v))} log(h(u))$$$

For this hash function, it may seem that it is possible not to sort the hashes of children, but this is not the case, because when calculating floating-point numbers, we have an error, and in order for this summation result to be the same for isomorphic trees, it is also necessary to sum the children in the same order.

An example of a more complicated hash function:

$$$h(v)= \big[\sum_{u \in sorted\_by\_hash(child(v))} h(u)^2+h(u)p^i+42\big]\mod2^{64}$$$

Asymptotics

All we need to do at each level is sorting the vertices by hash value and summing, so the final complexity is: $$$O(|V|log(|V|))$$$

I want to continue on my own:

In the reality of Codeforces, these approaches have problems in the form of hacks (which can be seen, for example, by hacks of this task). Therefore, I want to talk about an approach in which there are no collisions.

What is this magic hash function?

Let's sort the hashes of the children for the vertex and match the number to this array, which we will consider the hash of the vertex (if the array is new, then we will assign it the minimum unoccupied number, otherwise we will take the one that has already been given).

Why does it work fast?

It is easy to notice that the total size of the arrays that we counted is $$$n - 1$$$ (each addition is a transition along the edge). Due to this, even using treemap for mapping, all accesses to it will require a total of $$$O(n \cdot log(n))$$$. Comparing a key of size $$$sz$$$ with another key works in $$$O(sz)$$$ and such comparisons for each key will occur $$$O(\log(n))$$$ times, and the sum of all $$$sz$$$, as we remember, is $$$n-1$$$, so it turns out a total of $$$O(n\cdot \log(n))$$$. (You might think that it is worth using hashmap, but this does not improve the asymptotics and causes the probability of a collision).

Full text and comments »

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

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

Hello! Codeforces Round 855 (Div. 3) will start at Mar/02/2023 17:35 (Moscow time). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 6-8 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of our work. Problems have been created and written by ITMO University team: MikeMirzayanov, myav, Aris, Gornak40, senjougaharin and Vladosiya.

We would like to thank: tolbi, lunchbox, Son, sary, Wibo, yorky, nigus, tute7627, 74TrAkToR, bigfoot19982, oversolver, Be_dos, CARBINE, molney, KoT_OsKaR, Nickir, cute_hater, Crutch, vrintle, Rubikun, akulenok, medk, Jostic11, Ghassane for testing the contest and valuable feedback. List of testers will be updated.

Good luck!

UPD: Editorial

Full text and comments »

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

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

1790A - Polycarp and the Day of Pi

Idea: MikeMirzayanov

Tutorial
Solution

1790B - Taisia and Dice

Idea: Gornak40

Tutorial
Solution

1790C - Premutation

Idea: MikeMirzayanov

Tutorial
Solution

1790D - Matryoshkas

Idea: MikeMirzayanov

Tutorial
Solution

1790E - Vlad and a Pair of Numbers

Idea: Vladosiya

Tutorial
Solution

1790F - Timofey and Black-White Tree

Idea: molney

Tutorial
Solution

1790G - Tokens on Graph

Idea: senjougaharin

Tutorial
Solution

Full text and comments »

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

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

Hello! Codeforces Round 847 (Div. 3) will start at Jan/27/2023 17:35 (Moscow time). 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, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks.

You will be given 6-8 problems and 2 hours and 15 minutes to solve them.

Note that the penalty for the wrong submission in this round is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by 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)
  • do 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.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of our work. Problems have been created and written by ITMO University team: MikeMirzayanov, myav, Gol_D, Aris, Gornak40, senjougaharin and Vladosiya. Also this time, molney suggested one of the tasks.

We would like to thank: alwyn, morasha3, csegura, BledDest, stevenkplus, Darko, Coki628, Crutch, Qwerty1232, Jostic11, liouzhou_101, Jeffin, AW_Flister, glebustim, yorky, mango_lassi, 74TrAkToR, ErrorDeveloper, Be_dos, MODDI, Vercingetorix for testing the contest and valuable feedback. List of testers will be updated.

Good luck!

UPD: Editorial

Full text and comments »

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

By Vladosiya, history, 15 months ago, translation, In English

1759A - Yes-Yes?

Idea: MikeMirzayanov

Tutorial
Solution

1759B - Lost Permutation

Idea: MikeMirzayanov

Tutorial
Solution

1759C - Thermostat

Idea: Vladosiya

Tutorial
Solution

1759D - Make It Round

Idea: MikeMirzayanov

Tutorial
Solution

1759E - The Humanoid

Idea: Gornak40

Tutorial
Solution

1759F - All Possible Digits

Idea: senjougaharin

Tutorial
Solution

1759G - Restore the Permutation

Idea: MikeMirzayanov

Tutorial
Solution

Full text and comments »

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