Pagini recente » Cod sursa (job #180862) | Cod sursa (job #3127863) | Cod sursa (job #2616063) | Borderou de evaluare (job #1567291) | Cod sursa (job #1500733)
#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];
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] = 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]);
printf("\n");
}
return 0;
}