Pagini recente » Cod sursa (job #2450320) | Cod sursa (job #1579342) | Cod sursa (job #1198340) | Cod sursa (job #1109696) | Cod sursa (job #3311066)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int N=101;
int n,i,j,k,v[N][N];
void read()
{
fin>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
fin>>v[i][j];
}
}
void solve()
{
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
if(v[i][k] && v[k][j] && (v[i][j]>v[i][k]+v[k][j] || !v[i][j]) && i!=j) v[i][j]=v[i][k]+v[k][j];
}
}
void print()
{
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
fout<<v[i][j]<<' ';
fout<<'\n';
}
}
int main()
{
read();
solve();
print();
}