100 bi tp Turbo Pascal

BI TP TURBO PASCAL
I. Lm quen vi chng trnh Pascal Khai bo, s dng bin Cc th tc vo ra.
Bi tp 1.1:
Vit chng trnh tnh chu vi v din tch ca hnh ch nht c chiu di hai cnh
l a, b (c nhp t bn phm).
a. Hng dn:
- Nhp hai cnh vo hai bin a, b.
- Chu vi hnh ch nht bng 2*(a+b); Din tch hnh ch nht bng a*b.
b. M chng trnh:

Program Chu_nhat;
uses crt;
Var a, b, S, CV: real;
Begin
Write('Nhap chieu dai:'); readln(a);
Write('Nhap chieu rong:'); readln(b);
S := a*b;
CV := (a+b)*2;
Writeln('Dien tich hinh chu nhat la:',S);
Writeln('Chu vi hinh chu nhat la:',CV:10:2);
readln
end.

c. Nhn xt: Lnh write cho php in ra mn hnh mt hoc nhiu mc. C th nh
dng c s in ra bng cch qui nh khong dnh cho phn nguyn, khong dnh
cho phn thp phn.
Bi tp 1.2:
Vit chng trnh tnh chu vi, din tch hnh vung c cnh a (c nhp t bn
phm).
a. Hng dn:
- Nhp cnh vo bin canh.
- Chu vi hnh vung bng 4*canh; Din tch hnh vung bng canh*canh.
b. M chng trnh:

Program HINH_VUONG;
uses crt;
Var canh: real;
Begin
clrscr;
Write('Nhap do dai canh:');readln(canh);
Writeln('Chu vi hinh vuong la:',4*canh:10:2);
Writeln('Dien tich hinh vuong la:',canh*canh:10:2);
readln
end.

Trang 1
100 bi tp Turbo Pascal

c. Nhn xt: Bi tp 1.2 tit kim c hai bin l CV v S v lnh write cho php in
mt biu thc. Trong lp trnh vic tit kim bin l cn thit nhng i lc gy kh
hiu khi c, kim tra chng trnh.
Bi tp 1.3:
Vit chng trnh tnh chu vi v din tch hnh trn c bn knh r (c nhp t
bn phm).
a. Hng dn:
- Nhp bn knh vo bin r.
- Chu vi ng trn bng 2**r.
- Din tch hnh trn bng *r*r.
b. M chng trnh:

Program HINH_TRON;
uses crt;
Var r: real;
Begin
clrscr;
Write('Nhap ban kinh:'); readln(r);
Writeln('Chu vi duong tron la:',2*pi*r:10:2);
Writeln('Dien tich hinh tron la:',pi*r*r:10:2);
readln
end.

c. Nhn xt: pi l hng s. Mt hng s c th c ngi dng khai bo hoc do

Pascal t to. Pi l hng do Pascal t to nn ngi dng khng cn khai bo.
Bi tp 1.4:
Vit chng trnh tnh din tch ca tam gic c ba cnh l a,b,c (c nhp t bn
phm)
a. Hng dn:
- Nhp ba cnh ca tam gic vo ba bin a,b,c.
- Na chu vi ca tam gic p = (a+b+c)/2.
- Din tch ca tam gic: s = p( p a)( p b)( p c) .
b. M chng trnh:
Program TAM_GIAC;
uses crt;
Var a,b,c,p,S: real;
Begin
clrscr;
Write('Nhap canh a:');readln(a);
Write('Nhap canh b:');readln(b);
Write('Nhap canh c:');readln(c);
p:=(a+b+c)/2;
S:= sqrt(p*(p-a)*(p-b)*(p-c));
Write('Dien tich tam giac la:',s:10:2);
readln
end.

Trang 2
100 bi tp Turbo Pascal

b. Nhn xt: y ta li hai ln dng bin trung gian p, s chng trnh sng sa,
d theo di.

Bi tp 1.5:
Vit chng trnh cho php tnh trung bnh cng ca bn s.
a. Hng dn:
- Nhp bn s vo bn bin a, b, c, d
- Trung bnh cng ca a, b, c, d bng (a + b + c + d)/4.
b. M chng trnh:
Program TB_Cong_4_So;
uses crt;
Var a, b, c, d: real;
Begin
Clrscr;
Write('Nhap so thu nhat:');readln(a);
Write('Nhap so thu hai:');readln(b);
Write('Nhap so thu ba:');readln(c);
Write('Nhap so thu tu:');readln(d);
Writeln('Trung binh cong: ',(a+b+c+d)/4):10:2;
Readln
end.

Bi tp 1.6:
Vit chng trnh cho php tnh trung bnh cng ca bn s vi iu kin ch c
s dng hai bin.
a. Hng dn:
- Dng mt bin S c gi tr ban u bng 0.
- Dng mt bin nhp s.
- Sau khi nhp mt s cng ngay vo bin S.
b. M chng trnh:
Program TB_Cong_4_So;
uses crt;
Var s,a: real;
Begin
Clrscr;
S:=0;
Write('Nhap so thu nhat:');readln(a); S:=S+a;
Write('Nhap so thu hai:');readln(a); S:= S+a;
Write('Nhap so thu ba:');readln(a); S:=S+a;
Write('Nhap so thu tu:');readln(a); S:=S+a;
Writeln('Trung binh cong: ',S/4:10:2);
readln
end.

Trang 3
100 bi tp Turbo Pascal

b. Nhn xt: Cu lnh gn S:= S+a thc hin vic cng thm a vo bin S. Thc cht l
thc hin cc bc: ly gi tr ca S cng vi a ri ghi vo li bin S. y ta cng s
dng bin a nh l mt bin tm cha tm thi gi tr c nhp t bn phm.

Bi tp 1.7:
Vit chng trnh cho php tnh trung bnh nhn ca bn s vi iu kin ch c
s dng hai bin.
a. Hng dn:
- Dng mt bin S c gi tr ban u bng 1.
- Dng mt bin nhp s.
- Sau khi nhp mt s nhn ngay vo bin S.
- Trung bnh nhn bn s l cn bc 4 tch ca chng (Dng hai ln cn bc hai).
b. M chng trnh:
Program TB_nhan;
uses crt;
Var a, S: real;
Begin
clrscr;
S:=1;
Write('Nhap so thu nhat: '); readln(a); S:=S*a;
Write('Nhap so thu hai: '); readln(a); S:=S*a;
Write('Nhap so thu ba: '); readln(a); S:=S*a;
Write('Nhap so thu tu: '); readln(a); S:=S*a;
Write('Trung binh nhan cua bon so la:',sqrt(sqrt(s)));
readln
End.
b. Nhn xt: Ta dng hai ln khai phng ly cn bc 4 ca mt s. cng
dn gi tr vo mt bin th bin c gi tr ban u l 0. nhn dn gi tr ban u
vo bin th bin cn c gi tr ban u l 1.
Bi tp 1.8:
Vit chng trnh nhp hai s, i gi tr hai s ri in ra hai s.
a. Hng dn:
- Dng cc bin a, b lu hai s c nhp t bn phm;
- Gn cho bin tam gi tr ca a.
- Gn gi tr ca b cho a. (Sau lnh ny a c gi tr ca b).
- Gn gi tr ca tm cho cho b (Sau lnh ny b c gi tr ca tam = a).
b. M chng trnh:
Program Doi_Gia_Tri;
uses crt;
var a, b, tam:real;
Begin
clrscr;
write('nhap a: '); readln(a);
write('nhap b: '); readln(b);
writeln('Truoc khi doi a =',a,' va b= ',b);
readln;
tam:=a;
a:=b;

Trang 4
100 bi tp Turbo Pascal

b:=tam;
writeln('Sau khi doi a =',a,' va b= ',b);
readln
end.
Nhn xt:Nu thc hin hai lnh a:= b; b:=a i gi tr hai bin th sau hai lnh
ny hai bin c gi tr bng nhauv bng b. Thc cht sau lnh th nht hai bin
c gi tr bng nhau v bng b ri! Trong thc t i ch s du hai bnh cho
nhau ta phi dng thm mt bnh ph.
Bi tp 1.9
Gii bi tp 1.8 m ch c s dng hai bin (Tc khng c dng thm bin
tm).
a. Hng dn:
- Cng thm b vo a. (Gi tr hai bin sau lnh ny l: a+b, b)
- Gn b bng tng tr i b (Sau lnh ny b c gi tr bng a);
- Gn gi tr a bng tng tr i b mi (Sau lnh ny a c gi tr bng b).
b. M chng trnh:
Program Doi_Gia_Tri;
uses crt;
var a, b:real;
Begin
clrscr;
write('nhap a: '); readln(a);
write('nhap b: '); readln(b);
writeln('Truoc khi doi a =',a,' va b= ',b);
readln;
a:=a+b;
b:=a-b;
a:=a-b;
writeln('Sau khi doi a =',a,' va b= ',b);
readln
end.

Nhn xt:Ging sang du gia hai bnh nhng khng ging hon ton!!!K thut i
gi tr bin cho nhau s c s dng nhiu trong phn sp xp.
Bi tp 1.10:
Vit chng trnh cho bit ch s hng trm, hng chc, hng n v ca mt s
c ba ch s. V d khi nhp s 357 th my in ra:
- Ch s hng trm: 3.
- Ch s hng chc: 5.
- Ch s hng n v: 7.
a. Hng dn:
S dng hm mov ly s d. Khi chia cho 10 ly s d ta c ch s hng
n v. S dng DIV ly phn nguyn. Khi chia cho 10 ly phn nguyn ta b i
ch s hng n v s c ba ch s cn s c hai ch s.
b. M chng trnh:
Program CHU_SO;

