Pagini recente » Cod sursa (job #3214930) | Cod sursa (job #2246032) | Cod sursa (job #2684059) | Cod sursa (job #152694) | Cod sursa (job #632756)
Cod sursa(job #632756)
#include <iostream>
#include <fstream>
using namespace std;
int a[100][100],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;
}