Cod sursa(job #1983980)
| Utilizator | Data | 23 mai 2017 09:14:39 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n;
int dmin[105][105];
int main() {
fin >> n;
for(int i = 1; i<=n; ++i)
for(int j = 1; j<=n; ++j)
fin >> dmin[i][j];
for(int k = 1; k<=n; ++k)
for(int i = 1; i<=n; ++i)
for(int j = 1; j<=n; ++j)
if(i!=j)
dmin[i][j] = min(dmin[i][j], dmin[i][k] + dmin[k][j]);
for(int i = 1; i<=n; ++i){
for(int j = 1 ; j<=n; ++j)
fout << dmin[i][j]<<" ";
fout << "\n";
}
return 0;
}
