Today, while browsing, I've found a nice site named Algomation. This site will be very helpful specially for the beginner... :)

Algomation is a platform for viewing, creating and sharing any type of algorithm. All algorithms, on this site are public and can be viewed and shared by any user of the site. Registered users can create new algorithms or fork existing one.

If anyone wants to know more about this site, can visit about section of this site.

There is another site named VisuAlgo where data structures and algorithms are visualized through animation ... :)
VisuAlgo was conceptualised by Dr Steven Halim ( author of Competitive Programming).

Some coders like me have much interest about the environment of a World Final....

There can be many way to follow online broadcast of The 2014 ACM ICPC World Finals... One of them is here... :)
On 25 of June if anyone wishes can follow online broadcast of The 2014 ACM ICPC World Finals in this link ... :)

Seeing this graph I am so wondered that, I can not but share this with all of you ... :O

I've faced a strange thing when solving this 412D - Giving Awards. My this submission 6417021 has given me "wrong answer" in case 5, while this submission 6417013 is "Accepted". The only difference between these two code is "a variable 'j'".I declared "j" only globally, in the code, which has given me "wrong answer". But in the code , which has given me "Accepted" verdict, I declared "j" both in the dfs() function and globally.

Would anyone please make me known the exact reason behind this ??? As I've faced it for the first time, it seems a strange thing to me... :(

*** Case 5 is big for debugging... I've tried with all other small cases, but they have passed successfully... :(

Two string will be given. I've to find out lexicographically smallest LCS string. I have coded one, but it is giving me WA... I tried with some cases, but failed to find out the problem. Would anyone help please ???

I just need the case for which case my code is failed... Please help ... :(

My code is here

Problem Link is here

I'm getting WA in UVA 949 My code link is given here. Please help... :(

Would someone please give me some test cases for which my code is failed ???

// mat[][][][] is for checking if I can go from (x1,y1) to (x2,y2)

// ve[][] is for storing time in which I can't stay in (x,y)

// cst[][] is for calculating cost

I am new in DP... Now trying to learn edit distance algorithm recursively... But I can't print the path... How can I do this ???

I have been trying since last two days but can't get it... :(

Would anyone please check the code given in the link below and tell me where should I edit to print the path correctly ???

code link

Would anyone please give me a explanation on 312B - Archer ???

How can this problem be solved by mathematically ??? Help please ...

I've tried seeing others code,but failed to understand... :(

problem link ... Here