Pagini recente » Cod sursa (job #2686230) | Cod sursa (job #776229) | Cod sursa (job #776295) | Cod sursa (job #2161966) | Cod sursa (job #1991403)
#include <iostream>
#include <fstream>
#define oo 999999999
using namespace std;
int n, a[101][101];
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{int i, j, k;
f>>n;
for (i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
f>>a[i][j];
if (a[i][j]==0 && i!=j) a[i][j]=oo;
}
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][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;
}