Pagini recente » Cod sursa (job #1867777) | Cod sursa (job #2802628) | Cod sursa (job #395164) | Cod sursa (job #2984379) | Cod sursa (job #2231763)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
short int n;
short int a[101][101];
void RoyFloyd() {
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] && i != j && i != k && j != k)
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
int main()
{
fin >> n;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
fin >> a[i][j];
if(a[i][j] == 0)
a[i][j] = 1001;
}
}
RoyFloyd();
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(a[i][j] == 1001)
fout << 0 << ' ';
else
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}