Pagini recente » Cod sursa (job #685088) | Cod sursa (job #1624504) | Cod sursa (job #1820737) | Cod sursa (job #405674) | Cod sursa (job #939840)
Cod sursa(job #939840)
#include <fstream>
#include <stdio.h>
using namespace std ;
int a[102][102];
int n;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
void citire(){
cin >> n ;
for (int i = 1 ; i <= n ; i++)
for (int j = 1 ; j <= n ; j++)
cin >> a[i][j] ;
}
void roy_floyd()
{
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][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
}
int main(){
citire();
int i,j,k;
roy_floyd();
/*
for(i=0 ; i < n ; i ++)
for(j=0;j<n;j++)
for(k=0;k<n;k++)
if ((v[j][i]+v[i][k]<v[j][k] || !v[j][k]) &&
v[i][j] && v[j][k] && (j != k))
v[j][k] = v[j][i]+v[i][k] ;
*/
for (int i = 1 ; i <= n ; i++) {
for (int j = 1 ; j <= n ; j++)
cout << a[i][j] << " ";
cout << endl ;
}
cout.flush();
return 0 ;
}