Did I mention MO's algorithm anywhere? Anyway, the types of edges are based on whether they are deleted in the current sqrt batch or they arent.
You can precalculate inverse factorials.
Hi, how would you do it with DP?
Interesting problem with more thinking and less implementation. You can find hints and more discussion here : POI 10 Sums. Problem is from Polish Olympiad in Informatics.
Interesting problem with more thinking and less implementation. You can find hints and more discussion here : POI 10 Sums. Problem is from Polish Olympiad in Informatics.
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 Kharag...
How do you go about learning algorithms or data structures with scarce resources (or weakly translated resources)? I remember learning parallel binary search from a problem set by you, but there wasn't any resource easily available over the internet.
Please use this thread for any simple questions you have. If you can't figure something out, if you want to make a request, or anything else that comes to mind.
This thread will stay alive until the next one is po...
How most people get started?
By solving easy problems, to get a hang of the entire format and the language. For me solving topcoder div 2 250 problems was a great start. I could get them right most of the times with a score >= 220. Then I moved to div 2 500 and then to 1000 as I became better at solving problems.
Why most people do competitive programming?
For me, it seemed interesting when I started out. I wasn't doing really great (topcoder rating was as low as 462, codeforces was around 1300), but there was a sense of satisfaction with every correct answer. Also I have always been interested in mathematical puzzles, and programming contests gave me a way to pursue that interest.
Need idea: Tried to solve it using bitmask + segment tree, but getting WA. Any idea about how to solve this problem efficiently?
