Cod sursa(job #2871119)
| Utilizator | Data | 12 martie 2022 21:27:39 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,d[105][105],i,j,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fin>>d[i][j];
}
}
for(k=1;k<=n;k++){
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(d[i][k] + d[k][j] < d[i][j]){
d[i][j] = d[i][k] + d[k][j];
}
}
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
fout << d[i][j] << " ";
}
fout << '\n';
}
return 0;
}
