Pagini recente » Cod sursa (job #2468326) | Cod sursa (job #2566131) | Cod sursa (job #1435635) | Cod sursa (job #1924699) | Cod sursa (job #2110611)
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int Nmax = 105;
int a[Nmax][Nmax], n;
void citire(){
f >> n;
int i, j;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
f >> a[i][j];
}
void afisare(){
int i, j;
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++)
g << a[i][j] << ' ';
g << '\n';
}
}
void roy_floyd(){
int i, j, k;
for(j = 1; j <= n; j++)
for(i = 1; i <= n; i++)
for(k = 1; k <= n; k++)
if(a[i][j] and a[j][k] and (a[i][j] + a[j][k] < a[i][k] or !a[i][k]) and i != k)
a[i][k] = a[i][j] + a[j][k];
}
int main(){
citire();
roy_floyd();
afisare();
return 0;
}