## Search found 15 matches

Fri Oct 27, 2006 10:03 am
Forum: Algorithms
Topic: MST Via Floyd Warshall Question ??
Replies: 1
Views: 1723

### MST Via Floyd Warshall Question ??

Hi All...
I'm a beginner in Algorithms stuff.. I read about Floyd Warshall Algo to find Min Path & also I read about MST (Minimum spanning tree).. & I was just wondering.. when to use this Algo & when to use the other one while solving any problem that requires Min path or sth???

Thu Oct 26, 2006 4:23 pm
Forum: Volume 4 (400-499)
Topic: 423 - MPI Maelstrom
Replies: 17
Views: 9824

### 423 WA :(

I've been trying to solve this problem , but I keep getting WA
Please if anyone has sample tricky inputs, I'll be really so grateful..

I'm using warshall algo..

Thanks...
Thu Oct 26, 2006 3:33 pm
Forum: Volume 4 (400-499)
Topic: 423 - MPI Maelstrom
Replies: 17
Views: 9824
What do u think will be the output to the case where i = 1 ???
(as the problem statment mentioned 1<=i<=N )
Thu Oct 26, 2006 3:25 pm
Forum: Volume 4 (400-499)
Topic: 423 - MPI Maelstrom
Replies: 17
Views: 9824

### help

Only one thing, which I can imagine, is 'X' in input. I set this 'x' as MAX_INT-1 (2.000.000.000 and something ;-) ) - maybe it's wrong ? Hi Dominik & T.T. I used the same method u used to solve this problem.. but I'm still getting WA.. I use -1 instead of 'x' & add a condition to neglect it while ...
Thu Oct 26, 2006 12:33 pm
Forum: Volume 4 (400-499)
Topic: 439 - Knight Moves
Replies: 33
Views: 11371

### Help???

http://online-judge.uva.es/board/viewtopic.php?t=12546
Thu Oct 26, 2006 11:29 am
Forum: Volume 4 (400-499)
Topic: 439 - Knight Moves
Replies: 33
Views: 11371

### 439 - Stack OverFlow

Hi all.. I'm trying to solve this problem.. but when I'm compiling, I get "stack overflow" error.. can anyone help?? here's my code int move(int x,int y,int distance) { if(Board[x][y] != INT_MAX) return Board[x][y]; if((end.x == x && end.y == y) || x >= 8 || y >= 8 || x < 0 || y < 0) return Board[x]...
Sun Jul 23, 2006 7:07 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
Sun Jul 23, 2006 6:58 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
me too... AC now..
the problem was that I was using 'long' not 'long long'

Thanks a lot for ur help..
Sun Jul 23, 2006 6:54 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
what made me use 'long' not 'long long' is that when I use it, I get an error & the program doesnt work (I am using Visual Studio 6.0) .. does it need special header or sth??

anyway, its AC after all
Sun Jul 23, 2006 6:50 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
oh.. Thanks a lot Martin.. the reason was the 'long long' thing ..
its AC now..
Sun Jul 23, 2006 6:36 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
what is long long ?? is that different from long ??
Sun Jul 23, 2006 6:34 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
Hi Martin

I tried ur sample input.. I am getting the same output as urs..
I dont know why am I getting WA !!!
my solution is O(n)..

Thanks anyway...
Sun Jul 23, 2006 5:49 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
I am using linear algo & I keep getting WA..
this is really so strange.. I tried all test cases..
Sun Jul 23, 2006 5:21 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959
I tried solving it, but I keep getting WA..
Any suggesstions??
Sun Jul 23, 2006 5:20 pm
Forum: Volume 110 (11000-11099)
Topic: 11054 - Wine trading in Gergovia
Replies: 25
Views: 6959

### 11054 - Wine trading in Gergovia

Hi guys..

I solved this problem & I keep getting WA althought I tried almost everything.. I wonder if anyone has got the test cases for it??? or anyone think about some case that may not work...

Thanks..