Pagini recente » Cod sursa (job #3039444) | Cod sursa (job #2590624) | Cod sursa (job #362391) | Cod sursa (job #3041956) | Cod sursa (job #1291435)
#include <iostream>
#include <fstream>
#define nmax 105
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int A[nmax][nmax];
int main(){
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++)
A[i][j] = min(A[i][j], A[i][k]+A[k][j]);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
fout << A[i][j] << " ";
fout << "\n";
}
fin.close();
fout.close();
return 0;
}