Pagini recente » Cod sursa (job #2147745) | Cod sursa (job #284864) | Cod sursa (job #1530218) | Cod sursa (job #632189) | Cod sursa (job #2570945)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,d[110][110];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
in>>d[i][j];
if(d[i][j]==0&&i!=j) d[i][j]=1e6;
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
if(d[i][j]!=1e6) out<<d[i][j]<<" ";
else out<<0<<" ";
out<<'\n';
}
return 0;
}