Pagini recente » Cod sursa (job #461568) | Cod sursa (job #1033440) | Cod sursa (job #95987) | Cod sursa (job #1510660) | Cod sursa (job #1610547)
#include <fstream>
using namespace std;
ifstream f("roy-floyd.in");
ofstream g("roy-floyd.out");
int a[101][101],k,n,m,x,y,cost;
void rf()
{
int i, j, k;
for (k=1; k<=n;k++)
for (i=1; i<=n;i++)
for (j=1;j<=n;j++)
if (a[i][k] and a[k][j] and (a[i][j] > a[i][k] + a[k][j] or !a[i][j]) and i != j) a[i][j] = a[i][k] + a[k][j];
}
void afis()
{
int i, j;
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<'\n';
}
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>a[i][j];
rf();
afis();
return 0;
}