Pagini recente » Cod sursa (job #3040816) | Cod sursa (job #848963) | Cod sursa (job #2825577) | Cod sursa (job #3278969) | Cod sursa (job #617494)
Cod sursa(job #617494)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n, a[100][100];
ifstream in("royfloyd.in");
in >> n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
in >> a[i][j];
in.close();
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
for (int k = 0; k < n; ++k)
if (j!=k && a[j][i] && a[i][k]))
a[j][k] = a[j][k] != 0 ? min(a[j][i] + a[i][k], a[j][k]) : a[j][i] + a[i][k];
ofstream out("royfloyd.out");
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
out << a[i][j] << " ";
out << "\n";
}
out.close();
return 0;
}