Pagini recente » Cod sursa (job #1720388) | Cod sursa (job #415156) | Cod sursa (job #2894068) | Cod sursa (job #183390) | Cod sursa (job #862090)
Cod sursa(job #862090)
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, a[101][101];
void cit(){
f>>n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
f>>a[i][j];
}
void rf(){
for(int k=1; k<=n; ++k)
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
if( a[i][k]!=0 && a[k][j]!=0)
if(a[i][j]>=a[i][k]+a[k][j]) a[i][j]=a[i][k]+a[k][j];
}
void afis(){
for(int i=1; i<=n; ++i){
for(int j=1; j<=n; ++j)
g<<a[i][j]<<' ';
g<<'\n';
}
}
int main(){
cit();
rf();
afis();
return 0;
}