Pagini recente » Cod sursa (job #1211776) | Istoria paginii runda/bkt1/clasament | Cod sursa (job #437933) | Cod sursa (job #1642995) | Cod sursa (job #1917802)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,a[105][105],j,k;
/*int nivel(int n)
{
int i=1,niv=0;
while(n>0)
{
n=n-i*i;
i++;
niv++;
}
return niv;
}
void minim()
{
for(i=niv-1;i>=1;i--)
{
for(j=1;j<=i;j++)
for(k=1;k<=i;k++)
a[i][j][k]=a[i][j][k]+min(min(a[i+1][j][k],a[i+1][j+1][k]),min(a[i+1][j][k+1],a[i+1][j+1][k+1]));
}
}*/
int main()
{
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>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] + a[k][j] || !a[i][j]) && i != j)
a[i][j]=a[i][k]+a[k][j];
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<'\n';
}
return 0;
}