Pagini recente » Cod sursa (job #897814) | Cod sursa (job #2787948) | Cod sursa (job #1340390) | Cod sursa (job #1322872) | Cod sursa (job #2283377)
#include <bits/stdc++.h>
#define maxn 100
using namespace std;
int ad[maxn+5][maxn+5];
int main ()
{
ifstream fin ( "royfloyd.in" );
ofstream fout ( "royfloyd.out" );
int n;
fin >> n;
int i, j, k;
for ( i = 0; i < n; i++ )
for ( j = 0; j < n; j++ )
fin >> ad[i][j];
for ( k = 0; k < n; k++ )
for ( i = 0; i < n; i++ )
for ( j = 0; j < n; j++ )
if ( i != j && ad[i][k] != 0 && ad[k][j] != 0 && ad[i][j] > ad[i][k] + ad[k][j] )
ad[i][j] = ad[i][k] + ad[k][j];
for ( i = 0; i < n; i++, fout.put ( '\n' ) )
for ( j = 0; j < n; j++ )
fout << ad[i][j] << ' ';
fin.close ();
fout.close ();
return 0;
}