Pagini recente » Cod sursa (job #1112379) | Borderou de evaluare (job #605890) | Cod sursa (job #1388912) | Cod sursa (job #334370) | Cod sursa (job #1464815)
#include <iostream>
#include <fstream>
using namespace std;
int a[257][257];
int main()
{
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int i, j,k, n;
in >> n;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
in >> a[i][j];
}
}
for (k = 1; k <= n; k++)
{
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (a[i][k] + a[k][j] < a[i][j])
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
out << a[i][j]<<" ";
}
out << "\n";
}
}