Pagini recente » Borderou de evaluare (job #1069080) | Cod sursa (job #3140104) | Cod sursa (job #2750309)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int INF = 1e6;
const int N=101;
int n,a[N][N];
void citire()
{
in>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
in>>a[i][j];
if (i != j && a[i][j] == 0)
{
a[i][j] = INF;
}
}
}
void afisare()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
if(a[i][j]==INF)
out<<0<<" ";
else
out<<a[i][j]<<" ";
out<<"\n";
}
}
void RF()
{
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int x,y;
citire();
RF();
afisare();
return 0;
}