OJ Board

I am really confused. For every testcase here and uDebug my code gives the correct answer but i am getting WA all the time. can any body help me to find the bug or any critical input / out put for debug? //208 Firetruck //https://uva.onlinejudge.org/external/2/208.pdf #define _CRT_SECURE_NO_WARNINGS...

Problem description says the graph will be strongly connected . That is, there will be at least one path from any node to any other node. So your function is_bicolorable is unnecessary. I don't know why you got WA. Maybe judge's input contains invalid input. But if you change line this way you'll g...

It is really too much frustrating. All sample input output passed ( All posted in this thread) but still WA. #include<cstdio> #include<list> #include<cstring> #define MAX_NODE 200 #define MAX_EDGE 10000 using namespace std; int colored[MAX_NODE]; int dfs(list<int> adj[],int v,int visited[],int color...

HI, I have tried all the test case every time my code passed all the test case i found here also the all other i can make including the sample input . Every time My code generate the correct answer and I also take care about the blank line between every output sets and also not to print a blank line...