Pagini recente » Cod sursa (job #642426) | Cod sursa (job #3142591) | Cod sursa (job #136822) | Cod sursa (job #1795149) | Cod sursa (job #2375501)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n,a[105][105];
void afis()
{
for(int i=1;i<=n;++i){
for(int j=1;j<=n;++j)g<<a[i][j]<<' ';
g<<'\n';
}
}
int main()
{
f>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j){
f>>a[i][j];
if(!a[i][j] && i!=j)a[i][j]=1000000000;
}
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
afis();
f.close(); g.close();
return 0;
}