Pagini recente » Cod sursa (job #2539921) | Cod sursa (job #1792367) | Cod sursa (job #107727) | Cod sursa (job #2825245) | Cod sursa (job #2579451)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int NMAX = 100;
const int INF = 1e9;
int dp[NMAX + 1][NMAX + 1];
int main() {
int n;
fin>>n;
for( int i = 1; i <= n; i ++ ) {
for( int j = 1; j <= n; j ++ ) {
fin>>dp[i][j];
if( dp[i][j] == 0 && i != j )
dp[i][j] = INF;
}
}
for( int k = 1; k <= n; k ++ ) {
for( int i = 1; i <= n; i ++ ) {
for( int j = 1; j <= n; j ++ ) {
if( dp[i][k] + dp[k][j] < dp[i][j] )
dp[i][j] = dp[i][k] + dp[k][j];
}
}
}
for( int i = 1; i <= n; i ++ ) {
for( int j = 1; j <= n; j ++ ) {
if( dp[i][j] >= INF )
fout<<"0 ";
else
fout<<dp[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}