Search found 110 matches
- Tue Aug 02, 2011 1:56 pm
- Forum: Bugs and suggestions
- Topic: 11686 Pick up sticks: "Sent To Judge" But Not Judged
- Replies: 3
- Views: 2766
Re: 11686 Pick up sticks: "Sent To Judge" But Not Judged
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...
- Tue Aug 02, 2011 1:50 pm
- Forum: ACM ICPC Archive Board
- Topic: 3914 - Flipping Burned Pancakes
- Replies: 1
- Views: 2406
Re: 3914 - Flipping Burned Pancakes
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 ...
- Tue Aug 02, 2011 1:47 pm
- Forum: Bugs and suggestions
- Topic: 11686 - Pick Up Sticks : Not judging
- Replies: 1
- Views: 1930
11686 - Pick Up Sticks : Not judging
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...
- Sun Jul 10, 2011 12:40 am
- Forum: ACM ICPC Archive Board
- Topic: 3914 - Flipping Burned Pancakes
- Replies: 1
- Views: 2406
3914 - Flipping Burned Pancakes
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 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.
- Sat Jun 18, 2011 1:55 pm
- Forum: Volume 104 (10400-10499)
- Topic: 10449 - Traffic
- Replies: 58
- Views: 23483
Re: 10449 - Traffic
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...
- Sat Jun 18, 2011 12:20 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10243 - Fire! Fire!! Fire!!!
- Replies: 12
- Views: 6707
Re: 10243 - Fire! Fire!! Fire!!!
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...
- Sat Jun 18, 2011 12:12 pm
- Forum: Volume 102 (10200-10299)
- Topic: 10252 - Common Permutation
- Replies: 150
- Views: 55658
Re: 10252 - Common Permutation
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 ...
- Sat Jun 18, 2011 12:02 pm
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 208942
Re: 100 The 3n+1 Problem - WA
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...
- Sat Jun 18, 2011 11:54 am
- Forum: Volume 1 (100-199)
- Topic: 116 - Unidirectional TSP
- Replies: 226
- Views: 41724
Re: help in Problem 116
@shantanu18, can you please explain your dp relations?
- Sat Jun 18, 2011 11:48 am
- Forum: Volume 1 (100-199)
- Topic: 103 - Stacking Boxes
- Replies: 200
- Views: 25259
Re: 103 problem ...
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 ...
- Sat Jun 18, 2011 11:31 am
- Forum: Volume 1 (100-199)
- Topic: 100 - The 3n + 1 problem
- Replies: 1394
- Views: 208942
Re: Problem 100, Java hint
StringTokenizer will work better than split. Have you tried that?
- Sat Jun 18, 2011 11:27 am
- Forum: Volume 1 (100-199)
- Topic: 191 - Intersection
- Replies: 103
- Views: 21010
Re: 191 WA: Please try these inputs if you have AC
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...
- Sat Jun 18, 2011 11:19 am
- Forum: Volume 1 (100-199)
- Topic: 162 - Beggar My Neighbour
- Replies: 31
- Views: 5753
Re: Problem 162 - Getting WA
Please use existing thread, do not open new one when it is already there.
- Sat Jun 18, 2011 11:15 am
- Forum: Volume 1 (100-199)
- Topic: 120 - Stacks of Flapjacks
- Replies: 118
- Views: 15945
Re: 120 Still WA. If you get AC, please try this input.
@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?
- Thu Jun 16, 2011 11:01 am
- Forum: Volume 118 (11800-11899)
- Topic: 11840 - Tic-tac-toe
- Replies: 5
- Views: 3716
Re: 11840 - Tic-tac-toe
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.