Pagini recente » Cod sursa (job #2089277) | Cod sursa (job #1236625) | Cod sursa (job #279387) | Cod sursa (job #3224938) | Cod sursa (job #1630065)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int nmax=105;
int n,m,i,j,k,a[nmax][nmax];
int main()
{
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][k]+a[k][j]<a[i][j] || !a[i][j]) && a[i][k] && a[k][j] && i!=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;
}