Pagini recente » Cod sursa (job #1106544) | Cod sursa (job #1882649) | Cod sursa (job #1464751) | Cod sursa (job #1878564) | Cod sursa (job #2423091)
#include <fstream>
using namespace std;
int n;
int m[110][110];
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
void read_data() {
f >> n;
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ )
f >> m[i][j];
}
void solve() {
int i, j, k;
for( k = 1; k <= n; k++ )
for( i = 1; i <= n; i++ )
for( j = 1; j <= n; j++ )
if( m[i][k] and m[j][k] and ( m[i][j] > m[i][k] + m[j][k] or !m[i][j] ) and i != j )
m[i][j] = m[i][k] + m[j][k];
}
void print_data() {
for( int i = 1; i <= n; i++ ) {
for( int j = 1; j <= n; j++ )
g << m[i][j] << " ";
g << "\n";
}
}
int main() {
read_data();
solve();
print_data();
return 0;
}