Pagini recente » Cod sursa (job #1295689) | Cod sursa (job #2198509) | Cod sursa (job #3320870) | Cod sursa (job #2454570) | Cod sursa (job #2198588)
#include <fstream>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
ifstream in("royfloyd.in");
in >> n;
int dp[n+1][n+1];
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
in >> dp[i][j];
}
}
in.close();
for(int k = 1; k <= n; ++k) {
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n ; ++j) {
if(dp[i][j] > dp[i][k] + dp[k][j])
dp[i][j] = dp[i][k] + dp[k][j];
}
}
}
ofstream out("royfloyd.out");
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= n; ++j) {
out << dp[i][j] << " ";
}
out << '\n';
}
out.close();
}