Pagini recente » Cod sursa (job #18030) | Cod sursa (job #1302724) | Cod sursa (job #235877) | Cod sursa (job #1532726) | Cod sursa (job #3130304)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, graf[105][105];
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
fin >> graf[i][j];
if (!graf[i][j] && i != j)
graf[i][j] = 0x3f3f3f3;
}
}
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++)
{
if (graf[i][j] == 0x3f3f3f3f)
fout << "0 ";
else
fout << graf[i][j] << " ";
}
fout << "\n";
}
return 0;
}