Pagini recente » Cod sursa (job #1337104) | Cod sursa (job #3334251) | Monitorul de evaluare | Cod sursa (job #1405534) | Cod sursa (job #3325356)
#include <bits/stdc++.h>
using namespace std;
int n, a[105][105];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, m;
void citire(){
int i, j;
cin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
cin >> a[i][j];
}
void royfloyd(){
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
if (i == j)
continue;
int aik = a[i][k], akj = a[k][j];
if (aik == 0 || akj == 0)
continue;
int cand = aik + akj;
if (a[i][j] == 0 || a[i][j] > cand)
a[i][j] = cand;
}
}
void afisare(){
int i, j;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
cout << a[i][j] << " ";
cout << "\n";
}
}
int main()
{
citire();
royfloyd();
afisare();
return 0;
}