Pagini recente » Cod sursa (job #2957825) | Cod sursa (job #2489525) | Cod sursa (job #695893) | Cod sursa (job #2043380) | Cod sursa (job #1090483)
#include<fstream>
#define M 32000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
short a[101][101],n;
void citire()
{
int i,j;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]==0&&(i-j))
a[i][j]=M;
}
void solve()
{
int i,k,j;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if((i-j)&&(i-k)&&(j-k))
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
int i,j;
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
if(a[i][j]==M)
g<<0<<" ";
else g<<a[i][j]<<" ";
g<<'\n';
}
}
int main()
{
citire();
solve();
afisare();
return 0;
}