Pagini recente » Cod sursa (job #760485) | Cod sursa (job #649245) | Monitorul de evaluare | Cod sursa (job #672872) | Cod sursa (job #944862)
Cod sursa(job #944862)
#include<iostream>
#include<stdio.h>
#define Nmax 101
using namespace std;
int N;
int a[Nmax][Nmax];
int main()
{
freopen("royfloyd.in", "r", stdin);
freopen("royfloyd.out", "w", stdout);
cin >> N;
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= N; ++j)
cin >> a[i][j];
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];
for(int i = 1; i <= N; ++i)
{
for(int j = 1; j <= N; ++j)
cout << a[i][j] << " ";
cout << endl;
}
return 0;
}