Pagini recente » Cod sursa (job #2381784) | Cod sursa (job #2093768) | Cod sursa (job #192837) | Cod sursa (job #1981820) | Cod sursa (job #1500734)
#include <algorithm>
#include <stdio.h>
#include <iostream>
#include <fstream>
using namespace std;
int n;
int a[110][110];
int main() {
ifstream cin("royfloyd.in");
freopen("royfloyd.out", "w", stdout);
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
if (!a[i][j] && i != j)
a[i][j] = 1000000;
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
printf("%d ", (a[i][j] == 1000000)? 0 : a[i][j]);
printf("\n");
}
return 0;
}