Pagini recente » Cod sursa (job #694922) | Cod sursa (job #816292) | Cod sursa (job #3163678) | Cod sursa (job #3254229) | Cod sursa (job #2139988)
#include <fstream>
using namespace std;
const int maxn = 105;
const int Inf = 0x3f3f3f3f;
int rf[maxn][maxn], n;
int main()
{
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
{
fin >> rf[i][j];
if(i != j && rf[i][j] == 0)
rf[i][j] == Inf;
}
for (int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
rf[i][j] = min(rf[i][j], rf[i][k] + rf[k][j]);
for (int i = 1; i <= n; ++i, fout << '\n')
for(int j = 1; j <= n; ++j)
fout << rf[i][j] << ' ';
fin.close();
fout.close();
}