Pagini recente » Cod sursa (job #315118) | Cod sursa (job #2905694) | Cod sursa (job #1727407) | Cod sursa (job #1060125) | Cod sursa (job #2636663)
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int g[105][105], n;
void citire() {
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> g[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(g[i][k]+g[k][j] < g[i][j] && i != k && k != j && i != j)
g[i][j] = g[i][k]+g[k][j];
}
void afis() {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
fout << g[i][j] << ' ';
fout << '\n';
}
}
int main() {
citire();
solve();
afis();
}