Pagini recente » Cod sursa (job #2382248) | Cod sursa (job #1365232) | Cod sursa (job #1442589) | Cod sursa (job #320751) | Cod sursa (job #2694079)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int M[105][105];
void read() {
fin >> n;
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ ){
fin >> M[i][j];
}
}
void solve() {
for( int k = 1; k <= n; k++ )
for( int i = 1; i <= n; i++ )
for( int j = 1; j <= n; j++ )
if( ( M[i][j] > M[i][k] + M[k][j] || !M[i][j] ) && i!=k && k!=j && i!=j && M[i][k] && M[k][j] )
M[i][j] = M[i][k]+M[k][j];
}
int main() {
read();
solve();
for( int i = 1; i <= n; i++ ) {
for( int j = 1; j <= n; j++ ){
fout << M[i][j] << ' ';
}
fout << '\n';
}
}