Pagini recente » Cod sursa (job #2561729) | Cod sursa (job #2519337) | Cod sursa (job #2986752) | Cod sursa (job #3041186) | Cod sursa (job #2941218)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
long long n,i,j,k,a[101][101];
int main()
{
in>>n;
for(i=1; i<=n; ++i)
for(j=1; j<=n; ++j)
in>>a[i][j];
for(k=1; k<=n; ++k)
for(i=1 ; i<=n ; ++i)
for(j=1 ; j<=n ; ++j)
if(a[i][k] && a[k][j] && a[i][j] && i!=j)
a[i][j]=min(a[i][k]+a[k][j],a[i][j]);
for(i=1; i<=n; ++i,out<<'\n')
for(j=1; j<=n; ++j)
out<<a[i][j]<<" ";
}
/*
10
dv[2]=5;
dv[4]=5;
dv[6]=7;
dv[8]=5;
dv[10]=5;
dv[5]=1;
dv[3]=2;
dv[9]=
0 1 1 1 0 1 0 1 1 1
1 2 3 4 5 6 7 8 9 10
s=
*/