solved the practice problem after the session. was good problem (found on lc: sum of floored pairs). Seemed much easier as compared to the problem discussed in the video (since inclusion exclusion was not required but instead prefix sum was needed)
thanks bhaiya for today's stream learned new techniques from your stream and please bhaiya ji weekly 417 and biweekly 417 bhi karlo discuss last ke 2 problems bhi kiye discuss toh bhi chalega aache problems hai hame kuch naya sikhne ko milega.
what if the tweek in the second problem also includes that you should remove the group of suspicious nodes(if multiple suspicious groups exist in the graph) that does not have invoked directly or indirectly from the non suspicious nodes.
![SAFEPLANET - ดาวเคราะห์ [ THE PLANET ]](http://i.ytimg.com/vi/4X1XL3I_k3c/mqdefault.jpg)
very good logic of finding gcd pairs in o(nlogn) now I understand cses problemset is very important for cp
solved the practice problem after the session. was good problem (found on lc: sum of floored pairs). Seemed much easier as compared to the problem discussed in the video (since inclusion exclusion was not required but instead prefix sum was needed)
hats off to you VG...
52:27
thanks bhaiya for today's stream learned new techniques from your stream and please bhaiya ji weekly 417 and biweekly 417 bhi karlo discuss last ke 2 problems bhi kiye discuss toh bhi chalega aache problems hai hame kuch naya sikhne ko milega.
ha plzz
what if the tweek in the second problem also includes that you should remove the group of suspicious nodes(if multiple suspicious groups exist in the graph) that does not have invoked directly or indirectly from the non suspicious nodes.
leetcode contest 417 k videos bana do