Can someone explain how to approach solution for this problem(http://mirror.codeforces.com/contest/366/problem/C). Any help regarding solving 2d dp problems will be helpful. Any good problems for understanding 2d DP or tutorials will also be helpful. Thanks in advance.

how to calculate ncr % M when the value of n has greater range(n <= 10^12). M = 10^9 + 7.

Can someone explain trie data structure and it's implementation briefly? I can't find good tutorial for it so please explain it. If possible provide some good links from where you have learned it.

Can some one explain LIS, a O(nlog(n)) solution clearly as i couldn't find more resources to learn clearly on internet

I have installed topcoder for the first time but when i open practice rooms only tournaments are opening,(srm's,tch's,marathon's) are not opening. I could not find solution in internet.So please help me over this

I know how to implement dfs using recursion but i couldn't implement bfs using recursion Can some one help me with the recursion code? Thanks in advance..

I have learnt Dijkstra's recently and couldn't implement it effectively. Can some one post your Dijkstra's algo implementation in (c or c++) using stl's. I will use it as reference to implement my code. Thanks in advance..

I have been trying to solve a problem on segmented sieve i.e prime1(http://www.spoj.com/problems/PRIME1/) in spoj but i am getting wrong answer and unable to find the bug in the code. So please help me..

http://ideone.com/JiSxel

How to implement weighted Graph in c++ for higher values of n = 10^5 (n vertices graph)?? If n = 10^3 i generally implement using adjacency matrix or by using vector stl.