Pagini recente » Cod sursa (job #420291) | Cod sursa (job #2689490) | Cod sursa (job #2381373) | Cod sursa (job #1148394) | Cod sursa (job #2538365)
#include <fstream>
std::ifstream f("royfloyd.in");
std::ofstream g("royfloyd.out");
const int NMAX = 105;
const int INF = (1LL << 31) - 1;
int n,a[NMAX][NMAX],dist[NMAX][NMAX];
void roy_floyd(){
for(int k = 1;k <= n;++k)
for(int i = 1;i <= n;++i)
for(int j = 1;j <= n;++j)
if(dist[i][j] > dist[i][k] + dist[k][j])
dist[i][j] = dist[i][k] + dist[k][j];
}
int main(){
f >> n;
for(int i = 1;i <= n;++i){
for(int j = 1;j <= n;++j){
f >> a[i][j];
if(i == j)
dist[i][j] = 0;
else if(a[i][j] == 0)
dist[i][j] = INF;
else
dist[i][j] = a[i][j];
}
}
roy_floyd();
for(int i = 1;i <= n;++i,g << '\n')
for(int j = 1;j <= n;++j)
g << dist[i][j] << ' ';
return 0;
}