Pagini recente » Cod sursa (job #1998270) | Cod sursa (job #2517151) | Cod sursa (job #2774911) | Cod sursa (job #1764409) | Cod sursa (job #2749733)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105], d[105][105];
int inf = INT_MAX;
void Read()
{
int i, j;
fin >> n;
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
fin >> a[i][j];
if(i == j) d[i][j] = 0;
else if(a[i][j] == 0) d[i][j] = inf;
else d[i][j] = a[i][j];
}
}
}
void Roy_Floyd()
{
int i, j, k;
for(k = 1; k <= n; ++k)
{
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
{
if(d[i][j] > d[k][j] + d[i][k])
d[i][j] = d[k][j] + d[i][k];
}
}
}
}
void Write()
{
int i, j;
for(i = 1; i <= n; ++i)
{
for(j = 1; j <= n; ++j)
fout << d[i][j] << " ";
fout << "\n";
}
}
int main()
{
Read();
Roy_Floyd();
Write();
return 0;
}