Pagini recente » Cod sursa (job #1056271) | Cod sursa (job #2285745) | Cod sursa (job #3189261) | Cod sursa (job #2386724) | Cod sursa (job #1129418)
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[101][101], n, i, j, k;
int main(){
fin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
fin >> d[i][j];
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (d[i][j] > d[i][k] + d[k][j])
d[i][j] = d[i][k] + d[k][j];
for (i = 1; i <= n; i++){
for (j = 1; j <= n; j++){
fout << d[i][j] << " ";
}
fout <<'\n';
}
fin.close();
fout.close();
}