Pagini recente » Cod sursa (job #1339741) | Cod sursa (job #1353348) | Cod sursa (job #1459069) | Cod sursa (job #1844258) | Cod sursa (job #2076140)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
#define MAX 105
int n, a[MAX][MAX];
void royfloyd()
{
for(int k = 1; k <= n; ++k)
{
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
if(i != j and i != k and j != k and a[i][j] != 0 and a[i][k] != 0 and a[k][j] != 0 and a[i][j] > a[i][k] + a[k][j])
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main()
{
cin >> n;
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
cin >> a[i][j];
}
}
royfloyd();
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
{
cout << a[i][j] << ' ';
}
cout << '\n';
}
return 0;
}