Pagini recente » Cod sursa (job #2543680) | Cod sursa (job #588486) | Cod sursa (job #939440) | Cod sursa (job #3254179) | Cod sursa (job #1933103)
#include <bits/stdc++.h>
using namespace std;
int n,i,j,a[110][110],k;
int main()
{
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
f>>n;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
{
f>>a[i][j];
if(!a[i][j])a[i][j]=1000010;
}
for(k=1; k<=n; ++k)
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
if(i!=j)a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for(i=1; i<=n; ++i)
{
for(j=1; j<=n; ++j)
{
if(a[i][j]==1000010)g<<0<<" ";
else g<<a[i][j]<<" ";
}
g<<'\n';
}
return 0;
}