Pagini recente » Cod sursa (job #2413003) | Cod sursa (job #2610) | Cod sursa (job #2984783) | Cod sursa (job #4346) | Cod sursa (job #2722767)
#include <bits/stdc++.h>
#define INF 1 << 26
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, a[101][101];
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
for(int j = 1, val; j <= n; j++)
{
in >> val;
if(val == 0 && i != j)
a[i][j] = INF;
else
a[i][j] = val;
}
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++)
if(a[i][j] != INF)
out << a[i][j] << ' ';
else
out << 0 << ' ';
out << '\n';
}
return 0;
}