Pagini recente » Cod sursa (job #818457) | Cod sursa (job #3155219) | Cod sursa (job #78587) | Cod sursa (job #255161) | Cod sursa (job #632815)
Cod sursa(job #632815)
#include <stdio.h>
using namespace std;
int a[101][101],n;
void read()
{
freopen("royfloyd.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void write()
{
freopen("royfloyd.out","w",stdout);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
void royfloyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j)
// daca drumul de la i la k + drumul de la k la j e mai bun decat drumul direct de la i la j.
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
read();
royfloyd();
write();
return 0;
}