Pagini recente » Cod sursa (job #1145025) | Cod sursa (job #2709803) | Cod sursa (job #2676347) | Cod sursa (job #2324237) | Cod sursa (job #2425632)
#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
int n,m;
int a[101][101];
int p[101][101];
const int inf = 10000000;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void citire()
{
int i,j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(i==j)
p[i][j]=a[i][j]=0;
else if(a[i][j] != inf)
p[i][j]=i;
else p[i][j]=0;
}
}
void rf()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k] != inf && a[k][j] != inf)
if(a[i][j] > a[i][k] + a[k][j])
{
a[i][j]=a[i][k]+a[k][j];
p[i][j]=p[k][j];
}
}
int main()
{
citire();
rf();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<endl;
}
return 0;
}