Pagini recente » Cod sursa (job #1031279) | Borderou de evaluare (job #1537880) | Diferente pentru problema/amiba intre reviziile 2 si 3 | Cod sursa (job #846369) | Cod sursa (job #1916314)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,m[101][101],i,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>m[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
if(m[k][j] and m[i][k] and (m[i][j]>m[k][j]+m[i][k] or !m[i][j]) and i!=j)
m[i][j]=m[k][j]+m[i][k];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
fout<<m[i][j]<<" ";
fout<<"\n";}
return 0;
}