Pagini recente » Cod sursa (job #490791) | Cod sursa (job #2798519) | Cod sursa (job #1661480) | Cod sursa (job #1924456) | Cod sursa (job #355978)
Cod sursa(job #355978)
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int n;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
vector < vector <int> > a(n+1,vector <int> (n+1,0));
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][j]&&a[i][k]&&a[k][j])
{
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}