Pagini recente » Cod sursa (job #2740352) | Cod sursa (job #722768) | Cod sursa (job #2904091) | Cod sursa (job #104036) | Cod sursa (job #2771846)
#include<bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout("royfloyd.out");
int n,cost[102][102];
int main ()
{
int k,i,j;
fin>>n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
fin>>cost[i][j];
for (k=1; k<=n; ++k)
for (i=1; i<=n; ++i)
for (j=1; j<=n; j++)
if (i!=j && cost[i][j]>cost[i][k]+cost[k][j])
cost[i][j]=cost[i][k]+cost[k][j];
for (i=1; i<=n; ++i)
{
for (j=1; j<=n; j++)
fout<<cost[i][j]<<' ';
fout<<'\n';
}
return 0;
}