Pagini recente » Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #2065720) | Cod sursa (job #3323482) | Cod sursa (job #3323481)
#include <bits/stdc++.h>
using namespace std;
//roy floyd
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int p[101][101];
int main() {
int n;
f >> n;
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
f >> p[i][j];
for (int k=1; k<=n; k++)
for (int i=1; i<=n; i++)
for (int j=1; j<=n; j++)
p[i][j] = min(p[i][j], p[i][k] + p[k][j]);
for (int i=1; i<=n; i++) {
for (int j=1; j<=n; j++) {
g << p[i][j] << " ";
}
g << "\n";
}
return 0;
}