Pagini recente » Autentificare | Cod sursa (job #2861491) | Cod sursa (job #164083) | Cod sursa (job #2025949) | Cod sursa (job #1010398)
# include <iostream>
# include <fstream>
# define n_max 102
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[n_max][n_max],n;
int main()
{
f>>n;
int i,j,k;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
f>>a[i][j];
}
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
for(k=1; k<=n; k++)
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;
}