Sums and GCD : June 2019 ChallengeVideo editorial

penta_gone · June 17, 2019, 9:59am

If you find the video helpful , please help us to keep us motivated , like the video , comment and please subscribe.
This would help me to keep going.

Thank you for watching my videos.

bansalraghav19 · June 17, 2019, 10:00am

Bro make video on intersecting paths

jagga_jasoos · June 17, 2019, 10:11am

YESSSSSSSSSSSSSSS please make one on INTERPATH

penta_gone · June 17, 2019, 10:29am

ohhk man , i will try my best for that.

waqar_ahmad224 · June 17, 2019, 10:48am

Keep up the good work buddy .

penta_gone · June 17, 2019, 11:50am

thanks man , you guys are my real Motivation

penta_gone · June 17, 2019, 12:16pm

i am working on it man.

waqar_ahmad224 · June 17, 2019, 1:25pm

when can we expect editorial for intersecting paths.

ojhasaurabh209 · June 17, 2019, 2:57pm

And here i was using segment trees to maintain the range gcd and then querying it to find the sum.
Though the time complexity would still be O(nlogn) the array to store the prefix gcd and suffix gcd is easier to code.

penta_gone · June 17, 2019, 3:25pm

yes , it is easy to code and a little fast to code too.

penta_gone · June 18, 2019, 1:49am

soon enough hopefully

jagga_jasoos · June 18, 2019, 7:22am

Thank you, you are the real heroes on this platform.

penta_gone · June 19, 2019, 4:23am

well that’s great complement , thank you