Pagini recente » Cod sursa (job #634143) | Cod sursa (job #619573) | Cod sursa (job #489458) | Cod sursa (job #1222683) | Cod sursa (job #3211975)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, d[101][101];
int main(){
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> d[i][j];
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(d[i][k] && d[k][j] && (d[i][j] > d[i][k] + d[k][j] || !d[i][j]) && i != j) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
for(int i = 1; i <= n; i++, fout << '\n')
for(int j = 1; j <= n; j++)
fout << d[i][j] << ' ';
return 0;
}