Pagini recente » Cod sursa (job #1676675) | Cod sursa (job #3202922) | Cod sursa (job #2240183) | Cod sursa (job #1140416) | Cod sursa (job #2812413)
#include<bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int cost[101][101], d[101][101], p[101][101];
int main(){
int i,j,k;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++) {
f >> cost[i][j];
if (i != j && cost[i][j] == 0) {
d[i][j] = 1001;
p[i][j] = 0;
} else {
d[i][j] = cost[i][j];
p[i][j] = i;
}
}
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (d[i][j] > d[i][k] + d[k][j]) {
d[i][j] = d[i][k] + d[k][j];
p[i][j] = p[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<d[i][j]<<" ";
g<<endl;
}
}