Pagini recente » Cod sursa (job #1450348) | Cod sursa (job #3188953) | Cod sursa (job #2288490) | Cod sursa (job #784276) | Cod sursa (job #2360344)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define NMax 101
short int A[NMax][NMax],N;
void citire()
{
f>>N;
for(short int i=1;i<=N;i++)
for(short int j=1;j<=N;j++)
f>>A[i][j];
f.close();
}
void roy()
{
for(short int k=1;k<=N;k++)
for(short int i=1;i<=N;i++)
for(short 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()
{
citire();
roy();
for(short int i=1;i<=N;i++)
{
for(short int j=1;j<=N;j++)
g<<A[i][j]<<" ";
g<<'\n';
}
g.close();
return 0;
}