Pagini recente » Algoritmiada 2011 - Clasament Runda 1, Open | Cod sursa (job #3150385) | Diferente pentru preoni-2007/runda-finala/solutii intre reviziile 19 si 28 | Cod sursa (job #3150486) | Cod sursa (job #2079698)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void floyd(int a[150][150],int n)
{
int y,i,j;
for(y=1;y<=n;y++)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if((a[i][j]>a[i][y]+a[y][j])&&(i!=j)&&(i!=y)&&(j!=y))
a[i][j]=a[i][y]+a[y][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
fout<<a[i][j]<<' ';
fout<<"\n";
}
}
int main()
{
int n,a[150][150];
fin>>n;
int i,j;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
fin>>a[i][j];
floyd(a,n);
return 0;
}