Pagini recente » Cod sursa (job #139383) | Cod sursa (job #1092071) | Cod sursa (job #2514688) | Cod sursa (job #2905126) | Cod sursa (job #260661)
Cod sursa(job #260661)
#include <fstream>
using namespace std;
fstream f;
fstream g;
int n;
int a[101][101];
int i,j,k;
int min(int a,int b)
{
if(a<b)
return a;
return b;
}
int main()
{
f.open("royfloyd.in",fstream::in);
f>> n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f >> a[i][j];
f.close();
g.open("royfloyd.out",fstream::out);
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(!a[i][j]&&a[i][k]&&a[k][j]&&i!=j)
a[i][j] = min(a[i][j],a[i][k]+a[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g << a[i][j] << " ";
g << "\n";
}
g.close();
return 0;
}