Pagini recente » Cod sursa (job #475429) | Cod sursa (job #2551985) | Cod sursa (job #1971596) | Cod sursa (job #464978) | Cod sursa (job #1205590)
#include <iostream>
#include <stdio.h>
using namespace std;
int p[101][101],n;
void RoyFloyd(){
for(int k = 0; k < n; k++)
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(p[i][k] + p[k][j] < p[i][j])
p[i][j] = p[i][k] + p[k][j];
}
int main(){
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%d",&n);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
scanf("%d",&p[i][j]);
RoyFloyd();
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)
printf("%d ",p[i][j]);
printf("\n");
}
return 0;
}