Pagini recente » Cod sursa (job #1832326) | Cod sursa (job #1821619) | Cod sursa (job #2062862) | Cod sursa (job #54833) | Cod sursa (job #632758)
Cod sursa(job #632758)
#include <iostream>
#include <fstream>
using namespace std;
int a[102][102],n,i,j;
int main()
{ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
f>> n;
for (i=1;i<=n;i++){
for (j=1;j<=n;j++)
f>>a[i][j];
}
int k;
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (a[i][k] && a[k][j] && i!=j)
{
if (a[i][j]==0) a[i][j]=a[i][k]+a[k][j];
else a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
for (i=1;i<=n;i++){
for (j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}