Pagini recente » Cod sursa (job #1882630) | Cod sursa (job #2617738) | Cod sursa (job #652812) | Istoria paginii runda/concurs_11_12_02_23 | Cod sursa (job #2208826)
#include<iostream>
#include<fstream>
using namespace std;
int n, a[100][100];
void f()
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
//if (i == j)
// continue;
//if (a[k][j] != 0 && a[i][k] != 0 && i != k && j != k)
if (a[i][j] == 0 || a[i][j] > a[k][j] + a[i][k])
a[i][j] = a[k][j] + a[i][k];
}
}
int main()
{
ifstream g("royfloyd.in");
g >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
g >> a[i][j];
g.close();
f();
ofstream h("royfloyd.out");
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
h << a[i][j] << ' ';
h << endl;
}
h.close();
}