Pagini recente » Cod sursa (job #2647961) | Cod sursa (job #3283752) | Cod sursa (job #2064578) | Cod sursa (job #1352713) | Cod sursa (job #2518768)
#include <iostream>
#include <fstream>
#include <algorithm>
#define NMAX 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int rf[NMAX][NMAX];
int N, M;
int main()
{
int x, y, w;
fin >> N >> M;
for(int i = 1; i <= M; i++){
fin >> x >> y >> w;
rf[x][y] = w;
}
for(int k = 1; k <= N; k++){
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
if(rf[i][k] && rf[k][j] && (rf[i][j] > rf[i][k] + rf[k][j] || !rf[i][j]) && i != j)
rf[i][j] = rf[i][k] + rf[k][j];
}
}
}
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
fout << rf[i][j] << " ";
}
fout << "\n";
}
return 0;
}