OJ Board

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???

Thanks in Advace..

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..
please help me cause I really fed up

Thanks...

What do u think will be the output to the case where i = 1 ???
(as the problem statment mentioned 1<=i<=N )

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 ...

I sent a post here about this problem but noone replied.. can anyone help??
http://online-judge.uva.es/board/viewtopic.php?t=12546

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 ...

Thanks Adrian

me too... AC now..
the problem was that I was using 'long' not 'long long'

Thanks a lot for ur help..

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

oh.. Thanks a lot Martin.. the reason was the 'long long' thing ..
its AC now..

what is long long ?? is that different from long ??

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...

I am using linear algo & I keep getting WA..
this is really so strange.. I tried all test cases..
its getting me mad...

I tried solving it, but I keep getting WA..
Any suggesstions??

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..