Pagini recente » Cod sursa (job #601919) | Cod sursa (job #1289933) | Cod sursa (job #805129) | Cod sursa (job #2061246) | Cod sursa (job #2302789)
#include <iostream>
#include <cstdio>
using namespace std;
int n;
int a[105][105];
int dp[105][105];
void citire()
{
scanf("%d\n",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
scanf("%d ",&dp[i][j]);
if(dp[i][j]==0 && i!=j)
dp[i][j]=INT_MAX;
}
}
void floyd()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(i!=k && j!=k)
dp[i][j]=min(dp[i][j],dp[i][k] + dp[k][j]);
}
}
void afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",dp[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
floyd();
afisare();
return 0;
}