Trang 5
100 bi tp Turbo Pascal

uses crt;
var n:integer;
begin
clrscr;
write('Nhap so n: ');readln(n);
writeln('Chu so hang don vi: ',n mod 10);
n:=n div 10;
writeln('Chu so hang chuc: ',n mod 10);
n:=n div 10;
writeln('Chu so hang tram: ',n mod 10);
readln
end.

c. Nhn xt:
Hy sa chng trnh c kt qu l hng trm, hng chc, hng n v.
M chng trnh:
Program CHU_SO;
uses crt;
var n:integer;
begin
clrscr;
write('Nhap so n: ');readln(n);
writeln('Chu so hang trm: ',n div 100);
n:=n mov 100;
writeln('Chu so hang chuc: ',n div 10);
n:=n div 10;
writeln('Chu so hang tram: ',n);
readln
end.

II.Cu trc la chn: if then else

Trang 6
100 bi tp Turbo Pascal

Case ... of ...

Bi tp 2.1:
Vit chng trnh in ra s ln hn trong hai s (c nhp t bn phm).
a. Hng dn:
- Nhp hai s vo hai bin a, b.
- Nu a > b th in a. Nu a <= b th in b.
- Hoc: Nu a > b th in a. Ngc li th in b.
b. M chng trnh:

Program SO_SANH1;
uses crt;
var a,b: real;
begin
clrscr;
write('nhap so thu nhat: '); readln(a);
write('nhap so thu hai: '); readln(b);
if a> b then writeln(' So lon la:',a);
if a<= b then writeln(' So lon la:',b:10:2);
readln
end.

Hoc:
Program SO_SANH2;
uses crt;
var a,b: real;
begin
clrscr;
write('nhap so thu nhat: '); readln(a);
write('nhap so thu hai: '); readln(b);
if a> b then writeln(' So lon la:',a:10:2)
else writeln(' So lon la:',b:10:2);
readln
end.

Bi tp 2.2:
Vit chng trnh in ra s ln nht trong bn s nhp t bn phm.
a. Hng dn:
Nu a b v a c v a d th a l s ln nht.
Tng t nh th xt cc trng hp cn li tm s ln nht.
b. M chng trnh:
Program So_Lon_Nhat_1;
Uses crt;
Var a,b,c,d: real;
Begin
Clrscr;
Write('Nhap so thu nhat:');readln(a);
Write('Nhap so thu hai:');readln(b);

Trang 7
100 bi tp Turbo Pascal

Write('Nhap so thu ba:');readln(c);

