i used FLOYD's algo and have TLE15. i used Djkstra's algo and i have WA10.. pls, can you give me some tests or what's bug in my program?

{$APPTYPE CONSOLE}

uses
SysUtils;

var a:array [1..1000,1..1000] of longint;
mas:array [1..1000] of longint;
used:array [1..1000] of boolean;
i,n,m,t,f:longint;
procedure djkstra(st:longint);
var cur,i:longint;
begin
fillchar(mas,sizeof(mas),255);
fillchar(used,sizeof(used),0);
cur:=st;
mas[cur]:=0;
repeat
used[cur]:=true;
for i:=1 to n do
if (a[cur,i]<>0) and (mas[i]<mas[cur]+a[cur,i]) then
mas[i]:=mas[cur]+a[cur,i];
cur:=0;
for i:=1 to n do
if not used[i] and (mas[i]<>-1)and ((cur=0)or (mas[cur]>mas[i])) then cur:=i;
until cur=0;
end;
begin
read(n,m);
for i:=1 to m do
begin
read(t,f);
read(a[t,f]);
end;
read(t,f);
djkstra(t);
if mas[f]<>-1 then write(mas[f]) else write('No solution');
halt(0);
end.

and what to do if there is cycle?
Edited by author 16.04.2008 21:52

Edited by author 16.04.2008 21:56

This is very easy algo - if you want to be a good programmer, you should know by heart this and more complicated algorithms. The main idea is: while a>0 & b>0 you subtract smaller number from larger (euclid algorithm), but to speed it up we use %:

int gcd (int a, int b){
 while ((a > 0) && (b > 0))
  if (a > b) a %= b;
  else b %= a;
 return a+b;
};

or, recursively (but slightly slower):

int gcd (int a, int b){
 if (b == 0) return a;
 else return gcd (b, a % b);
};

Edited by author 07.07.2008 05:06