Pagini recente » Cod sursa (job #1441123) | Cod sursa (job #300861) | Cod sursa (job #23605) | Cod sursa (job #1166297) | Cod sursa (job #1205088)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int INF = 1001;
int n, a[101][101], i, j, k;
void Roy()
{
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if( i != k && k != j && i != j )
if( a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
void Read()
{
f >> n;
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
{
f >> a[i][j];
if(a[i][j] == 0 && i != j)
a[i][j] = INF;
}
}
void Write()
{
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
{
if(a[i][j] == INF && i != j )
a[i][j] = 0;
g << a[i][j] << ' ';
}
g << '\n';
}
}
int main()
{
Read();
Roy();
Write();
return 0;
}