Pagini recente » salsa | Cod sursa (job #2458545) | Cod sursa (job #1543876) | Monitorul de evaluare | Cod sursa (job #2574993)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
#define MAXN 105
int n, a[MAXN][MAXN];
void roy_floyd()
{
int i, j ,k;
for(int k = 1 ; k <= n ; k ++)
for(int i = 1 ; i <= n ; i ++)
for(int j = 1 ; j <= n ; j ++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
int main() {
cin >> n;
for(int i = 1; i <= n ; i++)
for(int j = 1; j <= n ; j++)
cin >> a[i][j];
roy_floyd();
for(int i = 1; i <= n ; i++, cout <<"\n")
for(int j = 1; j <= n ; j++)
cout << a[i][j] << " ";
return 0;
}