Mai intai trebuie sa te autentifici.
Cod sursa(job #2425495)
Utilizator | Data | 24 mai 2019 21:00:47 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, dp[101][101];
int main() {
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> dp[i][j];
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (i != j && dp[i][k] && dp[k][j] && (!dp[i][j] || dp[i][k] + dp[k][j] < dp[i][j]))
dp[i][j] = dp[i][k] + dp[k][j];
for (int i = 1; i <= n; i++, out << '\n')
for (int j = 1; j <= n; j++)
out << dp[i][j] << ' ';
return 0;
}