D. Kavi on Pairing Duty | Codeforces Round 722 (Div-2)

Finding divisors in log(n): https://codeforces.com/blog/entry/22229 Solution Link: https://codeforces.com/contest/1529/submission/117253982 Hey, My name is Mihir Singh I am an active competitive programmer. You can connect with me here: My codeforces profile: https://codeforces.com/profile/kassutta My LinkedIn profile: https://www.linkedin.com/in/mihir-singh-848531170 My instagram profile: https://www.instagram.com/mihirre_singh/ 10% Discount on any GFG course, Use Code: MIHIR DSA self-paced: https://practice.geeksforgeeks.org/courses/dsa-self-paced Link to all courses: https://practice.geeksforgeeks.org/courses/online Timestamps: 00:00 : Introduction 00:59 : Problem Explanation 03:26 : Solution Approach 23:48 : Final conclusion 29:51 : Code Explanation For any queries: contact us at cp.gatecs@gmail.com Follow us on-- @discord:- https://discord.com/invite/6kcmVQx8Fx @facebook:- https://www.facebook.com/Quarantine-Engineers-107789377679897/ @linkedin :- https://www.linkedin.com/company/quarantine-engineers @instagram :-https://www.instagram.com/quarantine_engineers/ @telegram(Channel) :- https://t.me/quarantine_engineers @telegram(Discussion Forum) :- https://t.me/qe_discussion #Codeforces #Div2 #722