OJ Board

Submissions to 11849 seem to get sent to the judge, but do not seem to get judged. It hasn't veredict. 8993820 11686 Pick up sticks C++ 0.000 2011-06-27 16:27:35 It has persisted for some days since I submit it. It would be great if it were possible to restore the judging of this problem. Thanks Sa...

This is the problem link: http://livearchive.onlinejudge.org/external/39/3914.html I am getting PE for a long time, don't know why. Can anyone help? A large number of people has already solved this.. But I am totally out of any clue. The problem is finally fixed, and rejudged, thanks to the people ...

I submitted the solution for problem 11686 [ http://uva.onlinejudge.org/external/116/11686.html ] around 30 minutes ago, but they are not judged yet, the judge looks fine so far as it is judging other submissions, and it is not even in a hang state. However, the problem is a special judge problem. I...

This is the problem link: http://livearchive.onlinejudge.org/exte ... /3914.html

I am getting PE for a long time, don't know why. Can anyone help? A large number of people has already solved this.. But I am totally out of any clue.

I was trying to solve this problem for a while, getting wrong answer. Here is my code, please give me some test cases where it fails, or point out the bug.. My approach: Run bellman ford considering 0 as source Then from all such nodes which still can be updated, I used dfs to mark all reachable nod...

uva toolkit gives wrong output to this case: 5 1 2 1 1 1 3 1 5 1 4 0 my ac code outputs 2 while toolkit outputs 3. First, your input is wrong/invalid wrt problem statement: The galleries are connected by corridors in such a way that from any gallery there is exactly one path to reach any other gall...

for(i=0;i<sz;i++) cout<<v[i]; cout<<""<<endl; i used a vector to contain the character of the commom sequence.After printing all character from the vector i print a nul character "" as shown in the code and got ACCEPTD.So every one can try if you cant found any other problem in ...

what is your output for 1 1 It should be 1 1 1 And to check EOF, this is better, because, sometimes, file may contain trailing garbage while(cin >> x >> y) { } or while(scanf("%d %d", &x, &y)==2) { } Output format is ok I think. AND BEFORE OPENING NEW THREADS, SEARCH THE FORUM FIRS...

@shantanu18, can you please explain your dp relations?

Can you use code tags? your code is hardly readable... You are not following the problem properly. For example, try these inputs: 22 3 44 71 27 37 91 79 96 10 74 52 35 19 40 98 85 67 79 43 93 29 13 37 87 17 75 24 74 36 31 11 89 80 84 75 31 39 20 88 87 14 89 70 25 30 93 28 20 72 11 30 78 87 36 50 54 ...

StringTokenizer will work better than split. Have you tried that?

PLEASE FOLLOW FORUM RULES, DO NOT OPEN NEW THREAD WHILE THERE IS ALREADY ONE OPENED. USE EXISTING THREADS. Here are my output for your input, F T T F F F F F F F F T F F F F F T F F F F F T F F T F F F F T T F F F F T F T T T F T T F F F F T T F T T F T F F T F F F F F F F F F F F F F F T F F F F F...

Please use existing thread, do not open new one when it is already there.

@shantanu18, From a quick look on your code, I think you are always printing a 0 at the end, why does it have to be so?

10561 - Treblecross : Essentially the same problem, one more extra requirement, you have to print the possible starting positions from where you can win the game.