Pagini recente » Cod sursa (job #3036989) | Cod sursa (job #1992129) | Cod sursa (job #3335240) | Cod sursa (job #3316459) | Cod sursa (job #3323936)
#include <iostream>
#include <fstream>
using namespace std;
const int F = 100000000;
int main() {
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) {
fin >> a[i][j];
if(a[i][j] == 0 && i != j) a[i][j] = F;
}
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(a[i][j] == F) fout << 0 << " ";
else fout << a[i][j] << " ";
}
fout << "\n";
}
return 0;
}