Pagini recente » Cod sursa (job #2715874) | Cod sursa (job #974582) | Cod sursa (job #184882) | Cod sursa (job #977466) | Cod sursa (job #2758491)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n;
int costuri[101][101],vecini[101][101];
int main()
{
f >> n;
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
{
f >> costuri[i][j];
}
}
for(int k = 1;k<=n;k++)
{
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
{
costuri[i][j] = min(costuri[i][j], costuri[i][k] + costuri[k][j]);
}
}
}
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
{
g << costuri[i][j]<< " ";
}
g << endl;
}
}