Pagini recente » Borderou de evaluare (job #2426766) | Borderou de evaluare (job #2281286) | Monitorul de evaluare | Borderou de evaluare (job #1093169) | Cod sursa (job #978976)
Cod sursa(job #978976)
#include <cstdio>
using namespace std;
int p[101][101], i ,j, k, n;
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
scanf("%d", &n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
scanf("%d", &p[i][j]);
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(p[i][k] && p[k][j] && i!=j)
if(p[i][j]>p[i][k]+p[k][j] || !p[i][j])
p[i][j]=p[i][k]+p[k][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
printf("%d ", p[i][j]);
printf("\n");
}
return 0;
}