Pagini recente » Cod sursa (job #997628) | Monitorul de evaluare | Rating asdFc dd2 (fenrig) | Cod sursa (job #1870866) | Cod sursa (job #1207009)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
int n,a[105][105],i,j,k;
ifstream f("royfloyd.in");
ofstream g("royfloyd.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]!=0 && a[k][j]!=0&&(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;
}