Codeforces Global Round 28 | Video Solutions - A to D | by Pradyumn Kejriwal | TLE Eliminators

Here are the video solutions in the form of a post-contest discussion for problems A, B, C, D of Codeforces Global Round 28. The live discussion was done with students of TLE Eliminators, this is the recording of the same. We hope this will be useful for you in up-solving this contest.

Solution Codes:

Be sure to check out TLE Eliminators.

Timestamps:-
00:00 Kevin and Combination Lock
12:26 Kevin and Permutation
23:18 Kevin and Binary Strings
1:02:47 Kevin and Competition Memories

[divypareek]

This explanation is the best, you are great

[abhinavennala]

That was a good proof for the first problem !!

[vampconnoisseur]

For the kevin and binary strings, firstly i tried to store the xor result in long long to compare it, but the constraints on n are 1<= n <= 5000, so i cannot store it in a 64 bit long long, thats why now i understood that only option is to lexicographically compare the binary strings

[SameerSuman-nifz]

solving till A to problem D is enough or shall we solve more of them

[sazid]

This is really helpful! Thank you so much bro.

[stabgoblin]

My implementation of C was kind of similar but it failed on 2nd test case I think the problem is in xor logic or something, I'll upsolve it now

[Anonymous-yfu]

@pradyumnkejriwal3007 hey, just wanted to ask are you currently not in India cause your timezone is different? Excellent explanation btw!

[vibhanshusharma]

😶😶 I do everything same to same but just one place do replace 0->1 whole code became mess i quit then 😂😂😂

[bhavyashah]

Prady s D was copied, his contest is skipped😂😂