Thank you so much for the amazing post-contest discussion! The way you explained everything was so smooth, easy to follow, and incredibly beginner-friendly. Your ability to break down complex problems and present them in such an excellent manner truly stands out. It's always a pleasure learning from you! We look forward to seeing you in the upcoming solve videos! Your explanations and approach are always so insightful and motivating. Can't wait to learn more from you!
But if we consider a particular bit position and set it to 1 in all the three numbers then also for that Position after the xor the bit will be 1 hence it also maximizes. Because (1^1)^1=1.
we are breaking out of the loop as soon as we find a number that is neither equal to a nor equal to b , for example if l was 10 r was 100 , a was 11and b was 10 we would break out of the loop as soon as we reach 12
@@setyourhandle2997 thanks bhai , one more question how can we say that after setting a and b like that then our max answer will be independent i hope you are getting like we if our l=50 and r=60 , and then if a was coming as =54 and b=58 (just consider) then our c will be coming as 50 right , but what the proof that like a^b will get maximise but we are not having any proof for b^c and c^a
@@Travel-s5e if you work it out you will realize that if we choose a and b like this as stated in solution , then whatever our c will be , the final answer will be the same , only c has to be not equal to a and b
can anybody tell me why when l is something of 00000 and r is something or 111111 then we know our a=100000.. and b=01111.... and if we are taking c as 0 then we can get a^b = max of all with all bit set and b^c = here we can get b c^a = here we can get a so answer looks like A^B + A + b any bhai or sir help please
Yes it gave TLE for me also, during the contest when I submitted the code it didn’t give TLE that time, it got submitted successfully, but after the contest when the time for doing the rating changes has come, then it showed TLE 😢
Please fill the Feedback form for PCD: forms.gle/n7DYKU4zv5ztXiMTA
Thank you so much for the amazing post-contest discussion! The way you explained everything was so smooth, easy to follow, and incredibly beginner-friendly. Your ability to break down complex problems and present them in such an excellent manner truly stands out. It's always a pleasure learning from you!
We look forward to seeing you in the upcoming solve videos! Your explanations and approach are always so insightful and motivating. Can't wait to learn more from you!
no solution for D?
But if we consider a particular bit position and set it to 1 in all the three numbers then also for that Position after the xor the bit will be 1 hence it also maximizes. Because (1^1)^1=1.
thanks for the easy editorial
Solution of D please
nice explanation soumojit
good explanation.
thank you tle
my codeforces doesn't show calendar on right side. why is that?
best explanation
How can i buy TLE eliminator level 1 and 2 courses 12 version
TLE on test case 11 for problem B for your code
nice explanation
where can I join live classes?
it's for tle students who get the zoom meeting link for the pcd...rest have to watch through the yt upload only
TLE Eliminator website
can anybody tell me why that l to r loop not giving tle
we are breaking out of the loop as soon as we find a number that is neither equal to a nor equal to b , for example if l was 10 r was 100 , a was 11and b was 10 we would break out of the loop as soon as we reach 12
@@setyourhandle2997 thanks bhai , one more question how can we say that after setting a and b like that then our max answer will be independent i hope you are getting like we if our l=50 and r=60 , and then if a was coming as =54 and b=58 (just consider) then our c will be coming as 50 right , but what the proof that like a^b will get maximise but we are not having any proof for b^c and c^a
@@Travel-s5e if you work it out you will realize that if we choose a and b like this as stated in solution , then whatever our c will be , the final answer will be the same , only c has to be not equal to a and b
do anyone know when will batch 13 of tle eliminators start??
so near to c! didnt code but approach was almost same i just wasted my time so that i could choose c optimally but it wasn't even needed hahhaa
can anybody tell me why when l is something of 00000 and r is something or 111111 then we know our a=100000.. and b=01111.... and if we are taking c as 0 then we can get
a^b = max of all with all bit set and
b^c = here we can get b
c^a = here we can get a
so answer looks like A^B + A + b
any bhai or sir help please
i solved A,B in 30 min for the next 2hr i tried C this logic came into my mind but still could not solve it..
btw nice explanation..
same 26 min for a,b but tried for 1 and half hour for c but didn't get any solid idea
bhai the intutioh of third i also got but i have implememntation issue
b gave TLE i wrote it similar
yes same, atleast cf should told us during the contest, we could have optimized
Yes it gave TLE for me also, during the contest when I submitted the code it didn’t give TLE that time, it got submitted successfully, but after the contest when the time for doing the rating changes has come, then it showed TLE 😢
For some it has not given TLE
@@CHILLBRO-e7y it’s very unfair ☹️, this is the second time it happened with me now
@@tanmaisaichennagiri5543 i think it is due to unordered_map