Pagini recente » Cod sursa (job #1183323) | Cod sursa (job #1985375) | Cod sursa (job #2488125) | Cod sursa (job #1506745) | Cod sursa (job #2538732)
#include <fstream>
#include <climits>
#define f in
#define g out
using namespace std;
ifstream in ( "royfloyd.in" );
ofstream out( "royfloyd.out" );
int n, m, i, j, k;
int a[110][110], t[110][110];
const int INF = INT_MAX;
int main() {
f>>n;
for ( i = 1; i <= n; i++ )
for ( j = 1; j <= n; j++ ){
f>>a[i][j];
if ( !a[i][j] && i != j )
a[i][j] = INF;
}
for ( k = 1; k <= n; k++ )
for ( i = 1; i <= n; i++ )
for ( 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 ( i = 1; i <= n; i++, g<<"\n" )
for ( j = 1; j <= n; j++ )
g<<a[i][j]<<" ";
return 0;
}