Pagini recente » Cod sursa (job #1397981) | Cod sursa (job #169533) | Cod sursa (job #1995631) | Cod sursa (job #258959) | Cod sursa (job #2694071)
#include <fstream>
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] = 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';
}
}