Pagini recente » Cod sursa (job #2167240) | Cod sursa (job #3188493) | Cod sursa (job #1912587) | Cod sursa (job #2661401) | Cod sursa (job #2325267)
#include<bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[105][105], i, j, k;
void citire() {
f >> n;
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
f >> a[i][j];
}
void roy_floyd() {
for(i = 1; i <= n; ++i)
for(j = 1; j <= n; ++j)
for(k = 1; k <= n; ++k)
if((i - j) * (i - k) * (j - k))
if(a[i][k] > a[i][j] + a[j][k])
a[i][k] = a[i][j] + a[j][k];
}
void afisare() {
for(i = 1; i <= n; ++i) {
for(j = 1; j <= n; ++j)
g << a[i][j] << ' ';
g << '\n';
}
}
int main(){
citire();
roy_floyd();
afisare();
return 0;
}