Pagini recente » Cod sursa (job #1106776) | Cod sursa (job #2487939) | Cod sursa (job #1701931) | Cod sursa (job #2594887) | Cod sursa (job #3257730)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int NMAX = 100 + 1;
const int INF = 1e9;
int n;
int a[NMAX][NMAX];
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)
{
a[i][j] = INF;
}
}
}
for(int k=1; k<=n; k++)
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(i != j && j != k && i != k)
{
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
}
}
}
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;
}