Pagini recente » Diferente pentru planificare/camp-2.3 intre reviziile 9 si 35 | Istoria paginii utilizator/andrei_cotor | Evantai | Monitorul de evaluare | Cod sursa (job #1008084)
#include <cstdio>
using namespace std;
FILE *f;
unsigned int n,a[100][100],i,j,k;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%u",&n);
for (i=0;i<n;i++)
for (j=0;j<n;j++)
scanf("%u",&a[i][j]);
for (i=0;i<n;i++)
for (j=0;j<n;j++)
for (k=0;k<n;k++)
if ((i!=j)&&(j!=k)&&(k!=i)&&((!a[i][k])||(a[i][j]+a[j][k]<a[i][k])))
a[i][k]=a[i][j]+a[j][k];
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
printf("%u ",a[i][j]);
printf("\n");
}
return 0;
}