Pagini recente » Cod sursa (job #2866781) | Cod sursa (job #2867103) | Cod sursa (job #2027904) | Cod sursa (job #2460441) | Cod sursa (job #3286451)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, d[105][105];
int main()
{
int i, j, k;
fin >> n;
for (i = 1 ; i <= n ; i++)
for (j = 1 ; j <= n ; j++)
{
fin >> d[i][j];
if (d[i][j] == 0)
d[i][j] = 2e9;
}
for (k = 1 ; k <= n ; k++)
for (i = 1 ; i <= n ; i++)
for (j = 1 ; j <= n ; j++)
if (i != j && i != k && j != k && d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
for (i = 1 ; i <= n ; i++)
{
for (j = 1 ; j <= n ; j++)
if (d[i][j] != 2e9)
fout << d[i][j] << " ";
else
fout << 0 << " ";
fout << "\n";
}
return 0;
}