Pagini recente » Cod sursa (job #1430792) | Cod sursa (job #582171) | Cod sursa (job #2516645) | Cod sursa (job #165705) | Cod sursa (job #2448025)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
int a[105][105];
int main()
{
ios::sync_with_stdio(false);
fin.tie(0);
int n;
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
cin >> 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][k] && a[k][j]) a[i][j] = min(a[i][k] + a[k][j], a[i][j]);
}
}
}
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j)
fout << a[i][j] << " ";
fout << "\n";
}
return 0;
}