Pagini recente » Cod sursa (job #2964854) | Cod sursa (job #1816867) | Cod sursa (job #1604535) | Cod sursa (job #3004474) | Cod sursa (job #3176978)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int dp[105][105], n;
int main()
{
int k, i, j;
fin >> n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin >> dp[i][j];
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if (dp[i][k] && dp[k][j] && (dp[i][j] > dp[i][k] + dp[k][j] || !dp[i][j]) && i != j)
dp[i][j] = dp[i][k] + dp[k][j];
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
fout << dp[i][j] << " ";
fout << "\n";
}
fin.close();
fout.close();
return 0;
}