Pagini recente » Cod sursa (job #1448650) | Cod sursa (job #538645) | Cod sursa (job #1208651) | Cod sursa (job #1919475) | Cod sursa (job #1329212)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout ("royfloyd.out");
int p[100][100];
int n;
int main() {
fin>>n;
for(int i=1; i<=n; i++ ){
for(int j=1; j<=n; j++){
fin>>p[i][j];
}
}
for(int k=1; k<=n; k++){
for(int i=1; i<=n; i++){
for(int j=1; j<n; j++){
if (p[i][k] && p[k][j] && (p[i][j] > p[i][k] + p[k][j] || !p[i][j]) && i != j){
p[i][j] = p[i][k] + p[k][j];
}
}
}
}
for(int i=1; i<=n; i++ ){
for(int j=1; j<=n; j++){
fout<<p[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}