OJ Board

Ivan, they match again. Could you take a look at my code please? It is a few topics above. I'm really stuck. Thanks.

Ivan, I tested my program with your input and get the same output. I posted my code here before you. I've already tested my program with all inputs on this topic and they match. If someone can help me I appreciate.

JINX, I used the same ideia than you and got AC. I'm not sure if your way to generate the random numbers is correct. I think a more easy way is: a=-500+(rand()%1001); b=-500+(rand()%1001); And I think that the break condition should be: if(count1==n && count2==n) break; I hope it helps. Sorry for my...

My problem is the opposite of the guy above. I got AC at programming challenges and WA at UVA. My program works for all test cases on this topic except one (only one of the test cases posted by jdmetz), in which my program prints 1#IO (I think it is Not a Number - NaN). Therefore, I think that the p...

Hi, I don't now why I am getting WA on this problem. My code passed in all test cases on this forum and I have a friend that get AC on this problem and I made 30 test cases and my code and the code of him had the same result. Both codes do practically the same thing but in different ways. Its a big ...

Hi, I solved the "UVA 10249 - The Grand Dinner" using a greddy algorithm and I think that this problem can be solved using a greddy algorithm too. I developed one and I can't see bugs on it. Can anybody tell me why my code fail or give me a test case where it fails? . Thanks and sorry for my English...

Oh man, a really thank your help. I think that my program was wrong because I don't considered a '\n' in the end of the last test case. But the important is that I get AC with your little modification, thanks.

But my problem isn't time. My code runs in 2 secs. I get WA not TLE. Can you post some critical test cases please?

Differently of others people on this post, I have been getting WA insted of TL on this problem and I have built an explicit graph and tried to find a path using bfs with the index of the words. My code passed on the test cases that I found here and others that I simulate on uvatoolkit.com. Can anybo...