OJ Board

My java code that uses kosaraju's algorithm gets accepted. I think that the test cases are weak as I am using recursive depth first search, so the recursion depth will be very high if the number of vertices are ~100000 . But still the program gets AC.

How can I view that how much time other coders' solution took? Is there some other way out of uva that we can compare solutions and how they rank?

I am always getting WA on UVA 147 Dollars. Please provide some test cases or suggest why I am getting WA. The main code that I use is same as that for UVA 674 Coin Change for which I have AC.

thanks Brian!!

In browsing the problems, some question have a green tick against them while some have a yellow tick mark. What do they mean?