Pagini recente » Cod sursa (job #1831954) | Cod sursa (job #3199245) | Cod sursa (job #198557) | Cod sursa (job #2538967) | Cod sursa (job #2967829)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[105][105] , n , m;
int main()
{
f >> n ;
for ( int i = 1 ; i <= n ; i++)
for ( int j = 1 ; j <= n ; j++)
a[i][j] = -1;
for ( int i = 1 ; i <= n ; i++)
for ( int j = 1 ; j <= n ; j++)
f >> a[i][j] ;
for ( int k = 1 ; k <= n ; k ++)
for ( int i = 1 ; i <= n ; i++)
for ( int j = 1 ; j <= n ; j++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
for ( int i = 1 ; i <= n ; i++ , g << '\n')
for ( int j = 1 ; j <= n ; j++)
if(a[i][j] == -1)
g << 0 << " ";
else
g << a[i][j] << " ";
return 0;
}