Pagini recente » Cod sursa (job #277104) | Cod sursa (job #2785878) | Cod sursa (job #1687000) | Cod sursa (job #2129028) | Cod sursa (job #1987269)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,i,a[101][101],j,k;
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];
}
}
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]<a[i][j] and a[i][k]!=0 and a[k][j]!=0 and i!=k and j!=k and i!=j) 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;
}