Pagini recente » Cod sursa (job #843812) | Cod sursa (job #2820581) | Istoria paginii runda/ojipreg | Cod sursa (job #2532019) | Cod sursa (job #1918473)
#include <iostream>
#include <fstream>
using namespace std;
int a[110][110],n;
void royd()
{
int i , j , k ;
for ( k = 1 ; k <= n ; k++ )
for ( i = 1 ; i <= n ; i++ )
for ( j = 1 ; j<= n ; j++ )
if ( ( a[i][j] > a[i][k] + a[k][j] || !a[i][j] ) && i-j && a[i][k] && a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>a[i][j];
royd();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}