### Gol_D's blog

By Gol_D, history, 7 weeks ago,

1660A - Vasya and Coins

Idea: MikeMirzayanov

Tutorial
Solution

Tutorial
Solution

1660C - Get an Even String

Idea: MikeMirzayanov

Tutorial
Solution

1660D - Maximum Product Strikes Back

Idea: Aris

Tutorial
Solution

1660E - Matrix and Shifts

Idea: myav, MikeMirzayanov

Tutorial
Solution

1660F1 - Promising String (easy version)

Idea: MikeMirzayanov

Tutorial
Solution

1660F2 - Promising String (hard version)

Idea: MikeMirzayanov

Tutorial
Solution

• +50

By Gol_D, history, 5 months ago,

1619A - Square String?

Idea: MikeMirzayanov

Tutorial
Solution

1619B - Squares and Cubes

Idea: MikeMirzayanov

Tutorial
Solution

Idea: MikeMirzayanov

Tutorial
Solution

1619D - New Year's Problem

Tutorial
Solution

1619E - MEX and Increments

Idea: SixtyWithoutExam

Tutorial
Solution

1619F - Let's Play the Hat?

Idea: MikeMirzayanov

Tutorial
Solution

1619G - Unusual Minesweeper

Idea: Gol_D

Tutorial
Solution

1619H - Permutation and Queries

Idea: Brovko

Tutorial
Solution

• +73

By Gol_D, history, 6 months ago,

1611A - Make Even

Idea: MisterGu

Tutorial
Solution

1611B - Team Composition: Programmers and Mathematicians

Idea: MikeMirzayanov

Tutorial
Solution

1611C - Polycarp Recovers the Permutation

Idea: MikeMirzayanov

Tutorial
Solution

1611D - Weights Assignment For Tree Edges

Idea: MikeMirzayanov

Tutorial
Solution

1611E1 - Escape The Maze (easy version)

Tutorial
Solution

1611E2 - Escape The Maze (hard version)

Tutorial
Solution

1611F - ATM and Students

Idea: Gol_D, MikeMirzayanov

Tutorial
Solution

1611G - Robot and Candies

Idea: MikeMirzayanov

Tutorial
Solution

• +51

By Gol_D, 6 months ago,

Hello! Codeforces Round #756 (Div. 3) will start at Nov/25/2021 17:35 (Moscow time). You will be offered 7-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 ACM-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-8 problems and 2 hours and 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 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 teams: MikeMirzayanov, MisterGu, myav, Vladosiya, Aris, SixtyWithoutExam and me Gol_D.

Also many thanks to God_Of_Code, Bugman, FlakeLCR, Igorjan94, Jester, KHiMAeRA, KerakTelor, Loolo, Matheus, Resende, teraqqq, dedlocc, doreshnikov, kbats183, kocko, vsinitsynav and pashka for testing the contest and valuable feedback.

Good luck!

UPD: Editorial