Write('Nhap so thu tu:');readln(d);
if (a>=b) and (a>=c) and (a>= d) then writeln('So
lon nhat la:',a:10:2);
if (b>=a) and (b>=c) and (b>= d) then writeln('So
lon nhat la:',b:10:2);
if (c>=a) and (c>=b) and (c>= d) then writeln('So
lon nhat la:',c:10:2);
if (d>=a) and (d>=b) and (d>= c) then writeln('So
lon nhat la:',d:10:2);
readln
end.

Bi tp 2.3:
Vit chng trnh in ra s ln nht trong bn s nhp t bn phm vi iu kin
ch c dng hai bin.
a. Hng dn:
S dng mt bin max v mt bin a cha s va nhp. Cho max bng s u
tin. Sau khi nhp mt s thc hin so snh nu s va nhp ln hn max th lu s va
nhp vo max. Sau khi nhp xong ta c max l s ln nht
(Gii thut ny gi l k thut lnh canh).
b. M chng trnh:
Program So_Lon_Nhat_2;
Uses crt;
Var a,max: real;
Begin
Clrscr;
Write('Nhap so thu nhat:');readln(a);Max:=a;
Write('Nhap so thu hai:');readln(a);if a>=Max
then Max:=a;
Write('Nhap so thu ba:');readln(a);if a>=Max
then Max:=a;
Write('Nhap so thu tu:');readln(a);if a>=Max
then Max:=a;
Write('So lon nhat la:',Max:10:2);
readln
end.

Bi tp 2. 4
Vit chng trnh xt xem mt tam gic c l tam gic u hay khng khi bit ba
cnh ca tam gic.
a. Hng dn:
- Nhp ba cnh ca tam gic vo ba bin a,b,c.
- Nu a = b v b = c th tam gic l tam gic u v ngc li tam gic khng l tam
gic u.

Trang 8
100 bi tp Turbo Pascal

b. M chng trnh:
Program Tam_giac_deu;
uses crt;
var a,b,c: real;
begin
clrscr;
write('Nhap a = '); readln(a);
write('Nhap b = '); readln(b);
write('Nhap c = '); readln(c);
if (a = b) and (b = c) then writeln('La tam
giac deu')
else
writeln('Khong phai la tam giac deu');
readln
end.
Bi tp 2. 5
Vit chng trnh xt xem mt tam gic c l tam gic cn hay khng khi bit ba
cnh ca tam gic.
a.Hng dn:
- Nhp ba cnh ca tam gic vo ba bin a,b,c.
- Nu a = b hoc b = c hoc a = c th tam gic l tam gic cn v ngc li tam gic
khng l tam gic cn.
b.M chng trnh:
Program Tam_giac_can;
uses crt;
var a,b,c: real;
begin
clrscr;
write('Nhap a = '); readln(a);
write('Nhap b = '); readln(b);
write('Nhap c = '); readln(c);
if (a = b) or (b = c) or (a = c) then
writeln('La tam giac can')
else
writeln('Khong phai la tam giac can');
readln
end.

Bi tp 2. 6
Vit chng trnh xt xem mt tam gic c l tam gic vung hay khng khi bit
ba cnh ca tam gic.
a.Hng dn:
- Nhp ba cnh ca tam gic vo ba bin a,b,c.
- Nu a2 = b2 + c2 hoc b2 = c2 + a2 hoc c2 = a2+b2 th tam gic l tam gic vung v
ngc li tam gic khng l tam gic vung.
b.M chng trnh:

Trang 9
100 bi tp Turbo Pascal

Program Tam_giac_can;
uses crt;
var a,b,c: real;
begin
clrscr;
write('Nhap a = '); readln(a);
write('Nhap b = '); readln(b);
write('Nhap c = '); readln(c);
if (a*a = b*b+c*c) or (b*b = c*c+a*a) or (c*c=
a*a+b*b) then writeln('La tam giac vuong')
else
writeln('Khong phai la tam giac vuong');
readln
end.

Bi tp 2.7:
Vit chng trnh gii phng trnh ax + b = 0 (Cc h s a, b c nhp t bn
phm).
a.Hng dn:
b
- Nu a 0 th phng trnh c nghim x =
a
- Nu a = 0 v b = 0 th phng trnh c v s nghim
- Nu a = 0 v b 0 th phng trnh v nghim

Hoc:
- Nu a = 0 th xt b. Nu b = 0 th phng trnh c v s nghim ngc li (b 0)
b
th phng trnh v nghim ngc li (a 0) phng trnh c nghim x = .
a
a. M chng trnh:
Program Phuong_trinh_2;
uses crt;
var a,b:real;
begin
clrscr;
Writeln(' CHUONG TRINH GIAI PT ax + b = 0');
Write('Nhap he so a = ');readln(a);
Write('Nhap he so b = ');readln(b);
if (a<>0) then writeln('phuong trinh',a:10:2,'x +
',b:10:2,'= 0',' co nghiem x =;',-b/a:10:2);
if (a=0) and (b=0) then writeln('Phuong trinh co vo
so nghiem');
if (a=0) and (b<>0) then writeln('Phuong trinh vo
nghiem');
readln

end.

Trang 10
100 bi tp Turbo Pascal

Hoc:
Program Phuong_trinh_2;
uses crt;
var a,b:real;
begin
clrscr;
Writeln(' CHUONG TRINH GIAI PT ax + b = 0');
Write('Nhap he so a = ');readln(a);
Write('Nhap he so b = ');readln(b);
if (a<>0) then writeln('phuong trinh',a:10:2,'x +
',b:10:2,'= 0',' co nghiem x =;',-b/a:10:2)
else
if (b=0) then writeln('Phuong trinh co vo so nghiem')
else
writeln('Phuong trinh vo nghiem');
readln

end.

Bi tp 2.8:
Vit chng trnh gii phng trnh ax2 + bx + c = 0 Vi cc h s a,b,c c
nhp t bn phm.
a. Hng dn:
- Nhp cc s cc h s vo cc bin a,b,c.
- Tnh delta = b2 4ac.
- Nu delta > 0 th phng trnh c hai nghim x1 = (-b + sqrt(delta))/(2a)
x2 = (-b - sqrt(delta))/(2a)
- Nu delta = 0 th phng trnh co nghim kp x = -b/(2a)
- Nu delta < 0 th phng trnh v nghim.
b. M chng trnh:
Program Phuong_trinh_Bac_hai;
uses crt;
var a,b,c,delta,x1,x2:real;
begin
clrscr;
write('Nhap a = '); readln(a);
write('Nhap b = '); readln(b);
write('Nhap c = '); readln(c);
delta:=b*b-4*a*c;
if delta > 0 then
begin
x1:= -b+sqrt(delta)/(2*a);
x2:= -b-sqrt(delta)/(2*a);
writeln('Phuong trinh co hai nghiem phan
biet');
writeln('x1=',x1:10:2);
writeln('x2=',x2:10:2);

Trang 11
100 bi tp Turbo Pascal

end;
if delta = 0 then
begin
x1:= -b/(2*a);
writeln('Phuong trinh co nghiem kep');
writeln('x1=x2=',x1:10:2);
end;
if delta <0 then write('Phuong trinh vo nghiem');
readln
end.

Bi tp 2.9:
Vit chng trnh dch cc ngy trong tun sang ting anh
2 3 4 5 6 7 8
Monday Tuesday Wednesday Thursday Friday Saturday Sunday

a. Hng dn:
- Dng bin a kiu byte cha th (2 n 8)
- Trng hp a = 2: Monday
- Trng hp a = 3: Thursday
- ...
- Trng hp a = 8: Sunday
- Ngoi ra khng cn th no.
b. M chng trnh:
Program dich;
uses crt;
Var thu:byte;
begin
clrscr;
write('nhap thu can dich 28: '); readln(thu);
case thu of
2: Write('--> Monday');
3: Write('--> Tuesday');
4: Write('--> Wednesday');
5: Write('--> Thursday');
6: Write('--> Friday');
7: Write('--> Saturday');
8: Write('--> Sunday');
else
Write(' Khong co thu nay');
end;
readln
end.

Trang 12
100 bi tp Turbo Pascal

Bi tp 2.10
Vit chng trnh cho php tnh din tch cc hnh: Hnh vung; Hnh ch nht;
Hnh trn; Tam gic; Hnh thang. Ngi dng chn hnh cn tnh din tch t bng chn,
sau khai bo cc thng s lin quan v nhn c din tch ca hnh:
MOI BAN CHON HINH CAN TINH DIEN TICH

A. Hnh vung.
B. Hnh ch nht.
C. Hnh trn
D. Tam gic
E. Hnh thang.
Mun tnh din tch tam gic, ngi dng g D v khai bo ng cao, y. Chng
trnh tnh v thng din tch n ngi dng.
a. Hng dn:
- Dng cu trc chn Case chon of vi chon c kiu Char to bng chn.
- Dng 3 bin a,b,c lu cc thng s ca hnh; Bin S lu din tch ca hnh.
- Thc hin chung cu thng bo din tch (Nm ngoi Case . . . of) gn chong
trnh.
b. M chng trnh:
Program Dien_Tich_cac_hinh;
uses crt;
var chon: byte;
a,b,c,S: real;
Begin
clrscr;
writeln('CHUONG TRINH TINH DIEN TICH CAC HINH');
Writeln(' ------------');
writeln('1. DIEN TICH HINH TAM GIAC');
writeln('2. DIEN TICH HINH VUONG');
writeln('3. DIEN TICH HINH CHU NHAT');
writeln('4. DIEN TICH HINH THANG');
writeln('5. DIEN TICH HINH TRON');
write('Moi ban chon hinh can tinh dien tich:
');readln(chon);
(case upcase chon) of
1 : Begin
Write('Cho biet canh day: '); readln(a);
Write('Cho biet chieu cao: '); readln(b);
S:=(a*b)/2;
end;
2:Begin
Write('Cho biet chieu dai canh: ');
readln(a);
S:=a*a;
end;
3:Begin

Trang 13
100 bi tp Turbo Pascal

Write('Cho biet chieu dai: '); readln(a);

Write('Cho biet chieu rong: '); readln(b);
S:=a*b;
end;
4:Begin
Write('Cho biet day lon: '); readln(a);
Write('Cho biet day nho: '); readln(b);
Write('Cho biet chieu cao: ');
readln(c);
S:=(a+b)*c/2;
End;
5:Begin
Write('Cho biet ban kinh: '); readln(a);
S:=a*a*pi;
End;
else
Writeln('Chon sai roi!!!');
end;
Writeln('Dien tich cua hinh la: ',S:8:2);
readln
end.

III. Cu trc lp vi s ln lp bit: For to do

Bi tp 3.1:
Vit chng trnh in ra cc s chn nh hn hoc bng n ( Vi n c nhp).

Trang 14
100 bi tp Turbo Pascal

a. Hng dn:
- Cho bin i chy t 1 n n.
- Nu i chn ( i chia 2 d 0) th in ra s n.
b. M chng trnh:

Program In_So_Le;
Uses crt;
var i,n: integer;
Begin
Clrscr;
Write('Nhap so n ='); readln(n);
For i:=1 to n do if i mod 2 =1 then
Write(i:3,',');
readln
end.

Bi tp 3.2:
Vit chng trnh in ra cc s l nh hn hoc bng n ( Vi n c nhp). Sao cho
15 s l c in trn mt dng.
a. Hng dn:
- Cho j =0.
- Cho bin I chy t 1 n n.
- Nu I chn ( I chia 2 d 0) th in ra s n v tng j ln 1
- Nu j chia ht cho 15 th thc hin xung dng (Dng Writeln).
b. M chng trnh:
Program In_So_Le;
Uses crt;
var Dem,i,n: integer;
Begin
Clrscr;
Write('Nhap so n ='); readln(n);
Dem:= 0;
For i:=1 to n do if i mod 2 =1 then
Begin Write(i:3,',');
Dem:= Dem + 1;
if Dem mod 15 = 0 then Writeln;
end;
readln
end.

Bi tp 3.3:
Vit chng trnh in ra tng cc s l nh hn hoc bng n ( Vi n c nhp).
a. Hng dn:

Trang 15
100 bi tp Turbo Pascal

- Cho S = 0.
- Cho bin i chy t 1 n n.
- Nu i chn ( I chia 2 d 0) th cng thm I vo S.
- In ra S.
b. M chng trnh:
Program In_So_Le;
Uses crt;
var S,i,n: integer;
Begin
Clrscr;
Write('Nhap so n ='); readln(n);
For i:=1 to n do if i mod 2 =1 then S:= S+i;
Writeln('Tong cac so le nho hon ',n,' la: ',S);
readln
end.

Bi tp 3.4:
Vit chng trnh in ra tt c cc c ca mt s n (Vi n c nhp t bn phm)
a. Hng dn:
- Cho bin i chy t 1 n n.Nu n chia ht cho i th in ra i.
b. M chng trnh:
Program Tim_uoc;
uses crt;
Var n, i: integer;
Begin
clrscr;
Write('Nhap so n ='); readln(n);
For i:=1 to n do if n mod i = 0 then
write(i:3,',');
readln
end.

Bi tp 3.5:
Mt s c tng cc c nh hn n bng chnh n c gi l s hon chnh.
V d: 6 c cc c nh hn n l 1, 2, 3. Tng l 1 + 2 + 3 = 6.
Vit chng trnh xt xem mt s n c nhp t bn phm c phi l s hon
chnh khng.
a. Hng dn:
- Dng bin n lu s cn xt.
- Bin S c gi tr ban u bng 0.
- Cho i chy t 1 n n-1. nu i l c ca n th cng thm i vo S.
- Nu S = n th S l s hon chnh.
b. M chng trnh:

Trang 16
100 bi tp Turbo Pascal

Program So_Hoan_Chinh;
uses crt;
var n, i, s: integer;
begin
write('nhap so n: ');readln(n);
s:=0;
for i:= 1 to n -1 do if n mod i = 0 then s:=s+i;
if s = n then write(n, ' la so hoan chinh')
else writeln(n, ' khong phai la so hoan chinh');
readln
end.

Bi tp 3.6:
Vit chng trnh tm cc s hon chnh nh hn n (Vi n c nhp t bn phm).
a. Hng dn:
Cho bin i chy t 1 n n. Xt i. Nu n l s hon chnh th in ra.
b. M chng trnh:
Program Tim_uoc_2;
uses crt;
Var S, n, i,j: longint;
Begin
clrscr;
Write('Nhap so n ='); readln(n);
For i:=1 to n do
Begin
S:=0;
For j:=1 to i do if i mod j = 0 then S:=S+j;
if S = 2*i then write(i:6,',');
end;
readln
end.

Bi tp 3.7
In bng cu chng n (Vi n nhp t bn phm)
a.Hng dn :
b. M chng trnh:
Program Cuu_Chuong_1;
uses crt;
var n, i : integer;
begin
clrscr;
write('Nhap n: '); readln(n);
for i:= 1 to 9 do writeln(n,' x ', i, ' = ',
n*i);

Trang 17
100 bi tp Turbo Pascal

readln
end.

Bi tp 3.8
Ln lt in cc bng cu chng.
a.Hng dn :
- Cho bin i chy t 2 n 9
- In bng cu chng i.
b. M chng trnh:
Program Cuu_Chuong_1;
uses crt;
var i,j : integer;
begin
clrscr;
for i:= 2 to 9 do
Begin
Writeln('Bang cuu chuong ',i);
For j := 1 to 9 do writeln(i,' x ', j, ' = ',
j*i);
readln
end;
readln
end.

Bi tp 3.9
Vit chng trnh xt xem mt s n c phi l s nguyn t khng?
a.Hng dn:
- Cho bin i chy t 2 n n 1 nu n khng chia ht mi s i th th n l s
nguyn t.
- S dng bin ok c kiu boolean v c gi tr ban u l true. C mi ln xt
php chia n cho i th
b.M chng trnh:

Program Nguyen_to_1;
uses crt;
var n, i: integer;
ok: boolean;
begin
ok:=true;
write('Nhap n: ');readln(n);
for i:= 2 to n - 1 do if n mod i = 0 then ok :=ok
and false;
if ok then write(n,' la so nguyen to')
else write(n, ' khong la so nguyen to');
readln

Trang 18
100 bi tp Turbo Pascal

end.

Bi tp 3.10
Vit chng trnh in ra tt c cc s nguyn t b hn hoc bng n?
a. Hng dn:

b. M chng trnh:
Program Nguyen_to_1;
uses crt;
var n, i, j: integer;
ok: boolean;
begin
clrscr;
write('Nhap n: '); readln(n);
for i := 2 to n do
begin
ok:=true;
for j:= 2 to i - 1 do if i mod j = 0 then ok :=ok
and false;
if ok then write(i,';')
end;
readln
end.

IV. Cu trc lp vi s ln lp cha bit

Bi tp 4.1:
Vit chng trnh in ra cc s l nh hn hoc bng n ( Vi n c nhp).
a. Hng dn:

Trang 19
100 bi tp Turbo Pascal

- S dng kin thc s l u tin bng 1. S l sau bng s trc cng vi 2.

- Cho bin i c gi tr ban u bng 1.
- Dng vng lp while do vi iu kin i < n v cng vic bn trong l in i v tng
i ln 2.
b. M chng trnh:
Program In_So_Le;
uses crt;
var i,n:integer;
begin
clrscr;
write('Nhap so n: ');readln(n);
i:=1;
while i<=n do
begin
write(i:3,', ');
i:=i+2;
end;
readln
end.

Nhn xt:
- Mi vng lp For ... to ... do u c th thay th bng vng lp while ... do.
- Trong vng lp while nht thit phi c mt cu lnh lm thay i iu kin lp.
y l i:=i+2. Nu khng c s dn n trng hp lp v hn. Chng trnh chy mi
m khng c li ra (Khng thot ra khi vng lp c).

Bi tp 4.2:
Vit chng trnh tnh n! vi n! c nh ngha nh sau:
- n! = 1 vi n = 0
- n! = 1.2.3...n (Tch ca n s t 1 n n).
Yu cu: S dng vng lp vi s ln cha bit trc:
a. Hng dn:
- C th vit li: n! = n.(n-1)... 3.2.1.
- Lp gt = gt*n; n = n-1 vi iu kin n>0.
b. M chng trnh:
Program Giai_Thua_while;
uses crt;
var n, gt:longint;
begin
clrscr;
write('Nhap n: ');readln(n);
gt:=1;
while n>0 do
begin
gt:=gt*n;
n:=n-1;

Trang 20
100 bi tp Turbo Pascal

end;
writeln('Giai thua cua n la: ',gt);
readln
end.

c. Nhn xt: Tit kim c mt bin i chy nhng lm thay i n nn khi xut ra ch
c th xut mt cu chung chung Giai thua cua n la:

Bi tp 4.3:
Vit chng trnh tnh n! vi n! c nh ngha nh sau:
- n!! = 1 vi n = 0
- n!! = 1.3.5..n vi n l.
- n!! = 2.4.6..n vi n chn.
Yu cu: S dng vng lp vi s ln cha bit trc:
a. Hng dn:
- Hai s chn lin tip hn km nhau 2. Hai s l lin tip cng vy.
- Thc hin tnh nh giai tha n nhng vi bc nhy l 2.
b. M chng trnh:
Program Giai_thua_kep;
uses crt;
var n,gt:longint;
begin
write('Nhap n: ');readln(n);
gt:=1;
while n>0 do
begin
gt:=gt*n;
n:=n-2;
end;
write('Giai thua la: ',gt);
readln
end.

c. Nhn xt:
- Vi thut ton trn ta khng cn xt n l chn hay l.

Bi tp 4.4:
Vit chng trnh cho php tnh tng ca nhiu s (Cha bit bao nhiu s). Nhp
s 0 kt thc qu trnh nhp.
a. Hng dn:
b. M chng trnh:
Program Tong_Repeat;
uses crt;
var i: byte;
so, tong: real;
begin

Trang 21
100 bi tp Turbo Pascal

write('NHAP CAC SO - NHAP 0 DE NGUNG ');

readln;
repeat
clrscr;
write('Nhap so thu ',i,': ');
readln(so);
tong:=tong+so;
i:=i+1;
until so=0;
write('Tong la: ',tong:6:1);
readln
end.

Bi tp 4.5
Vit chng trnh tm c chung ln nht (UCLN) ca hai s vi yu cu s dng
thut ton Euclid.
Thut ton Euclid: Nu a chia ht cho b (a chia b d 0) th UCLN(a,b) bng b
Nu a chia b d r th UCLN(a,b) = UCLN(b,r)
a.Hng dn:
- Nhp a, b v gn r = a mod b.
- Lp vi iu kin r <> 0: b = r, a = b, r = a mod b.
b.M chng trnh:
Program UCLN;
uses crt;
var a,b,r:byte;
begin
clrscr;
writeln('CHUONG TRINH TIM UCLN CUA HAI SO');
write('Nhap a: ');readln(a);
write('Nhap b: ');readln(b);
r:=a mod b;
while r<> 0 do
begin
b:=r;
a:=b;
r:=a mod b;
end;
write('UCLN cua hai so la: ',b);
readln
end.

Bi tp 4.6
Dy Fibonacy c hai phn t u l 1, 1. Cc phn t sau bng tng hai phn t
ng ngay trc n: 1, 1, 2, 3, 5, 8, 13, 21, ...

Trang 22
100 bi tp Turbo Pascal

Vit chng trnh in ra dy Fibonacy c phn t ln nht nh hn n?

a.Hng dn:

b.M chng trnh:

V.D liu kiu mng

Bi tp 5.1
Vit chng trnh cho php nhp n s v in ra theo th t ngc li. V d nhp 3,
5, 7 th in ra 7, 5, 3.
a.Hng dn:
- Dng bin n lu lng s cn nhp.
- Dng mng lu cc s va nhp.
- Cho i chy t n v 1 in cc s va nhp.
b.M chng trnh:
Program mang_1;
uses crt;
var n, i: integer;
M: array[1..100] of real;
Begin
write('Nhap so n: ');readln(n);
for i:=1 to n do
Begin
write('M[',i,']='); readln(M[i]);
end;
for i:= n downto 1 do write(m[i], ,);
readln
end.

Bi tp 5.2
Vit chng trnh nhp dy n s v in ra tng cc s l trong dy s va nhp.
a. Hng dn:

b. M chng trnh:
Program Mang_Tong_Le;
uses crt;
var i,n:byte;
M:array[1..100] of integer;
tong:longint;
begin
write('Nhap so phan tu cua day: ');readln(n);
for i:=1 to n do
begin
write('M[',i,']'); readln(M[i]);
end;
tong:=0;

Trang 23
100 bi tp Turbo Pascal

for i:=1 to n do if M[i] mod 2 =1 then

tong:=tong+M[i];
write('Tong cac so le trong day la: ',tong);
readln
end.

Bi tp 5.3
Vit chng trnh nhp n s, xo s th k trong n s va nhp.In ra n-1 s cn li.
n= 10 (Nhp 10 phn t)
V d: Nhp 2, 3, 4, 5, 6, 8, 7, 6, 5, 4.
k= 8 (Xo phn t th 8).
In ra: 2, 3, 4, 5, 6, 8, 7, 5, 4.
a. Hng dn:
Xo phn t k bng cch ghi phn t th k+1 ln n.
b. M chng trnh:
Program Xoa_mang;
uses crt;
var m:array[1..100] of integer;
n,i,k:byte;
begin
Write('So phan tu cua day: ');readln(n);
for i:=1 to n do
Begin
write('M[',i,']=');
readln(M[i]);
end;
write('Nhap phan tu can xoa: ');readln(k);
for i:=k to n-1 do m[i]:=m[i+1];
for i:=1 to n-1 do write(m[i],', ');
readln
end.

Bi tp 5.4
Vit chng trnh cho php nhp nhp mt dy gm n s nguyn. Nhp thm mt
s v chn thm vo dy sau phn t k.
a. Hng dn:
- Di cc phn t t v tr k v sau mt bc.
- Nhp gi tr cn chn vo v tr k.
b. M chng trnh:
Program Mang_chen;
uses crt;
var M: array[1..100] of integer;
i,n,k:integer;
begin
clrscr;
write('Nhap : ');readln(n);
for i:=1 to n do

Trang 24
100 bi tp Turbo Pascal

begin
write('M[',i,']='); readln(M[i]);
end;
write('Vi tri chen: ');readln(k);
for i:=n+1 downto k+1 do M[i]:=M[i-1];
write('Nhap so can chen: '); readln(M[k]);
for i:=1 to n+1 do write(M[i],', ');
readln
end.

Bi tp 5.5
Vit chng trnh cho php nhp n s v cho bit s nh nht trong cc s va
nhp l s th my.
a.Hng dn:
- Dng bin n lu lng s cn nhp.
- Dng mng lu cc s va nhp.
- Cho Min = M[1], j = 1 (Xem phn t u tin l b nht)
- So snh Min vi n-1 s cn li. Trong qu trnh so snh nu Min > M[i] th gn
Min = M[i], j=i v tip tc so snh .
b.M chng trnh:
Program TIM_NHO_NHAT;
uses crt;
var n,i,nhonhat:integer;
m: array[1..100] of real;
min:real;
begin
write('Nhap n: '); readln(n);
for i:=1 to n do
begin
write('M[',i,']=');
readln(m[i]);
end;
min:=m[1];
nhonhat:=1;
for i:=2 to n do if m[i] < min then
begin
min:=m[i];
nhonhat:=i;
end;
writeln('phan tu nho nhat la phan tu thu',nhonhat);
readln
end.

Bi tp 5.6
Vit chng trnh cho php nhp n s sp xp v in ra cc s nhp theo th t
tng dn.
a. Hng dn:

Trang 25
100 bi tp Turbo Pascal

b. M chng trnh:
Program Sap_xep_1;
uses crt;
var n,i,k,nhonhat:integer;
m: array[1..100] of integer;
min,tam:integer;
begin
{--- Nhap mang co n phan tu------}
write('Nhap n: '); readln(n);
for i:=1 to n do
begin
write('M[',i,']=');
readln(m[i]);
end;
{---Tim so be nhat --------}
for k:=1 to n do
begin
min:=m[k];
nhonhat:=k;
for i:=k+1 to n do if m[i] < min then
begin
min:=m[i];
nhonhat:=i;
end;
{----Doi cho m[k] voi m[j] vi m[j] nho nhat -----------}
tam:=m[k];
m[k]:=m[nhonhat]
m[nhonhat]:=tam;
end;
{----In mang sau khi sap xep --}
for i:=1 to n do write(m[i],', ');
readln
end.

Bi tp 5.7:
Vit chng trnh in dy n s fibonacy.
a.Hng dn:
- S dng mng M cha dy n s fibonacy. To lp hai phn t u tin l 1, 1.
- Cho i chy t 3 n n. M [i] = M[i-1]+M[i-2].
- In n phn t u tin ca mng.
b.M chng trnh:
Program Fibonacy_mang;
uses crt;
var i,n: integer;
m:array[1..100] of longint;
begin
write('Nhap so phan tu can in:'); readln(n);

Trang 26
100 bi tp Turbo Pascal

m[1]:=1;
m[2]:=1;
for i:=3 to n do m[i]:=m[i-1]+m[i-2];
for i:=1 to n do write(m[i],' ,');
readln
end.

Bi tp 5.8
xc nh h s cho a th khai trin (a+b)n ngi ta s dng tam gic Pascal.
1
11
121
1331
14641
... Hng th n c xc nh t hng n-1:
- Phn t u tin v phn t cui cng u bng 1.
- Phn t th 2 l tng ca phn t th nht v th 2 ca hng n-1
- Phn t th k ca hng th n l tng cu phn t th k-1 v k ca hng th n-1.
a. Hng dn :
- Dng hai mng: Tam, v m to v in cc hng ca tam gic.
- Khi ng cho mng m[1]=1; m[2]:=1
- Lp mng tam cho dng i.
- Chuyn mng tm cho mng m.
- In ra dng i.
b. M chng trnh:
Program Tam_giac_Pascal;
uses crt;
var n,i,j:integer;
m,tam: array[1..100] of integer;
begin
write('Nhap bac cua tam giac: ');readln(n);
m[1]:=1;
m[2]:=1;
for i:=1 to n do
begin
{Phan tu dau bang 1}
tam[1]:=1;
for j:=2 to i-1 do tam[j]:=m[j-1]+m[j];
{Phan tu cuoi bang 1}
tam[i]:=1;
{Chuyen cac phan tu tu mang tam sang mang m}
for j:=1 to i do m[j]:=tam[j];
{in ra hang thu i}
for j:=1 to i do write(m[j]:3); writeln;
end;
readln
end.

Trang 27
100 bi tp Turbo Pascal

Bi tp 5.9
Vit chng trnh cho php nhp.
a. Hng dn:
b. M chng trnh:

Bi tp 5.10
Vit chng trnh cho php nhp.
a. Hng dn:
b. M chng trnh:

VI. Chng trnh con

Bi tp 6.1:
Vit chng trnh gii phng trnh bc hai vi yu cu s dng cc chng trnh
con gii quyt cc trng hp xy ra ca delta.
a. Hng dn:
b. M chng trnh:
Program Giai_PT_bac_hai;
uses crt;
var a,b,c,delta:real;
{----------------------}
Procedure delta_duong;
begin
write('Phuong trinh co hai nghiem x1=',(-
b+sqrt(delta))/(2*a),'x2=',(-b+sqrt(delta))/(2*a));
end;
{---------------------}
Procedure delta_khong;
begin
write('Phuong trinh co nghiem kep x=',-b/(2*a):3:1);
end;
{--------------------}
Procedure delta_am;
begin
writeln('Phuong trinh vo nghiem');
end;
{Chuong trinh chinh}
Begin
clrscr;
write('Nhap a: ');readln(a);
write('Nhap b: ');readln(b);
write('Nhap c: ');readln(c);
delta:=b*b-4*a*c;
if delta>0 then delta_duong
else if delta = 0 then delta_khong
else delta_am;
readln
end.

Trang 28
100 bi tp Turbo Pascal

c. Nhn xt: Chng trnh con cho php chia nh cng vic nhm n gin ho. Ngoi ra
lp trnh i hi k nng lp trnh theo nhm.Mi ngi thc hin mt m-un ring, sau
th hin ghp ni c chng trnh hon chnh.

Bi tp 6.2:
Vit chng trnh cho php nhp hai s vo hai bin, thc hin i gi tr ca hai
bin cho nhau. Yu cu dng chng trnh con thc hin chc nng i gi tr.
a. Hng dn:
b. M chng trnh:
Program CTC_1;
uses crt;
var a,b: real;
{----CTC doi gia tri----}
Procedure swap(var x,y:real);
var tam:real;
begin
tam:=x;
x:=y;
y:=tam;
end;
{-----Ket thuc CTC-----}
begin
clrscr;
write('Nhap so a: ');readln(a);
write('Nhap so b: ');readln(b);
swap(a,b);
write('Sau khi doi a =',a:3:1);
write('Sau khi doi b =',b:3:1);
readln
end.

b. Nhn xt:
- Nu b t var khai bo var x,y:real th chng trnh vn khng bo li nhng
chc nng i gi tr ca hai bin khng thc hin c.

Bi tp 6.3:
Vit chng trnh tnh giai tha ca s n (Vit l n!). Vi yu cu:
- Nu ngi dng nhp s n < 0 th yu cu nhp li.
- S dng chng trnh con tnh giai tha ca mt s.
n! = 1 nu n = 0;
n! = 1.2.3.4.5...n (Tch ca n tha s).
a. Hng dn:
b. M chng trnh:
Program CTC_2;
uses crt;

Trang 29
100 bi tp Turbo Pascal

var n:integer;x:longint;
Procedure Giai_Thua(var GT:longint; n:byte);
begin
GT:=1;
while n>0 do
begin
GT:=GT*n;
n:=n-1;
end;
end;
begin
repeat
clrscr;
write('Nhap so n: ');readln(n);
if n < 0 then begin write('Nhap so n
>=0');readln; end;
until n>=0;
Giai_Thua(x,n);
writeln('Giai thua cua ',n,'la:',x);
readln
end.

Bi tp 6.4:
Vit chng trnh tnh n! vi yu cu s dng hm tnh giai tha.
a. Hng dn:
b. M chng trnh:
Program Giai_thua_Ham;
uses crt;
var n: longint;
Function Giai_Thua(n:longint):longint;
Var GT:Longint;
begin
GT:=1;
while n > 0 do
begin
GT:=GT * n;
n:=n-1;
end;
Giai_thua:=GT;
end;
begin
clrscr;
write('Nhap n: '); readln(n);
write(n,'!=',Giai_thua(n));
readln
end.

Trang 30
100 bi tp Turbo Pascal

Bi tp 6.5:
Vit chng trnh cho php thc hin rt gn phn s.
a. Hng dn:
- Tm UCLN ca t s v mu s.
- Chia t v mu ca phn s cho UCLN va tm c.
b. M chng trnh:
Program Rut_gon_phan_so;
uses crt;
var tu,mau:integer;
Function UCLN(a,b:integer):integer;
var r: integer;
begin
r:= a mod b;
while r <> 0 do
begin
a:= b;
b:= r;
r:=a mod b;
end;
UCLN:=b;
end;
begin
clrscr;
write('Nhap tu: '); readln(tu);
write('Nhap mau: '); readln(mau);
write('Ket qua rut gon: ',tu,'/',mau,'=',tu div
UCLN(tu,mau),'/',mau div UCLN(tu,mau));
readln
end.

Bi tp 6.6:
Vit chng trnh cho php trn hai dy s A v B cng c s phn t l k
c dy s C theo yu cu sau:
A = a1, a2 ... ak
B = b1, b2 ... bk
c C = a1, b1, a2, b2 ... ak, bk.

a. Hng dn:
b. M chng trnh:
Program Tron_day;
uses crt;
type kieu_mang = array[1..100] of integer;
var A, B, C: Kieu_mang;

Trang 31
100 bi tp Turbo Pascal

n,i,j: integer;
Procedure Nhap_Mang(Var X: Kieu_mang; n:byte);
var i:integer;
begin
for i:=1 to n do
begin
write('M[',i,']=');readln(X[i]);
end;
end;
Procedure In_Mang(X:kieu_mang; n:byte);
var i: byte;
begin
for i:=1 to n do write(x[i],', ');
end;
{-----------}
begin
clrscr;
write('Nhap so phan tu cua day: ');read(n);
Nhap_mang(A,n);
Nhap_mang(B,n);
i:=1;
j:=1;
while i<= n do
begin
C[j]:= A[i];
C[j+1]:=B[i];
j:=j+2;
i:=i+1;
end;
in_mang(C,2*n);
readln
end.

Bi tp 6.7:
Vit chng trnh in ra cc s nguyn t nh hn n vi yu cu dng hm kim
tra mt s c phi l s nguyn t hay khng.
a. Hng dn:

b. M chng trnh:
Program In_so_nguyen_to;
uses crt;
var n, i: integer;
{------Ham kiem tra-------}
Function kiem_tra(n:integer):boolean;
var i: integer;
begin

Trang 32
100 bi tp Turbo Pascal

kiem_tra:=true;
for i:=2 to n-1 do if (n mod i) = 0 then
kiem_tra:=false;
end;
{------CTC----------------}
begin
clrscr;
write('Nhap n: '); readln(n);
for i:=2 to n do if kiem_tra(i) then write(i:3,
', ');
readln;
end.

Bi tp 6.8:
Vit chng trnh cho php sp xp mt dy s vi yu cu s dng cc chng
trnh con: Nhp mng, in mng, i gi tr ca hai s.
a. Hng dn:
b. M chng trnh:
Program Sap_xep_day;
uses crt;
type kieu_mang =array[1..100] of integer;
Var A: kieu_mang;
n,i,j:byte;
{---------------------}
Procedure Nhap_mang(var M:Kieu_Mang;n:byte);
Var i:byte;
begin
for i:=1 to n do
begin
write('M[',i,']=');readln(M[i]);
end;
end;
{---------------------}
Procedure In_mang(var M:Kieu_Mang;n:byte);
Var i:byte;
begin
for i:=1 to n do write(M[i]:3,', ')
end;

{---------------------}
Procedure swap(var a,b:integer);
var tam:integer;
begin
tam:=b;
b:=a;
a:=tam;

Trang 33
100 bi tp Turbo Pascal

end;
{---------------------}

Begin
Clrscr;
write('Cho biet so phan tu cua day:
');readln(n);
nhap_mang(A,n);
for i:=1 to n-1 do
for j:= i to n do if A[i]>A[j] then
swap(A[i],A[j]);
In_mang(A,n);
readln
end.

Bi tp 6.9:
Vit chng trnh tnh n! bng k thut qui.
a. Hng dn:
Nu = 0 th n! = 1 ngc li n! = n*(n-1)!
b. M chng trnh:
Program Giai_thua_de_qui;
uses crt;
var n: longint;
function Giai_thua(n:longint):longint;
begin
if n=0 then giai_thua:=1
else Giai_thua:=n*Giai_thua(n-1);
end;
begin
clrscr;
write('Nhap n: '); readln(n);
write(n,'!=',Giai_thua(n));
readln
end.

c. Nhn xt:
Dy s fibonacy c nh ngha: F(1) = 1; F(2) = 1; F(n) = F(n-1) + F(n-2).
Da vo nh ngha ny ta c th vit Fi(n) tnh s hng th n ca dy.
Bi tp 6.10:
Vit chng trnh cho php tm c chung ln nht ca hai s bng k thut
qui.
a. Hng dn:
- Nu a chia b d 0 th UCLN(a,b)=b ngc li UCLN(a,b)=UCLN(b, a mod b)

b. M chng trnh:

Trang 34
100 bi tp Turbo Pascal

Program UCLN_de_qui;
uses crt;
var a,b: integer;
Function UCLN(a,b:integer):integer;
begin
if a mod b = 0 then UCLN:=b
else UCLN:=UCLN(b,(a mod b));
end;
begin
clrscr;
write('Nhap a: ');readln(a);
write('Nhap b: ');readln(b);
write('UCLN(',a,',',b,')=',UCLN(a,b));
readln
end.

VII. D liu kiu xu k t:

Bi 7.1:
Vit on chng trnh cho php c mt xu k t v kim tra xu ny c i
xng khng.
V d: Xu abcddcba l xu i xng. Xu abcdabcd khng i xng.
a.Hng dn:
b. M chng trnh:
Program xau_doi_xung;
var st:string;
doi_xung: boolean;
i,n:byte;
begin
write('Nhap xau can kiem tra: '); readln(st);
doi_xung:= true;
n:=length(st);
for i:=1 to n div 2 do
if st[i]<> st[n-i+1] then doi_xung:=false;
if doi_xung then write('Xau doi xung') else
write('Khong doi xung');

Trang 35
100 bi tp Turbo Pascal

readln
end.

c. Nhn xt:
- Dng thm bin n chng trnh r rng, d theo di. C th thay n bng
length(st);
- C th thay for i:=1 to n div 2 bng for i:=1 to n nhng lc
chng trnh phi xt n trng hp thay v ch cn xt n/2 trng hp.
- Thut ton ca bi ny ging vi thut ton xt xem mt s c phi l s nguyn
t khng (Thut ton lnh canh).
Bi 7.2:
Vit chng trnh cho php vit hoa k t u t trong mt xu.
V d: le nho duyet -> Le Nho Duyet
a. Hng dn:
b. M chng trnh:
Program Doi_chu;
uses crt;
var st: string;
i:byte;
begin
clrscr;
write('Nhap xau can doi:'); readln(st);
for i:= 1 to length(st) do if (st[i]=' ')
then st[i+1]:=upcase(st[i+1]);
st[1]:=upcase(st[1]);
write(st);
readln
end.

c. Nhn xt:
Bi 7.3:
Vit chng trnh xo cc du cch tha trong mt xu k t (Gia hai t ch c
mt du cch.
V d: Le nho Duyet -> Le Nho Duyet
a.Hng dn:
- Thc hin lp cho n khi khng tm thy hai k t trng lin tip trong xu: Thay th
xu hai k t trng bng xu mt k t trng.
b. M chng trnh:
Program Xoa_trang;
uses crt;
var st: string;
n:byte;
begin
clrscr;
write('Nhap xau can chuan hoa: '); readln(st);

Trang 36
100 bi tp Turbo Pascal

n:= Pos(' ',st);

while n<>0 do
begin
delete(st,n,1);
n:=Pos(' ',st);
end;
write(st);
readln
end.

c. Nhn xt: Khng dng bin n chng trnh tuy kh theo di hn nhng n gin hn
nhiu:
Thay: n:= Pos(' ',st);
while n<>0 do
begin
delete(st,n,1);
n:=Pos(' ',st);
end;
Bng : while (' ',st) <>0 do delete(st, Pos(' ',st),1)
Bi 7.4:
Vit chng trnh cho php tch phn tn ra khi xu gm h v tn. Theo qui c
cch ghi tn ca Ting vit, tn l t cui cng trong xu.
V d: Le Nho Duyet -> Duyet.
a.Hng dn:
b. M chng trnh:
Program Tach_Ten;
uses crt;
var st,ten: string;
vitri,dai,i: byte;
begin
clrscr;
write('Nhap xau: '); readln(st);
for i:=1 to length(st) do if st[i]=' ' then
vitri:=i+1;
writeln(vitri);
dai:=length(st) - vitri + 1;
ten:=Copy(st,vitri,dai);
write(ten);
readln
end.

c. Nhn xt: Chng trnh trn s chy sau nu xu c k t trng cui xu (Lc
vic xc nh v tr ca tn s sai). khc phc li ny ta cn thc hin xo k t trng
cui xu trc.
Bi 7.5:
Vit chng trnh cho php dich xu sang m moocxo.
a.Hng dn:

Trang 37
100 bi tp Turbo Pascal

b. M chng trnh:
Program Mooc_xo;
uses crt;
var st,mooc :string;
i: byte;
begin
write('Nhap cau bach van: '); readln(st);
for i:=1 to length(st) do
case st[i] of
'a': mooc:=mooc + ' '+'._';
'b': mooc:=mooc + ' '+'_.';
end;
write(mooc);
readln
end.

c. Nhn xt:
- on chng trnh ch mi m ho c hai k t a, b. c th s dng cn
khai bo cho cc trng hp cn li.
- Thc t khng cn phn bit ch hoa hay ch thng nn ta qui v mt kiu.
qui v kiu ch hoa ta dng case upcase(st[i]) of thay cho case st[i]
of...

Bi 7.6:
Vit phn mm cho php m ho v gii m mt xu k t theo ring. m
ho mi ngi dng cc kho khc nhau. V d Kho a: = succ(a) cho php m ho xu
abc thnh bcd.
a.Hng dn:
b. M chng trnh:
Program Ma_hoa;
uses crt;
var st: string;
i: byte;
begin
clrscr;
write('Nhap xau can ma hoa: ');readln(st);
for i:= 1 to length(st) do st[i]:=succ(st[i]);
write('Sau ma hoa: ',st);
readln;
for i:= 1 to length(st) do st[i]:=pred(st[i]);
write('Sau giai ma: ',st);
readln;
end.

c. Nhn xt: m ho theo kho a ->b ta dng hm succ, v pred. Nu kho l a ->d lc
ta dng n cc hm cho bit m ascii ca k t (ORD) v k t c m (CHR) .

Trang 38
100 bi tp Turbo Pascal

Bi 7.7:
Vit chng trnh cho php i mt s h thp phn sang s nh phn.
a.Hng dn:
b. M chng trnh:
Program Doi_Ra_Nhi_Phan;
uses crt;
var st,st1: string;
so: longint;i:byte;
begin
clrscr;
write('Nhap so can doi: '); readln(so);
st:='';
while so > 0 do
begin
str(so mod 2,st1);
st:=st+st1;
so:=so div 2;
end;
for i:=length(st) downto 1 do write(st[i]);
readln
end.

c. Nhn xt:Chng ta hon ton c th thay str(so mod 2,st1);bng lnh if so

mod 2 = 1 then st:=st+1 else st:=st+0. Lc ny ta khng phi
dng thm bin ph st1.
Bi 7.8:
Vit chng trnh r ch: Khi ct khu hiu ngi ta thng c nhu cu c bit
mi k t xut hin bao nhiu ln trong cu khu hiu. Hy vit chng trnh thc hin
iu .
V d nhp: LE NHO DUYET
Cho bit D: 1; E: 2...
a.Hng dn:
b. M chng trnh:
Program Ra_chu;
uses crt;
var st:string;
M: array['A'..'Z'] of byte;
ch:Char;
i:byte;
begin
clrscr;
writeln('CHUONG TRINH RA CHU DE CAT KHAU HIEU');
write('Nhap cau: ');readln(st);
for i:=1 to length(st) do st[i]:=upcase(st[i]);
for ch:='A' to 'Z' do M[ch]:=0;
for i:=1 to length(st) do
begin

Trang 39
100 bi tp Turbo Pascal

ch:=st[i];
M[ch]:= M[ch]+1;
end;
for ch:='A' to 'Z' do if M[ch]>0 then
write(ch,':',M[ch],' ');
readln
end.

c. Nhn xt:
Bi 7.9:
Khi cng hai s c gi tr qu ln ta khng th thc hin c do gi hn gi tr
ca bin. Bng cch s dng xu k t, ta c th lp chng trnh cng hai s rt ln
(255 ch s). Hy vit chng trnh ny.
a.Hng dn:
b. M chng trnh:
Program Cong_so_lon;
uses crt;
var so1, so2, tong, st1: string;
nho, i, chuso1, chuso2, chusoc: byte;
m:integer;
Procedure Doi_chieu(var so:string);
var i:byte;
tam: string;
begin
tam:='';
for i:=length(so) downto 1 do tam:=tam+so[i];
so:=tam;
end;

begin
write('Nhap so thu nhat: ');readln(so1);
write('Nhap so thu hai: ');readln(so2);
doi_chieu(so1);
doi_chieu(so2);
{-Lam cho hai so co do dai giong nhau}
if length(so1)>length(so2) then
for i:=1 to length(so1)-length(so2) do so2:=so2
+'0'
else
for i:=1 to length(so2)-length(so1) do so1:=so1
+'0';
{--Bat dau cong-----------}
nho:=0;
for i:=1 to length(so1) do
begin
val(so1[i],chuso1,m);

Trang 40
100 bi tp Turbo Pascal

val(so2[i],chuso2,m); {Doi thanh so de

cong}
chusoc:= (chuso1+chuso2+nho) mod 10;
nho:= (chuso1+chuso2+nho) div 10;
str(chusoc,st1); {Doi thanh ky tu de dua
vao tong}
tong:=tong+st1
end;
{Cong them nho cuoi cung}
if nho>0 then
begin
str(nho,st1);
tong:=tong+st1
end;
{---------------}
doi_chieu(tong);
write(tong);
readln
end.

c. Nhn xt:
Bi 7.10:
Vit chng trnh cho php ghi bng ch mt s. V d: 123.456.789 c Mt
trm hai mi ba triu, bn trm nm mi su ngn, by trm tm mi chn.
a. Hng dn:
b. M chng trnh:
Program Doc_so;
var n:longint;
Function Dich_1so(n:byte):string;
begin
case n of
1: Dich_1so:='mot';
2: Dich_1so:='hai';
3: Dich_1so:='ba';
4: Dich_1so:='bon';
5: Dich_1so:='nam';
6: Dich_1so:='sau';
7: Dich_1so:='bay';
8: Dich_1so:='tam';
9: Dich_1so:='chin';
0: Dich_1so:='khong';
end;
end;

Function Dich_3so(n:integer):string;
var Ket_qua: string;

Trang 41
100 bi tp Turbo Pascal

begin
Ket_qua:=Dich_1so(n div 100) + ' tram ';
n:= (n mod 100);
Ket_qua:=Ket_qua + Dich_1so(n div 10) +' muoi ';
n:=n mod 10;
Ket_qua:=Ket_qua + Dich_1so(n);
Dich_3so:=Ket_qua;
end;
Function Dich_9so(n:longint):string;
var ket_qua: string;
begin
ket_qua:='';
if n div 1000000000 > 0 then
ket_qua:=dich_3so(n div 1000000000) +' ty, ';
n:=n mod 1000000000;
if n div 1000000 > 0 then ket_qua:=ket_qua +
dich_3so(n div 1000000)+' trieu, ';
n:=n mod 1000000;
if n div 1000 > 0 then ket_qua:=ket_qua +
dich_3so(n div 1000)+' ngan, ';
n:=n mod 1000;
ket_qua:=ket_qua + dich_3so(n);
Dich_9so:=ket_qua;
end;
{----------------------}
begin
write('Nhap so n: '); readln(n);
write(Dich_9so(n));
readln
end.

c. Nhn xt: Cn rt nhiu trng hp ring cn x l a on chng trnh trn vo

s dng trong thc t.
VIII. D liu kiu record:
Bi tp 8.1
Vit chng trnh cho php nhp v in ra mt phn s vi yu cu phn s c
lu tr trong mt bin record.
a. Hng dn:
- Khai bo bin Phan_so l mt record.
Phan_so = Record
Tu: Integer.
Mau:Integer;
End;
b. M chng trnh:
Program Phan_So_1;
uses crt;
var x: record

Trang 42
100 bi tp Turbo Pascal

Tu: Integer;
Mau: Integer;
end;
Begin
clrscr;
Write('Nhap tu so: ');readln(x.Tu);
Write('Nhap mau so: '); readln(x.Mau);
with x do
begin
Write('Phan so vua nhap la:',Tu,'/',Mau);
end;
readln
end.

c. Nhn xt:
Khi nhp v khi in phn s ta c hai cch truy cp thnh phn ca record (
y l t v mu) khc nhau. Mt truy cp trc tip, mt thng qua lnh with ... do
Bi tp 8.2
Thc hin 8.1 vi yu cu vit hai th tc nhp v in phn s.
a. Hng dn:
b. M chng trnh:
Program Phan_So_2;
uses crt;
Type Phan_so = record
Tu: Integer;
Mau: Integer;
end;
var x: Phan_so;
Procedure Nhap_Phan_so(Var a:Phan_so);
begin
with a do
begin
Write('Nhap tu so: ');readln(Tu);
Write('Nhap mau so: '); readln(Mau);
end;
end;
{-------------------}
Procedure In_Phan_so(a:Phan_so);
Begin
with x do
Write('Phan so vua nhap la:',Tu,'/',Mau);
end;
{-------------------}
begin
clrscr;
Nhap_Phan_so(x);
In_Phan_so(x);
Readln
end.

Trang 43
100 bi tp Turbo Pascal

c. Nhn xt:
8.1 ta khai bo mt bin c kiu record. 8.2 ta khai bo mt kiu Phan_so
bng lnh Type ri sau mi khai bo bin x c kiu Phan_so.
Bi tp 8.3
Thc hin 8.2 vi yu cu phn s c nhp dng a/b.
a. Hng dn:
b. M chng trnh:
Program Phan_So_2;
uses crt;
Type Phan_so = record
Tu: Integer;
Mau: Integer;
end;
var x: Phan_so;
Procedure Nhap_Phan_so(Var a:Phan_so);
var st,st1:string;
n,m:integer;
begin
write('Nhap phan so a/b: ');readln(st);
n:= Pos(st,'/');
with a do
begin
st1:= copy(st,1,n-1);
val(st1,tu,m);
st1:= copy(st,n+1,length(st)-n);
val(st1,Mau,n);
end;
end;
{-------------------}
Procedure In_Phan_so(a:Phan_so);
Begin
with x do
Write('Phan so vua nhap la:',Tu,'/',Mau);
end;
{-------------------}
begin
clrscr;
Nhap_Phan_so(x);
In_Phan_so(x);
Readln
end.

c. Nhn xt:
y ta li c mt ng dng ca kiu string. Vi vic dng string lm b m
vic nhp phn s d, gn vi thc t hn. Tt nhin, phi x l nhiu mi c phn s
cn nhp.
Bi tp 8.4

Trang 44
100 bi tp Turbo Pascal

Thc hin 8.1 vi yu cu sau khi nhp thc hin rt gn ri mi in phn s.

a. Hng dn:
b. M chng trnh:
Program Phan_So_2;
uses crt;
Type Phan_so = record
Tu: Integer;
Mau: Integer;
end;
var x: Phan_so;
{----------------------}
Function UCLN(a,b:integer):integer;
begin
if a mod b = 0 then UCLN:=b
else UCLN:=UCLN(b,(a mod b));
end;
{----------------------}
Procedure Nhap_Phan_so(Var a:Phan_so);
var st,st1:string;
n,m:integer;
begin
repeat
write('Nhap phan so : ');readln(st);
n:= Pos('/',st);
until n>0;
with a do
begin
st1:= copy(st,1,n-1);
val(st1,tu,m);
st1:= copy(st,n+1,length(st)-n);
val(st1,Mau,n);
end;
end;
{-------------------}
Procedure In_Phan_so(a:Phan_so);
Begin
if a.Tu=a.Mau then write(1)
else
with a do
Write(Tu,'/',Mau);
end;
{-------------------}
Procedure Rut_Gon_Phan_so(var a:Phan_so);
var tam: integer;
begin
tam:=UCLN(a.Tu,a.Mau);
with a do
begin
Tu:=Tu div tam;
mau:=Mau div tam;

Trang 45
100 bi tp Turbo Pascal

end;
end;
{--------------------}
begin
clrscr;
Nhap_Phan_so(x);
Rut_gon_phan_so(x);
write('Phan so sau khi rut gon: ');
In_Phan_so(x);
Readln

c. Nhn xt:
Bi tp 8.5
Vit chng trnh cho php cng hai phn s vi yu cu: Mi phn s c lu
trong mt bin kiu record.
a. Hng dn:
b. M chng trnh:
Program Phan_So_2;
uses crt;
Type Phan_so = record
Tu: Integer;
Mau: Integer;
end;
var x,y,z: Phan_so;
{----------------------}
Function UCLN(a,b:integer):integer;
begin
if a mod b = 0 then UCLN:=b
else UCLN:=UCLN(b,(a mod b));
end;
{----------------------}
Procedure Nhap_Phan_so(Var a:Phan_so);
var st,st1:string;
n,m:integer;
begin
repeat
write('Nhap phan so : ');readln(st);
n:= Pos('/',st);
until n>0;
with a do
begin
st1:= copy(st,1,n-1);
val(st1,tu,m);
st1:= copy(st,n+1,length(st)-n);
val(st1,Mau,n);
end;
end;

Trang 46
100 bi tp Turbo Pascal

{-------------------}
Procedure In_Phan_so(a:Phan_so);
Begin
if a.Tu=a.Mau then write(1)
else
with a do
Write(Tu,'/',Mau);
end;
{-------------------}
Procedure Rut_Gon_Phan_so(var a:Phan_so);
var tam: integer;
begin
tam:=UCLN(a.Tu,a.Mau);
with a do
begin
Tu:=Tu div tam;
mau:=Mau div tam;
end;
end;
{--------------------}
Procedure Cong_Phan_so(a,b:Phan_so; Var c:Phan_so);
begin
with c do
begin
Tu:=a.Tu*b.Mau + a.Mau*b.Tu;
Mau:= a.Mau * b.Mau
end;
Rut_gon_phan_so(c);
end;
{--------------------}
begin
clrscr;
Nhap_Phan_so(x);
Nhap_Phan_so(y);
Cong_phan_so(x,y,z);
In_Phan_so(z);
Readln
end.

c. Nhn xt:
Bi tp 8.6
Vit chng trnh cho php nhp danh sch hc vin. Sau khi nhp mt hc vin
chng trnh yu cu tr li c nhp tip (Y/N). n Y tip tc nhp, n N thi nhp.
H s mi hc vin c qun l nh sau:
Hoso = record
Holot: string[20];

Trang 47
100 bi tp Turbo Pascal

Ten: string[10];
Gioitinh:boolean;
Ngaysinh: string[10];
SDD: longint;
Donvi: string[15];
end;

a. Hng dn:
b. M chng trnh:
Program Nhan_su;
uses crt;
type Hoso = record
Holot: string[20];
Ten: string[10];
Gioitinh:boolean;
Ngaysinh: string[10];
SDD: longint;
Donvi: string[15];
end;
var danhsach: array[1..100] of Hoso;
nhap:Char;
gt: string;
i:byte;
Begin
nhap:='Y';
i:=0;
while nhap='Y' do
begin
clrscr;
window(10,10,60,40);
writeln('------ NHAP HO SO NHAN SU-------');
writeln;
i:=i+1;
writeln('Nhap ho so nguoi thu ',i,':');
write('Ho lot:');readln(danhsach[i].Holot);
write('Ten:');readln(danhsach[i].Ten);
write('Gioi tinh (Nam/Nu):');readln(gt);
if gt = 'Nu' then danhsach[i].Gioitinh:= true;
write('Ngay
sinh:');readln(danhsach[i].Ngaysinh);
write('So dien thoai:');readln(danhsach[i].SDD);
write('Don vi:');readln(danhsach[i].Donvi);
write('Nhap tiep Y/N');readln(nhap);
nhap:=upcase(nhap);
end;
end.

c. Nhn xt:
Bi tp 8.7

Trang 48
100 bi tp Turbo Pascal

Vit chng trnh cho php nhp v in danh sch danh sch n ca lp vi yu
cu: S dng chng trnh con nhp danh sch v chng trnh con in mt h s.
a. Hng dn:
b. M chng trnh:
Program Nhan_su;
uses crt;
type Hoso = record
Holot: string[20];
Ten: string[10];
Gioitinh:boolean;
Ngaysinh: string[10];
SDD: longint;
Donvi: string[15];
end;
Type danhsach = array[1..100] of Hoso;
Var ds: danhsach;
i:integer;

Procedure Nhap_ho_so(Var ds:danhsach);

var nhap:Char;
i:byte;
gt: string;
begin
nhap:='Y';
i:=0;
while nhap='Y' do
begin
clrscr;
writeln('------ NHAP HO SO NHAN SU-------');
writeln;
i:=i+1;
writeln('Nhap ho so nguoi thu ',i,':');
write('Ho lot:');readln(ds[i].Holot);
write('Ten:');readln(ds[i].Ten);
write('Gioi tinh (Nam/Nu):');readln(gt);
if gt = 'Nu' then ds[i].gioitinh:= true;
write('Ngay sinh:');readln(ds[i].ngaysinh);
write('So dien thoai:');readln(ds[i].SDD);
write('Don vi:');readln(ds[i].Donvi);
write('Nhap tiep Y/N: ');readln(nhap);
nhap:=upcase(nhap);
end;

end;
Procedure In_ho_so(HVien:Hoso);
begin
with Hvien do

writeln('|',Holot:20,Ten:10,'|',Ngaysinh:10,'|',SDD:10,'|',
Donvi:20,'|');

Trang 49
100 bi tp Turbo Pascal

end;

begin
nhap_ho_so(ds);
writeln('DANH SACH HOC VIEN NU');
writeln;
i:=1;
while ds[i].holot<>'' do
begin
if ds[i].gioitinh then in_ho_so(ds[i]);
i:=i+1;
end;
readln
end.

c. Nhn xt:
Bi tp 8.8
Pht trin thm chc nng sp xp (Theo tn) chng trnh cho php nhp, sp
xp, in danh sch.
a. Hng dn:
b. M chng trnh:

c. Nhn xt:
Bi tp 8.9
a. Hng dn:
b. M chng trnh:

c. Nhn xt:
Bi tp 8.10
a. Hng dn:
b. M chng trnh:

c. Nhn xt:

IX. D liu kiu tp:

Bi tp 9.1
Vit chng trnh cho php ghi cc s l xung a vi tn so_le.dat sau c v
xut ra mn hnh ni dung file ny.
a. Hng dn:
- Th tc chun b ghi file xung a ( assign, rewrite).
- Kim tra nu l s l if i mod 2 = 1 th ghi xung a.

Trang 50
100 bi tp Turbo Pascal

- Th tc chun b c file t a ( assign, reset).

- c v in ni dung.
- ng file.
b. M chng trnh:
Program File_So_le;
uses crt;
var sole: file of integer;
i,n,so:integer;
begin
write('Nhap n: ');readln(n);
{ Thu tuc chuan bi ghi xuong dia}
assign(sole,'sole.dat');
rewrite(Sole);
{Thuc hien ghi cac so le xuong file sole = sole.dat }
for i:= 1 to n do if i mod 2 = 1 then write(sole,i);
close(sole);
writeln('Da ghi xuong file sole.dat');
readln;
{Thu tuc chuan bi doc duw lieu tu file tren dia}
assign(sole,'sole.dat');
reset(sole);
{Thuc hien do va in ra man hinh}
while not eof(sole) do
begin
read(sole,so);
write(so,', ');
end;
close(sole);
readln
end.

c. Nhn xt:
Bi tp 9.2.
Vit chng trnh tm cc s nguyn t nh hn hoc bng n ( nhp t bn phm)
v ghi cc s ny xung a.
a. Hng dn:
- Hm nguyen_to kim tra mt s a c phi l s nguyn t khng.
- Thc hin nh 9.1 thay if i mod 2 = 1 bng nguyen_to(n)
b. M chng trnh:
Program File_Nguyen_to;
uses crt;
var nguyento: file of integer;
i,n,so:integer;
{--------------------}
Function nguyen_to(a:integer):boolean;
var i: integer;
begin
nguyen_to:=true;
for i:=2 to a-1 do if a mod i = 0 then nguyen_to:=false;
end;
{--------------------}
begin

Trang 51
100 bi tp Turbo Pascal

write('Nhap n: ');readln(n);
assign(nguyento,'nguyento.dat');
rewrite(nguyento);
for i:= 2 to n do if nguyen_to(i) then write(nguyento,i);
close(nguyento);
writeln('Da ghi xuong file nguyento.dat');
readln;
assign(nguyento,'nguyento.dat');
reset(nguyento);
while not eof(nguyento) do
begin
read(nguyento,so);
write(so,', ');
end;
readln
end.

c. Nhn xt:
Bi tp 9.3
Vit chng trnh thc hin vic cp s xe m t vi yu cu:
- Cp s ngu nhin c 4 ch s.
- S cp c lu li trn a qun l.
a. Hng dn:
- Dng hm random to s ngu nhin.
- Lu s va cp thm vo file so_xe.dat.
b. M chng trnh:

c. Nhn xt:
Bi tp 9.4
- c file so_xe.dat xt xem s va to c trong file ny khng. Nu c th quay li
to s ngu nhin khc. Lp cho n khi to c s khng c trong file ny (cha cp )
th cp s ny.

a. Hng dn:
b. M chng trnh:

c. Nhn xt:
Bi tp 9.5
a. Hng dn:
b. M chng trnh:

c. Nhn xt:
Bi tp 9.6
a. Hng dn:
b. M chng trnh:

Trang 52
100 bi tp Turbo Pascal

c. Nhn xt:
Bi tp 9.7
a. Hng dn:
b. M chng trnh:

c. Nhn xt:
Bi tp 9.8
a. Hng dn:
b. M chng trnh:

c. Nhn xt:
Bi tp 9.9
a. Hng dn:
b. M chng trnh:

c. Nhn xt:
Bi tp 9.10
a. Hng dn:
b. M chng trnh:

c. Nhn xt:

X. ho v m thanh:

Trang 53