Pagini recente » Cod sursa (job #207379) | Cod sursa (job #1772555) | Cod sursa (job #1390244) | Cod sursa (job #726299) | Cod sursa (job #527569)
Cod sursa(job #527569)
#include <iostream>
#include<stdio.h>
using namespace std;
const int lg=100;
int a[lg][lg];//,s[lg][lg];
int n;
int min(int x,int y)
{
if(x<y) return x;
else return y;
}
void read()
{
int i,j;
cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
}
void wfi()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j])
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
void out()
{
int i,j;
for(i=1;i<=n;i++)
{
for(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();
wfi();
out();
return 0;
}