Pagini recente » Cod sursa (job #1220537) | Cod sursa (job #1488938) | Cod sursa (job #950765) | Cod sursa (job #1912945) | Cod sursa (job #1630620)
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
short n, v[101][101];
int main()
{
f >> n;
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
f >> v[i][j];
for (int k=1; k<=n; ++k)
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
{
if (k!=j && k!=i && v[i][k]+v[k][j]<v[i][j] && v[i][k]+v[k][j]!=0)
v[i][j] = v[i][k] + v[k][j];
}
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=n; ++j)
g << v[i][j] << " ";
g << "\n";
}
return 0;
}