Pagini recente » Istoria paginii runda/eusebiu_oji_2017_cls11-12 | Cod sursa (job #2368709) | Cod sursa (job #1111857) | Cod sursa (job #1849435) | Cod sursa (job #1899535)
#include <iostream>
#include <cstdio>
using namespace std;
int n,a[110][110];
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 royfloyd()
{
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][j]>a[i][k]+a[k][j]&&a[i][k]&&a[k][j])
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();
royfloyd();
afisare();
//cout << "Hello world!" << endl;
return 0;
}