Pagini recente » Cod sursa (job #164553) | Algoritmiada 2016 - Clasament general, Juniori | Cod sursa (job #822045) | Cod sursa (job #1273463) | Cod sursa (job #1616076)
#include <fstream>
#define in "royfloyd.in"
#define out "royfloyd.out"
#define dmax 105
using namespace std;
ifstream fin(in);
ofstream fout(out);
int n, m[dmax][dmax];
void citire();
void royfloyd();
void afisare();
int main(){
citire();
royfloyd();
afisare();
return 0;
}
void citire(){
int i, j;
fin>>n;
for(i=0; i<n; ++i)
for(j=0; j<n; ++j)
fin>>m[i][j];
}
void royfloyd(){
int x, y, z;
for(z=0; z<n; ++z)
for(x=0; x<n; ++x)
for(y=0; y<n; ++y)
if(m[x][y]>m[x][z]+m[z][y])
m[x][y]=m[x][z]+m[z][y];
}
void afisare(){
int i, j;
for(i=0; i<n; ++i){
for(j=0; j<n; ++j)
fout<<m[i][j]<<' ';
fout<<'\n';
}
fout.close();
}