Pagini recente » Cod sursa (job #1644915) | Cod sursa (job #2480852) | Cod sursa (job #1387097) | Cod sursa (job #1452112) | Cod sursa (job #3130319)
#define INF 1e9
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, a[101][101];
void roy_floyd()
{
for(int k = 1; k <= n; k++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(a[i][k] + a[k][j] < a[i][j])
{
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
in >> a[i][j];
if(a[i][j] == 0 && i != j){
a[i][j] = INF;
}
}
roy_floyd();
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(a[i][j] = INF)
{
a[i][j] = 0;
}
out << a[i][j] << " ";
}
out << '\n';
}
return 0;
}