Abhishek Saini

New CM of Karnataka has ordered Bangalore Police to remove "Zero Traffic Policy". Because of this policy, whenever any VIP used to come, some roads used to be completely blocked for normal public. I am so happy by this announcement. Now next time, whenever any VIP comes to Bangalore, we don't have to spend 4 hours to travel small distances like 10km. We will only have to spend our usual 3 hours for 10km. Cheers to all of us!

C++ newbie getting to know about STL

𝗚𝗼𝘁 𝗜𝗻𝗱𝗶𝗮 𝗥𝗮𝗻𝗸 𝟭 𝗶𝗻 𝘁𝗵𝗲 𝗟𝗲𝗲𝘁𝗰𝗼𝗱𝗲 𝗪𝗲𝗲𝗸𝗹𝘆 𝗖𝗼𝗻𝘁𝗲𝘀𝘁 𝘁𝗼𝗱𝗮𝘆. 𝗪𝗼𝗿𝗹𝗱 𝗥𝗮𝗻𝗸 𝟯𝟮 𝗼𝘂𝘁 𝗼𝗳 𝟮𝟱,𝟬𝟬𝟬+ 𝗳𝗼𝗹𝗸𝘀. 𝗪𝗮𝘀 𝗮𝗯𝗹𝗲 𝘁𝗼 𝘀𝗼𝗹𝘃𝗲 𝗮𝗹𝗹 𝟰 𝗽𝗿𝗼𝗯𝗹𝗲𝗺𝘀 𝗶𝗻 𝟮𝟭 𝗺𝗶𝗻𝘂𝘁𝗲𝘀. All Problems Intuitions - Problem A - Check the count of set bits for each number. If equal to the given count, add to the answer. Problem B - If all are selected that case is always counted. Now sort the elements and check before taking 1st, 2nd, and 3rd in that order. The key idea for checking at every stage is last taken (maximum taken) and the next to take (smallest not taken) are the only two elements that matter. Problem C - Calculate the answer for each machine and take the maximum of that. For an answer for a machine, do a binary search on value - what's the maximum number of alloys that can be made within the allowed cost? Problem D - See that all chosen numbers can be perfect squares - 1, 4, 9 like that Now for all other cases, let's say one element is (perfect_square * X), now this X has to be present in all the other chosen numbers too, that's the only way to make the product perfect square. So take all such sets with multiples of above taken perfect squares. For example if X = 2 then 2, 8, 18 like that. If you found this useful, like this to encourage me to write more such educational posts.