Pagini recente » Cod sursa (job #304303) | Cod sursa (job #2538445) | Cod sursa (job #1786745) | Cod sursa (job #425537) | Cod sursa (job #2279342)
#include <bits/stdc++.h>
#define ADVANCED 0
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
struct {
int cost, venit_din;
} roy[258][258];
int N;
int main()
{
f >> N;
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
f >> roy[i][j].cost;
for(int k = 1; k <= N; k++)
for(int i = 1; i <= N; i++)
for(int j = 1; j <= N; j++)
if(roy[i][k].cost && roy[k][j].cost && i != j)
if(roy[i][j].cost > roy[i][k].cost + roy[k][j].cost) {
roy[i][j].cost = roy[i][k].cost + roy[k][j].cost;
roy[i][j].venit_din = k;
}
for(int i = 1; i <= N; i++) {
for(int j = 1; j <= N; j++)
g << roy[i][j].cost << " ";
g << "\n";
}
return 0;
}