Pagini recente » Cod sursa (job #554694) | Cod sursa (job #3153425) | Cod sursa (job #2420362) | Cod sursa (job #2139329) | Cod sursa (job #2426674)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int main() {
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
unsigned int n;
unsigned int A[101][101];
in >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> A[i][j];
in.close();
for (unsigned 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] > A[i][k] + A[k][j] || !A[i][j]) && i != j)
A[i][j] = A[i][k] + A[k][j];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
out << A[i][j] << ' ';
out << '\n';
}
out.close();
return 0;
}