TP.

HCM

q
i p b b :

U LP

i p 5 14 , p p g v ki

Bi 1. Vit hm quy tnh tng cc s t 1 n n, vi n c cho bi user. //return the sum 1+ 2+ 3+ ...+ n int sum(int n) Bi 2. Vit hm quy vit chng trnh tm gi tr ln nht ca mt mng s nguyn. //return the maximum element in a[] int findmin(int a[], int n) Bi 3. #include<iostream.h> #include <stdlib.h> #include<time.h> void output(int** c, int m, int n) { for (int i = 0; i < m; i++) { for (int j = 0; j < n; j++) { cout<<c[i][j]<<" "; } cout<<endl; } } void deleteMatrix(int** d, int m) { for (int i = 0; i < m; i++) { delete [] d[i]; } delete []d; } void main() { int m, n; int** a; int** b; cout<<"Input the dimensions of the Matrix : "; cin>>m>>n; if (m <= 0 || n <= 0) { cout<<"Invalid Input !"<<endl; } else { init(a, m, n); cout<<"The random matrix : "<<endl; output(a, m, n); K thut lp trnh 501127 HK2/2011-2012 1

TP.HCM

transposeMatrix(a, m, n, b); cout<<"The transposing matrix : "<<endl; output(b, n, m); deleteMatrix(a, m); deleteMatrix(b, n); } } Hy hin thc hm init() v hm transposeMatrix() tha mn cc yu cu sau: init(): to ra ma trn a (m hng , n ct) cha cc s nguyn bng cch cp pht ng cho bin con tr a. Sau khi to ma trn a cha cc s nguyn ngu nhin t 0..9 ( Gi : s dng hm rand() trong th vin stdlib.h c include sn). transposeMatrix() : to ma trn b (n hng, m ct) cha cc s nguyn bng cch cp pht ng cho bin con tr b. Sau , to ra ma trn chuyn v ca ma trn a v cha vo ma trn b. Bi 4. S dng hm quy vit chng trnh o ngc mt s nguyn. // with the parameter 12345, it would return 54321 int reverseDigits(int n) Bi p lm thm

Bi 5. Vit hm quy sumEvenDigit(int n) thc hin chc nng sau: Tr v -1 nu n < 0. Tr v tng ca cc ch s chn ca s n nu n >= 0. V d : n = 1468952 th kt qu l : 4 + 6 + 8 + 2 = 20. Bi 6. Cho on chng trnh : #include <iostream.h> void printCombinations(int m, int n) { //Coding here } void main() { int m,n; cout<<"Input two positive integer : "; cin>>m>>n; if (m <=0 || n <= 0 || m > n) { cout<<"Invalid input !"<<endl; } else { cout<<"The result is : "<<endl; printCombinations(m,n); } } Hy hin thc hm printCombinations() sinh ra tt c cc t hp chp m ca n phn t t 1..n. Yu cu trong hm printCombinations() phi gi 1 hm qui K thut lp trnh 501127 HK2/2011-2012

TP.HCM

thc hin vic sinh ra tt c cc t hp ny. V d : m = 2 , n = 4. Kt qu xut ra mn hnh s l: 12 13 14 23 24 34 Bi 7. Vit chng trnh xut tam gic Pascal ra mn hnh. C th nh sau: Nhp mt s nguyn dng t bn phm (lu vo bin n). Tnh ton tam gic Pascal n mc n v lu vo 1 mng 2 chiu (Yu cu: mng 2 chiu ny phi c cp pht ng va vi kch thc ca tam gic Pascal). Xut mng 2 chiu ny ra mn hnh. nh ngha: Tam gic Pascal cha cc h s khi khai trin nh thc Newton (x + 1)n. V d: n = 4. Kt qu xut ra mn hnh s l: 1 11 121 1331 14641 Bi 8. Vit chng trnh xut ra ma trn xon c. C th nh sau: Nhp kch thc ca ma trn t bn phm (lu vo 2 bin m, n). Tnh ton ma trn xon c v lu vo 1 mng 2 chiu ( Yu cu : mng 2 chiu ny c cp pht ng). Xut ma trn xon c ra mn hnh. nh ngha: Ma trn xon c l ma trn cha ng cc s t 1..(m x n) c sp xp c th t tng dn theo hnh xon c. V d : m = 3, n = 5. Kt qu xut ra mn hinh s l: 12345 12 13 14 15 6 11 10 9 8 7 m = 4, n = 4. Kt qu xut ra mn hnh s l: 1234 12 13 14 5 11 16 15 6 10 9 8 7 Bi 9. Bng cch s dng k thut hm quy vit chng trnh kim tra xem o ngc mt chui c phi l chnh n hay khng. //returns 1 if a[] is a palindrome, 0 otherwise int ispalindrome(char a[], int n)

K thut lp trnh 501127 HK2/2011-2012

TP.HCM

Bi 10. Dng quy vit chng trnh xut ra mt chui mi c to thnh bi sao chp n chui con s. // with the parameters Hello and 2 would return the string HelloHello. // if n equals zero, the method should return the empty string. char* repeat(char* s, int n) Bi 11. Hin thc thut gii tm c s chung ln nht bng k thut quy. Bi 12. Vit chng trnh gii bi ton thp H Ni. -

--

K thut lp trnh 501127 HK2/2011-2012