Giáo trình c++ lập trình hướng đối tượng

#in clu d e Hi n c l u d e < i ĩ i a t h h > f l o a t X [ OD] , y [ 0 j ; flo at d o d a i( in t i, int j) { return s q r t (pow( x [i] - x [ j j f 2) + pow(y[i] - y[j], 2)); } A void nhapsl(i.nL n) { int for i; ( i = 1; i IIi n c l u d e < c o n i o h > ttin c lu d e #include c l a s s daydicm í publi c: i n t n; f l o a t *x, *y; f l o a t d (int i, ỉ n t j) { r e t u r n s q r t ; ( pow ( x I i ] - x[j], pow (y [i ] - 2) y [j ], 2) ) ; í v o i d nhcip.sl ( v o i d ) ; I; v o i d daycJicm: : n h a p s l ( v o i d ) in t i; p r i n t f ("\nS o diem N = "); s c a n f ( " % d w/ & n ) ; X = ( f l o a t * )m a l l o c ( (n+1)* s i z e o f (f l o a t ) ) ; y = ( f l o a t * ) m a ilo c ((n + ) * s i z e o f ( f l o a t ) ); f o r ( i = l ; i < - n ; +Ki ) { p r i n t f ( " \ n N h a p t o a d o X, y c u a d i e m t h u %d: s c a n f ( " %f % f Mr & x [ i | , & y [ i ] ) ; ) } void rna i n () { d a y d i cm p ; p n h a p s l(); i n t n r i # ) t imax, f l o a t d , d ma x ; n = p.n; 10 jmax; nề i ) ; / / CMT.CPF / / Cho v i t r i x u a t p h a t ( u , v ) - h a n g u , c o t v / / Tim d u o n g d i d a i n h a t x u a t p h a t t u ( u , v ) q u a / / c a c diern ke va t a o t h a n h d a y d o n d i e u k h o n g g i a m include #i n c l u d e < c o n i o h > #include < stdio.h> i n t k ma x = ; i n t h m ax [5 ), cmax[bO]; c l a s s MT { private: i n t m, n ; i n t a I 50 J I 50] ; public: int g etjn (); in t get_n(); in t doc_tep(char *ten_tep); //v o id xuat (); f r i e n d v o i d d i _ t i e p ( i n t *h, i n t *c, i n t k ) ; f r i e n d i n t c h a p n h a n ( i n t * h , i n t * c , i n t k, i n t i , i n t j ); ); MT x ; i n t M T : : g e t m () { r e t u r n m; » i n t MT: : g e t n () { r e t u r n n; i n t MT::doc L e p (ch ar * te n _ te p ) i I'Ml.K * i p ; i n t L, j ; fp-fopen(ten if(fp==NULL) tep ,"rt"); { cout %d a l i ] [j J = t q ; &j , Ã t g ) ; C O d a i = % f " ,i , \ f c l o s e (f p ) ; p r i n t f ("\nNhap d in h x u a t p h a t tu 486 d e n %d: ”rn); j, tg); scan!("%d",&u) ; (or(i ; i< n ; I i i ) d a c h o n [i J =0 ; dachon| u | - I ; da iI | 0.0; d Ln h t r u o c | ] = ; d i n h c h o n [ ] =u; } void DoThi: : m i n h a n g ( i n t i , int float *gtmin) { in t j; *jmin=0; *gtmin=0.0; f o r ( j = l ; j < = n ; * »j ) if(a[i][j]> && d a c h o n [ j ] = = ) { i f ( ( * jmin==0) || ( * j m i n >0 && a [ i ] [ j ] < *gtm in)) I * jmin = j ; * gtm in = a [ i ] [ j ] ; } ) i n t Do Thi : : t h u a t t o a n O { i n t k; for(k=2;k0) i f ( ( d c h o n _ k = = ) I I ( d c h o n _ k > && d a i _ k > d a i _ m ) ) { dchonk-dchonm ; d t r u o c k - dtruoc_m; d a i k = d a i m; > đ i n h l r u o c [ k ] - d t r o r k; d i n h c h o n [ k ] = d c h o n _ k ; d a i Lk ] = d a i _ k ; d a c h o r » | d c h o n _ k ] = ; i f ( d i n h c h o n [ k j = =0 ) r e t u r n ( k - ) ; ) return // n; Duong d i t:u d ỉ n h c h o n [ l ] d e n d i n h c h o n [ k ] # k>=2 v o i d O o T h L : : d u o n g d i t o i ( i n t k) { i n t d [ ] , i , j , m; d [ ] = d i n h c h o n I k ]; d [21= d i n h t r u o c [ k ] ; i= 2; m=k-l; w h i l e ( d I i ! = d i n h c h o n 11 ] ) { w h ile (đinhchon|m )!= d[i]) d [ i I 1 =d i n h t r u o c I m ] ĩ » »i ; m; ( p r i n t f ( " \ n \ n D u o n g d i t o i d i n h %d c o d o d a i : d inhchon Ik I , cJaj[k]); p r i n t f ( " \ r i C a c h d i : %đ" , d [ i l ) ; f o r ( j - i - l ; j>=1; — j) p r 1n t f ( ” - > % d " , d [ j ] ) ; ) void D o T h i::in k q () ( i n L m; m = L h u a t t o a n () ; //cout « "\ nm= M « m; q e t c h ( ) ; i f (m