Pagini recente » Cod sursa (job #126229) | Cod sursa (job #1450313) | Cod sursa (job #1892977) | Cod sursa (job #98443) | Cod sursa (job #2526277)
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int maxim = 100001, a[101][101];
int main()
{
int n, i, j, k;
fin>>n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
{
fin >> a[i][j];
if(a[i][j] == 0 && i != j)
a[i][j] = maxim;
}
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
{
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
fout << a[i][j]<<' ';
fout<<'\n';
}
return 0;
}