Pagini recente » Cod sursa (job #2407327) | Cod sursa (job #2082455) | Cod sursa (job #2208216) | Cod sursa (job #1580788) | Cod sursa (job #2423667)
#include <iostream>
#include<fstream>
using namespace std;
int d[105][105];
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>d[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(d[i][k]!=0 && d[k][j]!=0 &&(d[i][j]>d[i][k]+d[k][j] || d[i][j]==0)&& i!=j)
d[i][j]=d[i][k]+d[k][j];
}
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
out<<d[i][j]<<" ";
out<<'\n';
}
return 0;
}