Pagini recente » Cod sursa (job #406281) | Cod sursa (job #3220624) | Cod sursa (job #2657696) | Cod sursa (job #2965495) | Cod sursa (job #2749340)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N=101 ,INF=INT_MAX;
int a[N][N],n;
int main()
{
int n;
in>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
in>>a[i][j];
}
}
for(int k = 1; k<=n; k++)
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(a[i][k]+a[k][j]<a[i][j])
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(a[i][j]==INF)
a[i][j]=0;
out<<a[i][j]<<" ";
}
out<<'\n';
}
return 0;
}