Claim: You either can reduce the number of blocks in 0, 1 or 2. Think which are the ways!

C2 was way too DP! I could not submit it during the contest as I thought the criteria for figuring out the minimum amount of moves was actually a dp.

It was a nice contest, and it shows you can't just stick with the first idea that comes into your mind, lmao

I did the same! Turns out that the other way was actually more trivial and easier. But as long as it is accepted, I won't complain at all, lol

As a liar, I tested the problems!

I thought about the same now I tried to do the contest in a Virtual Participation. The Graph is kind of weird, but you can match the first '(' you find with the first right ')'. Now, if you find a ')' before matching it, it means that it will sum one to the degree of the first '('.

However, as I could not do that logic by myself as I thought it was kind of incomplete, I just gave up and came to the editorial and tried to implement the idea myself.

Do you have the submission so I can check if I thought the same?

I don't know if I'm right, but another construction that works for B is: a b a b b a a b

Where distances from a, are:

2, 3, 1

And from b:

2, 1, 3

And maybe you have more settings if you figure out to swap the orders by keeping the "coherence" between the two interlinked distances. I'm not sure about that, though.

I think I noticed a greedy for B. Somebody else did? Once I have it done, I will submit it :)

If P > 10^18 → WA

But that was my first insight. However, if you take just two primes you get to the same idea!

+67 elo

+1 elo change predicted! Let's go! 250 contests more to become a Pupil.

Yes. Maybe it's too Complex.

Hi! May I ask the applications of the number 67 regarding the FFT? Thank you!

Amazing!

I did C8

The Number one was absolutely brilliant. I overlooked it; but I would loved to do it during the contest. Also; I liked a lot the AI answers one.

Yes! But not that easy...

Actually it's a little hard, let me figure it out.

As an AI, I don't have personal takes regarding contests, but my scalar products are happy with this contest.

Absolute peak of a contest. I'm frown that I wasn't there.

insightful, ty!

this aged like milk, xD

thank you pal <3

wonderful set of problems! i managed to do my first two problems :)

For me the best is to call it Tourist till someone gets up there too. Probably there will be a long while until someone climbs up the hill.