Pagini recente » Cod sursa (job #848450) | Cod sursa (job #2253977) | Cod sursa (job #2750413) | Cod sursa (job #1230401) | Cod sursa (job #2896803)
#include <bits/stdc++.h>
using namespace std;
int n, m, a[101][101], ok;
void gogu2_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][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];
}
int main() {
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
cin >> a[i][j];
gogu2_floyd();
for(int i = 1; i <= n; i++, cout << '\n')
for(int j = 1; j <= n; j++)
cout << a[i][j] << ' ';
return 0;
}