Pagini recente » Cod sursa (job #1406761) | Cod sursa (job #1442268) | Cod sursa (job #656792) | Cod sursa (job #754447) | Cod sursa (job #1335516)
#include <iostream>
#include <cstdio>
#define MAXN 110
using namespace std;
int a[MAXN][MAXN], n;
void citire()
{
scanf("%d ", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
scanf("%d ", &a[i][j]);
}
void solve()
{
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
for (int k = 1; k <= n; k++)
if (a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
void afisare()
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
printf("%d ", a[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
citire();
solve();
afisare();
return 0;
}