Pagini recente » Cod sursa (job #327044) | Cod sursa (job #2047358) | Cod sursa (job #3258140) | Cod sursa (job #2485827) | Cod sursa (job #2344414)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int NMAX=1e2+5,INF=INT_MAX;
int A[NMAX][NMAX],n;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>A[i][j];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int k=1;k<=n;k++)
if(A[i][j]>A[i][k]+A[k][j])
A[i][j]=A[i][k]+A[k][j];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<A[i][j]<<" ";
fout<<'\n';
}
return 0;
}