Pagini recente » Cod sursa (job #1210776) | Cod sursa (job #687667) | Cod sursa (job #3218457) | Cod sursa (job #1814590) | Cod sursa (job #2444623)
#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 k = 1; k <= n; ++k){
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
if(cost[i][k] && cost[k][j] && i != j){
if(cost[i][j]) cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
else 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;
}