Pagini recente » Cod sursa (job #2288709) | Cod sursa (job #2710204) | Istoria paginii runda/becreative24/clasament | Cod sursa (job #365279) | Cod sursa (job #840689)
Cod sursa(job #840689)
#include <fstream>
using namespace std;
int infinit = 1000*100*100;
int M[102][102];
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++){
f >> M[i][j];
if(M[i][j] == 0)
M[i][j] = infinit;
}
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;
}