Codeforces Round 895 (Div. 3) Editorial For A,B,C,D,E,F,G

[@manitianajay45]

My CP journey kzbin.info/www/bejne/iHjElGujm71omck

[@ShyamSundar-fx8gp]

Thanks for the fast video editorials solutions. Keep it up !!

[@xyz956]

bro please put the time stamp for each question , btw your way of explaining is too awesome .

[@adarshsinghparihar-iiitk3164]

bro, please keep uploading these videos for every upcoming codeforces contests, your way of explaining is awesooooome❣❣

[@083_tusharsachdeva6]

genuine explaination, thanks

[@aryangoyal9383]

nice one brother , can u tell how to increase my thought process, this was my 5th contest , and this felt somewhat easy, i could do 5 problems , from where i should topis as i have only general knowledge of c++ and i am doing questions with basic syntax; how to learn new things and do questions more fast

[@mayankshakya9200]

Wich college?

[@aryangoyal9383]

iit delhi @@mayankshakya9200

[@manitianajay45]

Tough problems ko sochne ke lie lamba time do. Baaki topics abhi binary search Karo.

[@vedantagrawal3654]

thank you so much, you are an inspiration

[@big-bull4126]

WHat is the difference between rated and unrated contests?? Im new to codeforces i gave a contest but it is showing 'unrated' so that means my rating wont increase ?? i want to increase my rating , how should i give contests , rated or unrated ?? and how to select rated ones ?

[@manitianajay45]

Abhi rating update nahi hue hogi I guess , ya phir kuchh hota div3 main trusted participants karke wo hoga, ab agla div2 de dena wo rated for all hoga.

[@big-bull4126]

@@manitianajay45 ha bhai ratings hogyi update

[@ushrangouhar952]

I have one doubt in problem E. For type1 query, we are updating the final xor value i.e xr but why we are not updating the prefix xors also while processing the query. Dry running the testcases verifies the algorithm but I have doubt in how the solution is working. Why we dont' need to update the prefix xors ?

[@manitianajay45]

In prefix I have stored the xor of all the values between 1 to i and it means prefix does not depend of s, so it will not affect that.

[@ushrangouhar952]

@@manitianajay45 Oh got it. Thanks !!!

[@loudcapricorn5513]

Easy explanation for E problem 💯. Also please suggest some Resources/Videos for Segment Trees.

[@vikashtiwari2175]

Watch his journey video he shared everything , he has pinned the link in comment section

[@manitianajay45]

Codeforces EDU course.

[@loudcapricorn5513]

@@manitianajay45 Okk. Thanks.

[@study-yd6es]

Amazing Work bro

[@Aryannnn09]

bro can you record a live contest solving and upload it after the contest

[@manitianajay45]

I can but it will take time to upload it because video length will be 2 hrs and here in my Village internet it too slow and it took almost 1 hr in uploading 40 min video and I tried live stream(can public after contest) but that's not working well due to internet , but will try virtual contest or contest next time.

[@Aryannnn09]

@@manitianajay45 would love to see that

[@gopal_bhakt_9]

Superb bro🎉

[@sri7340]

achha explanation

[@YasinArafat-hp4wr]

great brother go ahead

[@aviralarpan7350]

OP

[@shreyanshjain1595]

nice explanation bro

[@JuswanthTeeb]

Please consider explaining in English. Thanks!

[@manitianajay45]

agar english aati too phir ..... apple meaning in hindi google pe search nahi karna padta bhai😅😅

[@amankumar_1325]

Sir, I am unable to solve the following problem: Given an array of numbers , perform the following operations: pick two adjacent positive numbers a[i] and a[i+1] and replace the two numbers with either(a[i]%a[i+1]) or (a[i+1]%a[i]). Thus after each operation array's length decreases by one. Task is to find minimum possible length of array that can be achieved by performing the operation any number of times. For example for {1,1,2,3} answer would be 1. Please help me solving the question. By the way nice explanation.

[@manitianajay45]

I guess tha answer will be equal to no of 0's in array and if the no of 0's is 0 then ans will be 1.

[@manitianajay45]

I have considered ai>=0

[@amankumar_1325]

If array is {1,1,1,1} , then answer would be 2

[@manitianajay45]

@@amankumar_1325 why {1,1,1,1] -> {0,1,1},{0,1},{0}

[@amankumar_1325]

You can take positive adjacent number only. So if one of the adjacent number is 0 ,then operation can not be performed