Pagini recente » Cod sursa (job #1704911) | Monitorul de evaluare | Cod sursa (job #790837) | Cod sursa (job #1789986) | Cod sursa (job #551066)
Cod sursa(job #551066)
#include<iostream.h>
#include<fstream.h>
int a[20][20],i,j,k,n;
const int max=32000;
void creare()
{
ifstream f;
f.open("royfloyd.in");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
f.close();
}
void transformare()
{
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]!=0 && a[k][j]!=0 && i!=j && a[i][k]+a[k][j]<a[i][j] )
a[i][j]=a[i][k]+a[k][j];
}
void afis()
{
ofstream g;
g.open("royfloyd.out");
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;}
g.close();
}
int main()
{
creare();
transformare();
afis();
return 0;
}