Pagini recente » Cod sursa (job #191765) | Cod sursa (job #3165869) | Cod sursa (job #857367) | Cod sursa (job #1984825) | Cod sursa (job #1678520)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N,A[101][101],i,j;
void roy_floyd_warshall()
{
int i,j,k;
for(k=1;k<=N;++k)
for(i=1;i<=N;++i)
for(j=1;j<=N;++j)
if(A[i][k] && A[k][j] && (A[i][j]>A[i][k]+A[k][j] || !A[i][j] && i!=j))A[i][j]=A[i][k]+A[k][j];
}
int main()
{
fin>>N;
for(i=1;i<=N;++i)
for(j=1;j<=N;++j)fin>>A[i][j];
roy_floyd_warshall();
for(i=1;i<=N;++i)
{
for(j=1;j<=N;++j)fout<<A[i][j]<<" ";
fout<<"\n";
}
return 0;
}