Pagini recente » Rating Atitienei Daniel-Petrisor (Daniel_Atitienei) | Monitorul de evaluare | Cod sursa (job #19464) | Cod sursa (job #999333) | Cod sursa (job #1883189)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#define INF 50000000
const int N = 100;
int n, ad[N][N];
int main()
{
fin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
fin>>ad[i][j];
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(ad[i][k] && ad[k][j] && i!=j)
ad[i][j] = min(ad[i][j], ad[i][k]+ad[k][j]);
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
fout<<ad[i][j]<<" ";
fout<<'\n';
}
return 0;
}