Pagini recente » Cod sursa (job #204703) | Cod sursa (job #3249403) | Cod sursa (job #1864220) | Cod sursa (job #570268) | Cod sursa (job #808984)
Cod sursa(job #808984)
#include <iostream>
#include <fstream>
using namespace std;
int a[101][101], n;
void citire() {
ifstream fin("royfloyd.in");
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> a[i][j];
}
void roy_floyd() {
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] * a[k][j] != 0 && i != j)
if(a[i][k] + a[k][j] < a[i][j] || a[i][j] == 0)
a[i][j] = a[i][k] + a[k][j];
}
int main() {
citire();
roy_floyd();
ofstream fout("royfloyd.out");
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++)
fout << a[i][j] << ' ';
fout << '\n';
}
return 0;
}