Pagini recente » Cod sursa (job #3176968) | Cod sursa (job #736866) | Cod sursa (job #1354576) | Cod sursa (job #1648049) | Cod sursa (job #301824)
Cod sursa(job #301824)
#include <fstream>
using namespace std;
int a[101][101],n;
int min(int a,int b)
{return a<b?a:b;}
int main()
{int i,j,k;
ifstream in("royfloyd.in");
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)in>>a[i][j];
in.close();
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&i!=k&&j!=k&&a[i][k]&&a[k][j])
if(a[i][j])a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
else a[i][j]=a[i][k]+a[k][j];
ofstream out("royfloyd.out");
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)out<<a[i][j]<<' ';out<<'\n';}
out.close();
return 0;
}