Pagini recente » Borderou de evaluare (job #366303) | Borderou de evaluare (job #1614901) | Borderou de evaluare (job #1093086) | Borderou de evaluare (job #2063566) | Cod sursa (job #2941332)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[101][101];
int main() {
int n;
fin >> n;
for ( int i = 1; i <= n; ++i )
for ( int j = 1; j <= n; ++j )
a[i][j] = (1 << 31);
for ( int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
fin >> a[i][j];
}
for ( int k = 1; k <= n; ++k) {
for ( int i = 1; i <= n; ++i)
for ( int j = 1; j <= n; ++j)
if( i != k and j != k and i != j and a[i][k] + a[k][j] < a[i][j])
a[i][j]= a[i][k] + a[k][j];
}
for ( int i = 1; i <= n; ++i) {
for ( int j = 1; j <= n; ++j)
if ( a[i][j] == (1 <<31) || i == j)
fout << 0 << " " ;
else
fout << a[i][j] << " ";
fout << "\n";
}
}