Pagini recente » Cod sursa (job #2221129) | Cod sursa (job #2983614) | Cod sursa (job #1108532) | Cod sursa (job #168733) | Cod sursa (job #2911145)
#include <bits/stdc++.h>
using namespace std;
int N,i,j,k,path,u,v;
int A[101][101],B[101][101];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
fin >> N ;
for (i=1;i<=N;i++)
{
for (j=1;j<=N;j++)
{
fin>>A[i][j];
B[i][j]=j;
}
}
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];
}
}
}
}
for (i=1;i<=N;i++)
{
for (j=1;j<=N;j++)
{
fout << A[i][j] << " ";
}
fout<<"\n";
}
return 0;
}