Pagini recente » Cod sursa (job #1594926) | Cod sursa (job #896964) | Cod sursa (job #1524763) | Cod sursa (job #2589812) | Cod sursa (job #2726174)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int N = 102;
void RoyFloyd(int a[102][102], int n)
{
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if(i!=j)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
int main()
{
int n;
in >> n;
int a[102][102];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
in >> a[i][j];
RoyFloyd(a, n);
for (int i = 1; i <= n; i++)
a[i][i] = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
out << a[i][j] << ' ';
out << '\n';
}
}