Pagini recente » Cod sursa (job #1736824) | Istoria paginii utilizator/vreaulaoxford | Cod sursa (job #1058284) | Cod sursa (job #1126500) | Cod sursa (job #794543)
Cod sursa(job #794543)
#include <cstdio>
using namespace std;
int n,a[102][102];
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 royfloyd()
{
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] || !a[i][j]) && i!=j && a[i][k] && a[k][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++)
printf("%d ",a[i][j]);
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
royfloyd();
print();
return 0;
}