Pagini recente » Cod sursa (job #1634457) | Cod sursa (job #2427689) | Cod sursa (job #2669960) | Cod sursa (job #2515297) | Cod sursa (job #2715606)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("royfloyd.in");
ofstream o("royfloyd.out");
int main()
{
int v;
f >> v;
int a[v][v];
for (int i = 0; i < v; i++)
for (int j = 0; j < v; j++)
{
if (i == j)
a[i][j] = 0;
else
a[i][j] = INT_MAX;
}
for (int i = 0; i < v; i++)
for (int j = 0; j < v; j++)
f >> a[i][j];
for (int k = 0; k < v; k++)
for (int i = 0; i < v; i++)
for (int j = 0; j < v; j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
for (int i = 0; i < v; i++)
{
for (int j = 0; j < v; j++)
o << a[i][j] << " ";
o << "\n";
}
}