First of all, apologies for a rather long absence, I was a bit tired after Round #694 (Div. 1) in which I got a significant positive rating change. It is always nice to see your work paying off, but let us get back to business.

Codeforces has an excellent archive of training contests, named gyms!

But it is very well possible that you do not know about the one beginner-friendly gym that I want to cover today, and the reason is that it is only available in Russian :|

I translated the statements to English for you, and recorded a problem walkthrough, in case you ever get stuck.

We will cover more gyms from this old but gold series by Saint Petersburg State University in the future, so stay tuned!

will you upload same for div 2 and div1 too ?

I'm not sure if this series contains Div. 1 problemsets, but I'll cover Div. 2 DP training problemset in the future.

Thank you very much Skybytskyi.Nikita

This is great, thanks for doing this! PD: Would be nice if the english PDF can be attached along with the russian one,

I agree. I'll contact Mike when I have enough translated problemsets, but I don't want to waste too much of his time asking him to add each time separately.

I added it for you.

you could have done it yourself, just turn coach mode on in the gym

Oh, thank you! Maybe I was not around when this feature arrived and did not realize that I have such permissions.

Skybytskyi.Nikita In problem J's input file format, I think you wanted to write $$$0 \leq n \leq 22$$$. BTW, Nice Effort :D

Thanks, corrected

How to read ladder.in in java and write output to ladder.out ???? Anyone please help

Hi ! Can you please tell me the meaning of this in problem H "if any two of its elements differ at least two times." At least two times with respect to what ?

I had some trouble understanding it at first but I wrote a solution to verify my understanding.

Here is a better statement:

Thanks :)

Why does your solution to the problem K work ? You said in the video that it is a well known formula. Where can I learn about it ?

CodeDidn't know it's a standard problem when I was trying to solve this problem Toys.

So can you explain your approach. And what is the significance of

`% i`

in the above code ? I mean why does the above code even work.I don't know but after watching this video The Josephus Problem — Numberphile

I can only solve it for $$$k <= 2$$$

Thanks, I got the logic and understood the code

No, Thank you