Pagini recente » Cod sursa (job #1715577) | Cod sursa (job #1554320) | Cod sursa (job #749101) | Cod sursa (job #1355591) | Cod sursa (job #514624)
Cod sursa(job #514624)
#include<algorithm>
#include<iostream>
using namespace std;
int n,a[10001][10001],i,j,k;
int main()
{
freopen ("royfloyd.in", "r", stdin);
freopen("royfloyd.out","w", stdout);
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][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++)
cout<<a[i][j]<<" ";
cout<<endl;
}
}