Pagini recente » Cod sursa (job #2048334) | Cod sursa (job #607918) | Cod sursa (job #636285) | Cod sursa (job #2365313) | Cod sursa (job #1104679)
#include <fstream>
using namespace std;
int n, a[105][105];
const int INF = 0x3f3f3f3f;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void citire()
{
int i, j;
fin>>n;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
fin >> a[i][j];
if (!a[i][j] && i!=j)
a[i][j] = INF;
}
}
}
void roy_floyd()
{
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
void afis()
{
int i, j;
for (i = 1; i <= n; i++) {
{
for (j = 1; j <= n; j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
}
}
int main()
{
citire();
roy_floyd();
afis();
return 0;
}