Pagini recente » Cod sursa (job #1490831) | Cod sursa (job #1392935) | Cod sursa (job #2461146) | Cod sursa (job #2703850) | Cod sursa (job #2423099)
#include <fstream>
using namespace std;
int n;
int a[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 >> a[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 (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
void print_data() {
for( int i = 1; i <= n; i++ ) {
for( int j = 1; j <= n; j++ )
g << a[i][j] << " ";
g << "\n";
}
}
int main() {
read_data();
solve();
print_data();
return 0;
}