Pagini recente » Cod sursa (job #1697428) | Cod sursa (job #2630843) | Cod sursa (job #1279186) | Cod sursa (job #2172272) | Cod sursa (job #2091009)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int A[105][105], n;
int main()
{
in >> n;
int c;
for( int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
in >> c;
if( c ) A[i][j] = c; else A[i][j] = INT_MAX;
}
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] !=INT_MAX && A[k][j] != INT_MAX && A[i][j] != INT_MAX )
A[i][j] = min ( 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] != INT_MAX ) out << A[i][j] <<' ';
else out << 0 << ' ' ;
out << '\n';
}
return 0;
}