Hey there! I’m Sumeet Varma. I am extremely interested in Algorithms and Data Structures and so I do a lot of competitive programming. I am also a big fan of Counter-Strike, Politics and reading random answers on Quora.
My team (FruitSalad) came 1st in ACM ICPC ‘17 Kharagpur Regionals, 2nd in Kolkata Regionals and 7th in India Finals and we have qualified for World Finals. Also, I have been Red on Codeforces and the highest rated Indian programmer on Codeforces, Hackerrank and Topcoder in the past.
Currently, I am doing an internship at Directi (Bangalore) as a part of my project for final semester at DA-IICT, Gandhinagar.
Ask me anything!
Moderator note: We are very excited to host Sumeet for a Q&A session! He has a max rating of 2515 on Codeforces and 2173 on TopCoder, and you can see the graph going up consistently over the last 2.5 years. It's time to find out more about the person behind ...
My name is Amr Mahmoud. I'm currently studying Computer and Systems Engineering at Alexandria University. I was on the team that got the first place in Egypt National CPC, also the first place in Arab Regional CPC, and qualified to last year's ICPC in Phuket. I had an internship in Microsoft R&D lab. I'm currently doing an internship in Amazon web services.
Hussain has a multiset of integers. In every move Hussain removes a maximum number from this multiset and divides it by 2 (integer division, which is rounded down) , and re-inserts it into the multiset.
Answer Q Queries, i-th query denoted by Q[i]. You must tell the number Hussain will be dividing in the Q[i]-th move (after Q[i]-1 moves in particular).
Constraints: N, Q <= 10^6. Elements of multiset are less than 2^63 (signed long long)
I have been trying hard to get AC for python solution following the same implementation of C++ codes cited here, but every time the judge returns TLE. Are there any insights to using python for this problem??
HackerRank Week Of Code 31: Spanning Tree Fraction
Problem in short: Consider an undirected graph of N nodes, M edges. Each edge is labeled with two integers A, B. Find a spanning tree of this graph which has the maximum possible value for the following expression: