Pagini recente » Cod sursa (job #2574401) | Cod sursa (job #1934115) | Cod sursa (job #83012) | Cod sursa (job #1142435) | Cod sursa (job #1677791)
# include <fstream>
# include <algorithm>
using namespace std;
ifstream f ( "royfloyd.in" );
ofstream g ( "royfloyd.out" );
int a[102][102], n;
void roy_floyd() {
for ( int k = 1; k <= n; ++ k ) {
for ( int i = 1; i <= n; ++ i ) {
for ( int j = 1; j <= n; ++ j ) {
if ( ( a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0 ) && i - j && a[i][k] && a[k][j] ) {
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main()
{
f >> n;
for ( int i = 1; i <= n; ++ i ) {
for ( int j = 1; j <= n; ++ j ) {
f >> a[i][j];
}
}
roy_floyd();
for ( int i = 1; i <= n; ++ i ) {
for ( int j = 1; j <= n; ++ j ) {
g << a[i][j] << " ";
}
g << '\n';
}
return 0;
}