Pagini recente » Cod sursa (job #716571) | Cod sursa (job #2267278) | Cod sursa (job #1529150) | Cod sursa (job #980904) | Cod sursa (job #1577489)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101];
int main()
{
int i,j,n,k;
f>>n;
for(i=1;i<=n;i++) for(j=1;j<=n;j++) f>>a[i][j];
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]) 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";
}
f.close();
g.close();
return 0;
}