Pagini recente » Cod sursa (job #1186440) | Cod sursa (job #1633836) | Cod sursa (job #2493291) | Cod sursa (job #2457417) | Cod sursa (job #889541)
Cod sursa(job #889541)
#include <stdio.h>
using namespace std;
int m[205][205],n;
void citire(){
scanf("%d\n",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%d",&m[i][j]);
}
}
void royw(){
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(m[i][k] && m[k][i] && (m[i][j] > m[i][k] + m[k][j] || !m[i][j]) && i != j)m[i][j]=m[i][k]+m[k][j];
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
citire();
royw();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
printf("%d ",m[i][j]);
printf("\n");
}
return 0;
}