Pagini recente » Cod sursa (job #359739) | Cod sursa (job #1997274) | Cod sursa (job #2143190) | Cod sursa (job #2243084) | Cod sursa (job #1987271)
#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] > a[i][k] + a[k][j] || !a[i][j]) && 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;
}