Cod sursa(job #2444621)
| Utilizator | Data | 31 iulie 2019 20:39:45 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
int cost[105][105];
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
fin >> cost[i][j];
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j){
for(int k = 1; k <= n; ++k)
cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
}
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
fout << cost[i][j] << " ";
fout << "\n";
}
return 0;
}
