MrPaul_TUser's blog

By MrPaul_TUser, history, 6 days ago, In English

1593A - Elections

Idea: MikeMirzayanov

Tutorial
Solution

1593B - Make it Divisible by 25

Idea: MikeMirzayanov

Tutorial
Solution

1593C - Save More Mice

Idea: ITMO student team

Tutorial
Solution

1593D1 - All are Same

Idea: MikeMirzayanov

Tutorial
Solution

1593D2 - Half of Same

Idea: MikeMirzayanov

Tutorial
Solution

1593E - Gardener and Tree

Idea: MikeMirzayanov

Tutorial
Solution

1593F - Red-Black Number

Idea: MikeMirzayanov

Tutorial
Solution

1593G - Changing Brackets

Idea: nastya_ka

Tutorial
Solution

Read more »

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

By MrPaul_TUser, history, 10 days ago, In English

Hello, Codeforces!

I'm glad to invite you to amazing (we've tried to make it such) Codeforces Round #748 (Div. 3) which will start on Oct/13/2021 17:35 (Moscow time). This round is made by me (MrPaul_TUser), a significant contribution to the round was also made by MikeMirzayanov and BledDest.

The round contains 6-8 problems. The difficulties of the problems are expected 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 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round, it will be a 12-hour phase of open hacks. We tried to make really strong tests — just like you will be surprised if many solutions fail after the contest is over.

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

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) 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 trusted participants of the third division, you must:

  • take part in at least two 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 _c_k_r_, Vladosiya, spotless, Yousry, powergee101, ncduy0303, I_Remember_Olya_ashmelev, A_Killer, OlegZubkov, mahade31, arjunsanjeev7, and UpS0lver for testing the round and improving tasks.

Good luck and have fun!

UPD Editorial

Read more »

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

By MrPaul_TUser, history, 2 months ago, In English

Ideas: MikeMirzayanov

1560A - Dislike of Threes

Tutorial
Solution

1560B - Who's Opposite?

Tutorial
Solution

1560C - Infinity Table

Tutorial
Solution

1560D - Make a Power of Two

Tutorial
Solution

1560E - Polycarp and String Transformation

Tutorial
Solution

1560F1 - Nearest Beautiful Number (easy version)

Tutorial
Solution

1560F2 - Nearest Beautiful Number (hard version)

Tutorial
Short solution
Long solution

Read more »

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

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

Hello, Codeforces!

I'm glad to invite you to amazing (we've tried to make it such) Codeforces Round #739 (Div. 3) which will start on Aug/18/2021 17:35 (Moscow time). This round is my (MrPaul_TUser) second round a significant contribution to which was also made by MikeMirzayanov, BledDest, DK318, unreal.eugene, and geranazavr555.

The round contains 7-8 problems. The difficulties of the problems are expected 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 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round, it will be a 12-hour phase of open hacks. We tried to make really strong tests — just like you will be surprised if many solutions fail after the contest is over.

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

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) 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 trusted participants of the third division, you must:

  • take part in at least two 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 powergee101, artsin666, WitchOfTruth, ivanzuki, A_Killer, mahade31, I_Remember_Olya_ashmelev, nooinenoojno, Gassa, _c_k_r_, spotless, iankury, UpS0lver, ncduy0303, and Vladosiya for testing the round and improving tasks.

Good luck and have fun!

UPD Editorial

Read more »

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

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

Ideas: MikeMirzayanov.

1551A - Polycarp and Coins

Tutorial
Solution

1551B1 - Wonderful Coloring - 1

Tutorial
Solution

1551B2 - Wonderful Coloring - 2

Tutorial
Solution

1551C - Interesting Story

Tutorial
Solution

1551D1 - Domino (easy version)

Tutorial
Solution

1551D2 - Domino (hard version)

Tutorial
Solution

1551E - Fixed Points

Tutorial
Solution

1551F - Equidistant Vertices

Tutorial
Solution

Read more »

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

By MrPaul_TUser, 3 months ago, translation, In English

Hello, Codeforces!

I'm glad to invite you to amazing (we've tried to make it such) Codeforces Round #734 (Div. 3) which will start on Jul/23/2021 17:35 (Moscow time). This round is the first "trial of the pen" of me (MrPaul_TUser) and it seems to be hard to make it alone — a significant contribution was made by MikeMirzayanov, BledDest and DK318.

The round contains 6-7 problems. The difficulties of the problems are expected 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 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round, it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6-7 problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) 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 trusted participants of the third division, you must:

  • take part in at least two 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 WolfBlue, BlueDiamond, harlequen, -is-this-fft-, le.mur, Bench0310, Reiva5, Golovanov399 and Sho for testing the round and improving tasks.

Good luck and have fun!

UPD

Editorial

Read more »

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