Hello Codeforces! :3

Yesterday, our small community in Mansoura held its traditional contest **Game of Coders** for the third year. And we are very glad to bring you the contest on Codeforces c:

The mirror contest will be held on Tuesday $$$16^{\tiny{\mbox{th}}} $$$ July 2024 at 19:05 UTC+3.

You will be given 5 hours to solve 13 problems that I have prepared (I hope they are all original). The contest is ICPC style with 20 minutes penalty for each incorrect submission, and problems are not sorted by difficulty, so read all the problems carefully. :3

This is my first time creating a full problemset, and it was a very fun (and exhausting) experience, and I would like to thank the people who I couldn't have done it without:

- TripleM5da, Hagry, no-you-didnt, Khaled_Hegazy, SaraXorSaraXorSara, 0xEmadeddin for testing and saving the day.
- MikeMirzayanov for Codeforces, Polygon, and Testlib.
- ICPC Mansoura Community for amazing organization of the event.
- Yansoon for helping me write the announcement.
- Finally, The Secret Partner for existing.

Hope you enjoy the contest and have fun solving problems. <3

**UPD:** The editorial (not really, just the codes) is finally out! I'll prepare hints and solutions and edit the blog later, hopefully. :3

I love this man :)

This man loves you

++

Interested!

Great Work

Thanks! ^^

The best ❤️

No you

Great contest from great problem setter , really enjoyed it❤️

I'm glad you did! ^^

The Greatest Alive I admire :*

Coolest 3omda ever

Most people told me it would be too late, and they wouldn't be able to participate for the full duration :(

The contest invite isnt there right ? Or will it start to be visible 6 hours before the contest cause now nothing opens and it just says Contest Hasn't Started

I honestly don't know how to link to it :3

I think it's the first one in the GYM page

We still won't know who The Secret Partner is ?

Yessss It's a secret UwU

wedyyyyyy <3

i cannot participate in this contest fully so ill try to solve more problems after but will be there an editorial?

Will try to make an editorial soon :3

Thanks for this nice contest ^_^

I had fun while solving the problems

Good luck in the next <3

Can someone please shed some light on solving F. Fibonacci Strings?

we know that $$$f_x = f_{x-1} + f_{x-2}$$$ and $$$f_1 = s.length(), f_2 = t.length()$$$.

Let's solve it recursively, let $$$func(x,k)$$$ be the $$$k_{th}$$$ character at string $$$x$$$. if $$$k$$$ if greater than $$$f_{x-1}$$$ we can subtract it from $$$k$$$. otherwise, we know that the $$$k_{th}$$$ character in $$$f_{x-1}$$$.

CodeDon't forget to check if $$$x=1, x=2$$$ first.

Thanks a lot for such clear and concise explanation. I tried to implement as u have told me to, but getting WA at testcase 5. Could u please see my code where am I doing it wrong?

CodeMake it

`sizatpos[i] = min(4e18, sizatpos[i - 1] + sizatpos[i - 2]);`

Thanks a trillion man . Now, it got Accepted.

You're welcome

Will there be an editorial?? If not could you atleast allow us to veiw other's submission ;-;

I will try to make an editorial soon. :3

As for the submissions, I don't think I can edit this setting as it's a public gym :c

Spoileroo alr, thnx a lot either way , was a really nice contest , loved the problems , will be looking forward to the editorial :)

Can someone explain The FFT Problem?

Editorial?Waiting for editorial

While the editorial is being made , can you please just release the codes for them and then after a while when the editorial is completed then edit that blog to include the editorial as well

Great idea. Thanks for the suggestion, I just did that!

I'm trying to solve problem H.

SpoilerI tried an approach using dp from 0,0 to n-1,m-1 and n-1,m-1 to 0,0 then take minimum of distances. I tried another approach using priority queue but I can't seem to solve it, hints?

Auto comment: topic has been updated by Eddard (previous revision, new revision, compare).