Pagini recente » Cod sursa (job #2494345) | Cod sursa (job #2041503) | Cod sursa (job #2068381) | Cod sursa (job #1640491) | Cod sursa (job #615547)
Cod sursa(job #615547)
#include <cstdio>
#define nmax 101
int a[nmax][nmax], n;
int minim(int x, int y){
if (x > y ) return y;
return x;
}
void citeste(){
scanf("%d\n", &n);
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++)
scanf("%d", &a[i][j]);
//scanf("\n");
}
}
void rezolva(){
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][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || a[i][j]==0) )
a[i][j] = a[i][k] + a[k][j];
}
void scrie(){
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);
citeste();
rezolva();
scrie();
fclose(stdin);
fclose(stdout);
return 0;
}