Pagini recente » Cod sursa (job #1631040) | Istoria paginii runda/calcularea_aia/clasament | Cod sursa (job #1076594) | Cod sursa (job #2488204) | Cod sursa (job #1726234)
#include <iostream>
#include <cstdio>
using namespace std;
int a[105][105],n;
void citire()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
}
void cerinta()
{
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(a[i][j]>a[i][k]+a[k][j])
if(i!=k&&j!=k)
a[i][j]=a[i][k]+a[k][j];
}
}
void afisare()
{
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);
citire();
cerinta();
afisare();
//cout << "Hello world!" << endl;
return 0;
}