Pagini recente » Cod sursa (job #1212605) | Cod sursa (job #2704256) | Cod sursa (job #2300154) | Cod sursa (job #2507164) | Cod sursa (job #840685)
Cod sursa(job #840685)
#include <fstream>
#define infinit 100*100*100
using namespace std;
int M[100][100];
int n;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
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(M[i][j] > M[i][k] + M[k][j] && i!=j)
M[i][j] = M[i][k] + M[k][j];
}
int main(){
f >> n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
if(i == j)
M[i][j] = 0;
else
M[i][j] = infinit;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f >> M[i][j];
roy_floyd();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(M[i][j] == infinit)
M[i][j] = 0;
g << M[i][j] << " ";
}
g << '\n';
}
f.close();
g.close();
return 0;
}