Pagini recente » Cod sursa (job #586153) | Cod sursa (job #3264166) | Cod sursa (job #3153954) | Cod sursa (job #2777512) | Cod sursa (job #2658299)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int dp[105][105];
int main()
{
int n;
in>>n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
in>>dp[i][j];
if(dp[i][j]==0)
dp[i][j]=(INT_MAX-100)/2;
}
dp[i][i]=0;
}
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[k][j]+dp[i][k]);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
out<<dp[i][j]<<" ";
out<<"\n";
}
return 0;
}