Pagini recente » Cod sursa (job #2015717) | Cod sursa (job #1154474) | Rating Muresan Adrian (adi_m) | Cod sursa (job #2009033) | Cod sursa (job #3041921)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[105][105];
int main(){
int n;
fin >> n;
for(int i =1; i <=n; i++)
for(int j = 1; j <= n; j++)
fin >> 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++ , fout << '\n')
for(int j = 1; j <= n; j++)
fout << a[i][j] << ' ';
}