Cod sursa(job #257165)
| Utilizator | Data | 12 februarie 2009 21:09:06 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
var f,g:text;
n,i,j,k:integer;
a:array[1..150,1..150] of integer;
begin
assign(f,'royfloyd.in');reset(f);
assign(g,'royfloyd.out');rewrite(g);
read(f,n);
for i:=1 to n do
for j:=1 to n do
read(f,a[i,j]);
for k:=1 to n do
for i:=1 to n do
for j:=1 to n do
if a[i,k]+a[k,j]<a[i,j] then
a[i,j]:=a[i,k]+a[k,j];
for i:=1 to n do
begin
for j:=1 to n do
write(g,a[i,j],' ');
writeln(g);
end;
close(g);
end.
