Pagini recente » Cod sursa (job #1341610) | Cod sursa (job #3198961) | Cod sursa (job #2730346) | Cod sursa (job #2090210) | Cod sursa (job #1233622)
#include <iostream>
#include <fstream>
using namespace std;
int i,j,k,M[100][100],n;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
f>>n;
for(i=0;i<n;i++)
for (j=0;j<n;j++) f>>M[i][j];
for (k=0;k<n;k++)
for (i=0;i<n;i++)
for (j=0;j<n;j++)
if (M[i][k]&&M[k][j]&&(M[i][k]+M[k][j]<M[i][j]||M[i][j]==0)&&i!=j) M[i][j]=M[i][k]+M[k][j];
for(i=0;i<n;i++)
{
for (j=0;j<n;j++) g<<M[i][j]<<" ";g<<'\n';
}
}