Pagini recente » Cod sursa (job #2773551) | Cod sursa (job #3004104) | Cod sursa (job #2335270) | Cod sursa (job #2750338) | Cod sursa (job #2195423)
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int k,i,j,n,d[102][102];
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] != 0)
{
if (d[i][j] > d[i][k] + d[k][j] && d[i][k] != 0 && d[k][j] != 0)
{
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';
}
return 0;
}