Pagini recente » Cod sursa (job #431891) | Cod sursa (job #641027) | Cod sursa (job #1074936) | Cod sursa (job #1665138) | Cod sursa (job #2245821)
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int DP[103][103],N,A[103][103];
int main(){
fin>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++){
fin>>DP[i][j];
if(DP[i][j]==0)
DP[i][j]=200000000;
}
for(int k=1;k<=N;k++)
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
DP[i][j]=min(DP[i][j],DP[i][k]+DP[k][j]);
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++)
if(DP[i][j]!=200000000 && i!=j)
fout<<DP[i][j]<<" ";
else
fout<<0<<" ";
fout<<'\n';
}
}