Pagini recente » Cod sursa (job #205817) | Cod sursa (job #2950445) | Cod sursa (job #1315046) | Cod sursa (job #1858347) | Cod sursa (job #1197344)
#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]);
}
void solve()
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int k=1;k<=n;k++)
if(a[j][i]+a[i][k]<a[j][k])
a[j][k]=a[j][i]+a[i][k];
for(int i=1;i<=n;i++)
a[i][i]=0;
}
void print()
{
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
printf("%d ",&a[i][j]);
printf("\n");}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
solve();
print();
return 0;
}