Pagini recente » Cod sursa (job #2660631) | Cod sursa (job #1917589) | Cod sursa (job #1700493) | Cod sursa (job #2626807) | Cod sursa (job #1718675)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
int i,j,k,n,A[20][20];
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";
}
return 0;
}