Pagini recente » Cod sursa (job #1383897) | Cod sursa (job #2467146) | Cod sursa (job #583054) | Cod sursa (job #2866278) | Cod sursa (job #1597671)
#include <iostream>
#include <fstream>
#define maxn 100
using namespace std;
int main()
{int i,j,k,a[maxn][maxn],n;
fstream f("royfloyd.in",ios::in);
fstream g("royfloyd.out",ios::out);
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][k]!=0)&&(a[k][j]!=0))
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();
}