Pagini recente » Cod sursa (job #1893865) | Cod sursa (job #2631573) | Cod sursa (job #2407795) | Cod sursa (job #900780) | Cod sursa (job #704376)
Cod sursa(job #704376)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],i,j,n;
void face(){
for(int k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if( i!=k && k!=j && i!=j && a[i][k]+a[k][j] < a[i][j] )
a[i][j]=a[i][k]+a[k][j];
}
void citire(){
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
int x;
f>>x;
if(x==0 && i!=j)
a[i][j]=1001;
else
a[i][j]=x;
}
f.close();
}
int main(void){
f>>n;
citire();
face();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
g.close();
return 0;
}