Pagini recente » Cod sursa (job #1502962) | Cod sursa (job #2773474) | Borderou de evaluare (job #896502) | Cod sursa (job #685426) | Cod sursa (job #1256067)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
#define MAX 1001
int N,V[101][101],i,j,k;
void print()
{
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
if(V[i][j]!=MAX)
out<<V[i][j]<<' ';
else
out<<0<<' ';
}
out<<endl;
}
}
void read()
{
in>>N;
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
in>>V[i][j];
if(V[i][j]==0)
V[i][j]=MAX;
}
}
}
void royfloyd()
{
for(i=1;i<=N;i++){
for(j=1;j<=N;j++){
for( k=1;k<=N;k++){
if((V[i][j]>V[i][k]+V[k][j])&&(i!=j))
V[i][j]=V[i][k]+V[k][j];
}
}
}
}
int main()
{
read();
royfloyd();
print();
in.close();
out.close();
return 0;
}