Pagini recente » Cod sursa (job #1453783) | Cod sursa (job #2982465) | Cod sursa (job #1006642) | Cod sursa (job #3199041) | Cod sursa (job #3130297)
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, graf[105][105];
int main()
{
fin >> n;
memset(graf, 0x3f3f3f, sizeof graf);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fin >> graf[i][j];
}
}
for (int k = 1; k <= n; k++)
{
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
graf[i][j] = min(graf[i][j], graf[i][k] + graf[k][j]);
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fout << graf[i][j] << " ";
}
fout << "\n";
}
return 0;
}