Pagini recente » Cod sursa (job #3347481) | Borderou de evaluare (job #298561) | Monitorul de evaluare | Cod sursa (job #671583) | Cod sursa (job #3329079)
#include<fstream>
using namespace std;
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
fin >> n;
int arr[n][n];
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j)
fin >> arr[i][j];
}
for(int k = 0; k < n; ++k) {
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
arr[i][j]=min(arr[i][j], arr[i][k]+arr[k][j]);
}
for(int i = 0; i < n; ++i, fout << '\n')
for(int j = 0; j < n; ++j, fout << ' ')
fout << arr[i][j];
fout.close();
fin.close();
return 0;
}