Pagini recente » Cod sursa (job #278233) | Cod sursa (job #750578) | Cod sursa (job #1073452) | Cod sursa (job #2444502) | Cod sursa (job #1360583)
// royfloyd
#include <iostream>
#include <fstream>
#define NMax 105
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int A[NMax][NMax];
void read() {
f>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
f>>A[i][j];
}
void solve() {
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] != 0 && A[k][j] != 0 && i != j && (A[i][j] > A[i][k]+A[k][j] || A[i][j] == 0))
A[i][j] = A[i][k]+A[k][j];
}
}
void output() {
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++)
g<<A[i][j]<<' ';
g<<'\n';
}
}
int main() {
read();
solve();
output();
f.close(); g.close();
return 0;
}