Pagini recente » Borderou de evaluare (job #707800) | Cod sursa (job #1541422) | Borderou de evaluare (job #2685165) | Borderou de evaluare (job #3114692) | Cod sursa (job #3274139)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMAX = 1000000;
int n, D[101][101];
int main()
{
int i, j, k;
f >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i == j) D[i][j] = 0;
else D[i][j] = NMAX;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
f >> 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++)
if(D[i][j] == NMAX) g << 0 << ' ';
else g << D[i][j] << ' ';
g << '\n';
}
f.close();
g.close();
return 0;
}