Pagini recente » Istoria paginii runda/catdebunesti | Cod sursa (job #2424901) | Cod sursa (job #2614436) | Cod sursa (job #2551465) | Cod sursa (job #1358140)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,mat[110][110],D[110][110];
void Citire()
{
int i,j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) {fin>>mat[i][j]; D[i][j]=mat[i][j];}
}
void Path()
{
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[i][k]+D[k][j])
D[i][j]=D[i][k]+D[k][j];
}
void Afis()
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fout<<D[i][j]<<" ";
}
fout<<'\n';
}
}
int main()
{
Citire();
Path();
Afis();
return 0;
}