Pagini recente » Cod sursa (job #2779720) | Cod sursa (job #2253530) | Cod sursa (job #2027837) | Cod sursa (job #38006) | Cod sursa (job #2693563)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[101][101];
int main()
{
int n;
fin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fin >> m[i][j];
if (m[i][j] == 0 && i != j)
m[i][j] = 1001;
}
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (m[i][j] > m[i][k] + m[k][j])
m[i][j] = m[i][k] + m[k][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if (m[i][j] == 1001)
fout << 0 << " ";
else
fout << m[i][j] << " ";
}
fout << endl;
}
return 0;
}