Problem C Nikita and LCM Codeforces Round 948 (div 2)

#codeforcessolution #codeforces #coding #cpp

[@platypusperry4176]

Genius!!!....really liked the way u explained it was amazing

[@jeevanalexen]

Thank you soo much for this comment :)

[@Xiover2134]

Amazing explanation 🔥

[@jeevanalexen]

Thank you so much❤

[@sujikrish8586]

Good

[@jeevanalexen]

Thank you for this comment🙌

[@anonymous10906]

finally understood the solution bcz of u man!! Thanks man!!!

[@jeevanalexen]

Thank you for this comment, means a lot❤

[@freebookstore3242]

is good thing

[@jeevanalexen]

Hi, I didnt understand your comment, Please let me know if you have any doubts or need further clarification.

[@freebookstore3242]

@@jeevanalexen this vedio is good thing

[@jeevanalexen]

Can you please comment whether this video was useful or not. This will help me in making much better videos in the future

[@riser636]

Is that code got accepted?

[@jeevanalexen]

Yes, it got accepted

[@riser636]

@@jeevanalexen how!!! You are using double loop. Time got exceeded.

[@jeevanalexen]

@@riser636 first loop is a square root loop

[@riser636]

@@jeevanalexen yeah but it didnt worked. time got exceeded

[@jeevanalexen]

@@riser636 maybe it was the way you are using the map, try to use map.find(), it is O(1) complexity compared to using map the other way which O(logn) complexity.
If you share the link of your submission, I can help you further