Pagini recente » Cod sursa (job #2408434) | Cod sursa (job #2304430) | Cod sursa (job #2271677) | Cod sursa (job #1403980) | Cod sursa (job #633012)
Cod sursa(job #633012)
#include <fstream>
using namespace std;
int n,k,a[102][102],i,j;
int main()
{
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]&&a[k][j]&&i!=j)
if(a[i][j]==0)a[i][j]=a[i][k]+a[k][j];
else a[i][j]=min(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;
}