Pagini recente » Cod sursa (job #1501497) | Cod sursa (job #434313) | Cod sursa (job #715004) | Cod sursa (job #138689) | Cod sursa (job #2672286)
#include <bits/stdc++.h>
using namespace std;
int A[101][101],n,m;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int oo=(1<<20);
int mini=oo,nr;
void solutie()
{ for(int i=1;i<=n;i++)
{ for(int j=1;j<=n;j++)
out<<A[i][j]<<' ';
out<<'\n';
}
}
void fw()
{ for(int k = 1; k <= n; k ++)
{
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= n; j ++)
{
if(i != j)
{
if(A[i][k] > 0 && A[k][j] > 0)
{
if(A[i][j] == 0 || A[i][j] > A[i][k] + A[k][j])
A[i][j] = A[i][k] + A[k][j];
}
}
}
}
}
}
int main()
{ in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>A[i][j];
fw();
solutie();
return 0;
}