Pagini recente » Cod sursa (job #2312796) | Cod sursa (job #469092) | Cod sursa (job #627502) | Cod sursa (job #1391334) | Cod sursa (job #1197358)
#include <iostream>
#include <fstream>
#define max 101
using namespace std;
int n;
int a[max][max];
void read()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{scanf("%d ",&a[i][j]);
if(a[i][j]==0)
a[i][j]=2e9;}
}
void solve()
{
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
if (i!=j && a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
void print()
{
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
if(a[i][j]!=2e9)
printf("%d ",a[i][j]);
else printf("0 ");
printf("\n");}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
solve();
print();
return 0;
}