Pagini recente » Cod sursa (job #509445) | Cod sursa (job #361716) | Cod sursa (job #1920263) | Istoria paginii utilizator/angelking777 | Cod sursa (job #2258850)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100+5;
int n,dp[N][N];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
cin>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>dp[i][j];
if(i!=j && dp[i][j]==0)
dp[i][j]=(1<<29);
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(i==j || i==k || k==j)
continue;
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(i==j)
cout<<"0 ";
else
{
if(dp[i][j]==(1<<29))
cout<<"0 ";
else
cout<<dp[i][j]<<" ";
}
}
cout<<"\n";
}
return 0;
}
/**
1
10 18 76
**/