Pagini recente » Cod sursa (job #264485) | Cod sursa (job #2444631) | Cod sursa (job #1262920) | Cod sursa (job #3151231) | Cod sursa (job #2846749)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in"); ofstream fout("royfloyd.out");
int n;
int ma[101][101];
int md[101][101]; //matrice pentru algoritm
void read() {
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> ma[i][j], md[i][j] = ma[i][j];
}
void royfloid() {
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int k = 1; k <= n; k++)
if(ma[j][i] && ma[i][k] && (md[j][k] > md[j][i] + md[i][k]))
md[j][k] = md[j][i] + md[i][k];
}
void print() {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
fout << md[i][j] << " ";
fout << "\n";
}
}
void fclose() {
fin.close(), fout.close();
}
int main() {
read();
royfloid();
print();
fclose();
return 0;
}