TI LIU HC TP

MN TIN HC LP 10

Thc hin: Lu Hi Phong

GV: Lu Hai Phong

Page 1

A. NGN NG LP TRNH....................................................................................................................4
I. THNG TIN TRONG MY TNH..................................................................................................4
II. BI TON V THUT TON......................................................................................................7
.................................................................................................................................................7
III. CU LNH R NHNH.............................................................................................................8
IV. CU LNH LP.....................................................................................................................10
V. MNG MT CHIU................................................................................................................14
VI. KIU
MANG

2 CHIU
.............................................................................................................16
VII. KIU
XU............................................................................................................................19
VIII. KIU BN GHI....................................................................................................................23

GV: Lu Hai Phong

Page 2

LI M U

GV: Lu Hai Phong

Page 3

A. NGN NG LP TRNH
I. THNG TIN TRONG MY TNH
1. Khi nim thng tin
+ Thng tin l nhng hiu bit c th c c v mt thc th no
+ V d: Thng tin v vin phn: mu sc g, ca nh sn xut no, hnh dng, di.
2. n v o lng thng tin
+ n v c bn o lng thng tin l BIT (Binary digIT ), l lng thng tin va xc
nh chc chn 1 trng thi ca mt s kin c hai trng thi vi kh nng xut hin nh nhau
Mt BIT c 2 trng thi c quy nh l 1 v 0 (hoc TRUE v FALSE)
+ Cc n v khc o lng thng tin
K hiu
Cch c
ln
Kb
Ky-l-bai
1024 Byte
Mb
M-ga-bai
1024 Kb
Gb
Ghi-ga-bai
1024 Mb
Tb
T-ra-bai
1024 Gb
Pb
P-ta-bai
1024 Pb
Trong 1Byte=8Bit
3. M ha thng tin trong my tnh
+ Mun my tnh x l c, thng tin phi bin thnh dy Bit, cch bin i nh vy c gi l
mt cch m ha thng tin
+ Bng m ASCII (American Standard Code for Information Interchange): dng 8 Bit m ha
k t, trong bng m ny c 256 k t c nh s t 0 n 255, s hiu ny c gi l m thp
phn ca k t
+ Bng m Unicode: Dng 16 Bit m ha k t do vy n c th m ha c 65536 (216) k t
4. Biu din thng tin trong my tnh
a.H m
+ H m c hiu l tp cc k hiu v quy tc s dng tp k hiu biu din v xc nh
gi tr s
+ C cc h m hay dng nh:
- H nh phn: 2 k hiu l 0 v 1
- H bt phn: 8 k hiu l 0 1 2 3 4 5 6 7
- H thp phn: 0..9
- H c s 16: 0..9, A..E
b. Cch chuyn i gia cc h c s sang h thp phn v ngc li
+ Trong h thp phn: gi tr c xc nh theo quy tc mi n v ca hng bt k c gi tr
bng 10 ca hng k cn bn phi.
V d:
605,5=6x103+ 0x102+5x101+5x10-1
- Trong h m c s b gi s N c biu din: dkdk-1dk-2d1d0,d-1d-2d-m
Lc gi tr ca N trong h thp phn l
N=dkbk+ dk-1bk-1+ dk-2bk-2++ d-1b-1+ d-2b-2++ d-mb-m
V d: N16=A34,E
N10=10x162+3x161+4x160+14x16-1
= 2612,875
V d N2=1010,11
GV: Lu Hai Phong

Page 4

 N10=1x23+0x22+1x21+0x20+1x2-1+1x2-2=10,75

+ i h thp phn sang h c s b

- Phn nguyn: Chia lin tip s thp phn cho b ri ly phn d theo th t ngc li
V d: i 261210 sang h 16

Kt qu: A3416
- Phn thp phn: ly phn thp phn nhn lin tip phn thp phn cho b ri ly phn nguyn t
trn xung
V d: i 0,95312510 sang h c s 16
0,953125x16=15,25 F
0,25

x16=4

Kt qu 0,F416
c. H s nh phn (Binary)
+ H s nh phn l h s c to thnh bi hai k t 0 v 1
+ Php cng hai s nh phn
Php cng hai s nh phn cng ging nh php cng hai s thp phn
Bng cng hai s nh phn
a
1
1
0
0

b
1
0
1
0

kq
0
1
1
0

nh
1
0
0
0

V d:1210+710=1910
11002+1112=100112
t php tnh

+ Php tr hai s
- Lu : trong s nh phn ngi ta ly Bit u tin bn tri lm Bit du vi quy nh Bit 0 l s
dng, Bit 1 l s m
- S ln tr s b: Thc hin nh php tr s thp phn v
khng cn phn bit du
- S b tr s ln: Kt qu l mt s m nn ta phi lu n Bit dng lm du.
Php tr ny c thc hin thng qua 6 bc. V d 210-510 00102-01012

GV: Lu Hai Phong

Page 5

B1: ly b 1 ca s b tr, ta c th xem nh s b 1 ca mt s l s i ca n bng cch i tt

c cc Bit 0 thnh 1 v ngc li.
S b 1 ca 0101 l 1010
B2: Ly s b 2 ca s b tr.
S b 2 = s b 1 +1
S b 2 ca 0101 l 1010+1=1011
B3: ly s tr + s b 2 ca s b tr
0010+1011=1101
B4: i Bit u tin bn tri ca kt qu v Bit 0: 11010101
B5: Ly b 1 ca kt qu: 01011010
B6: Ly b 2: 10101011 = (-3)
Kt qu: vi quy nh Bit u tin bn tri dng lm Bit du th kt qu c c l (1)011
+ Php nhn v chia trong s nh phn: tng t nh trong s thp phn
+ Php ton logic trong s nh phn
- Cc php ton logic bao gm AND, OR, NOT, XOR. Kt qu tr v ca cc php ton ny l 1
hoc 0 (TRUE hoc FALSE ng hoc sai)
- Php AND: A AND B cho kt qu TRUE khi c A v B u TRUE, ngc li cho kt qu
FALSE
- Php OR: A OR B cho kt qu TRUE khi c t nht 1 v cho kt qu TRUE, trng hp cho kt
qu FALSE xy ra khi c A v B u FALSE
- Php NOT: NOT A ly ph nh ca A, nu A TRUE th ph nh ca A l FALSE v ngc li
- Php XOR: A XOR B cho kt qu TRUE khi 1 TRUE 1 FALSE, cho kt qu FALSE khi c hai
u TRUE hoc c hai u FALSE
- Ta c bng chn tr ca cc php ton, trong 1 tng ng vi TRUE, 0 tng ng vi FALSE
A
1 1
0
0
B
1 0
1
0
AND 1 0
0
0
OR
1 1
1
0
XOR 0 1
1
0

GV: Lu Hai Phong

Page 6

II. BI TON V THUT TON

1. Khi nim bi ton
Bi ton l mt vic no ta mun my tnh thc hin.
Gii bi ton trn my tnh ta cn quan tm n 2 yu t l Input v Output.
Input l nhng thng tin c
Output l nhng thng tin cn tm t Input
2. Khi nim thut ton
Vn t ra l lm sao tm c Output t Input?
Cch tm ra Output t Input ca mt bi ton gi l thut ton ca bi ton .
Thut ton gii mt bi ton l mt dy hu hn cc thao tc c sp xp theo mt trnh t
xc nh sao cho sau khi thc hin dy thao tc y, t Input ca bi ton, ta nhn c Output ca
chng trnh
biu din thut ton ca mt bi ton ta c th dng cch lit k tng bc hoc dng s
khi.
V d: Xt 1 bi ton n gin trong cuc sng: Pha Cafe
+ Input: Cafe, ng, fin, nc, ly, m un nc, mung
+ Output: Ly cafe pha
+ Thut ton (Lit k tng bc):
Bc 1: Nu nc, cafe v fin, fin trn ly
Bc 2: Nu nc si th vo fin (khong 1/2 n 2/3 fin)
Bc 3: Ch n khi nc chy ht xung ly
Bc 4: ng vo v khuy u
+ Thut ton (S khi)
Trc khi s dng cc khi hnh th hin thut ton ta quy c ngha ca mt s hnh nh sau:
Tn hnh

K hiu

Hnh thoi
Tri ma

ngha

V d

Th hin thao tc so snh.

Sau khi so snh kt qu
nhn c l ng (True)
hoc sai (False). Din t:
Nuthngc li. V
d: Nu tri ma th
nh, ngc li i chi

Hnh ch nht

3. Cc tnh cht ca thut ton:

Tnh dng

Tnh xc nh

Tnh ng n

GV: Lu Hai Phong

Page 7

III. CU LNH R NHNH

1. Cu lnh IF THEN
a. C php
+ Dng thiu: IF <iu kin> THEN <Cu lnh>;
+ Dng : IF <iu kin> THEN <Cu lnh 1> ELSE <Cu lnh 2>;
b. Gii thch: - IF, THEN, ELSE l t kha (tn dnh ring)
- <iu kin> l mt biu thc quan h hoc biu thc lgic
- <Cu lnh>; <Cu lnh 1>; <Cu lnh 2> l mt Cu lnh trong Pascal
c. ngha:
- Dng thiu: <Cu lnh> sau THEN s c thc hin nu <iu kin> ng (cho gi tr l TRUE)
- Dng : Nu <iu kin> ng th <Cu lnh 1> s c thc hin, nu <iu kin> sai th <Cu
lnh 2> s c thc hin
d. S khi

Dng thiu

Dng

e. Cu lnh ghp
+ Theo c php, sau THEN v ELSE phi l 1 cu lnh thc hin, tuy nhin trong nhiu trng hp
i hi phi c nhiu cu lnh thc hin, trong cc trng hp nh vy ngn ng lp trnh cho php
gp mt dy cu lnh thnh mt cu lnh ghp.
+ C php: BEGIN <Dy cu lnh> END;
2. Cu lnh CASE OF
a. C php
CASE <Biu thc> OF
<Danh sch hng 1>: <Cu lnh 1>;

<Danh sch hng k>: <Cu lnh k>;

ELSE <Cu lnh>;
END;
b. Gii thch:
+ CASE; OF; ELSE; END l cc t kha
+ <Biu thc> l biu thc ton hc (tr v gi tr nguyn) hoc biu thc logic hoc biu thc quan
h
+ <Danh sch hng 1><Danh sch hng k> l cc hng c cng kiu d liu vi <Biu thc>; Nu
c nhiu hng khc nhau trong 1 danh sch th chng phi c ngn cch nhau bi du phy
+ <Cu lnh>, <Cu lnh 1> <Cu lnh k> l cc cu lnh trong Pascal
c. ngha: Thc hin tnh ton gi tr ca <Biu thc>, ln lt so snh gi tr ca biu thc vi cc
hng trong cc danh sch hng, nu bng 1 hng no th cu lnh tng ng s c thc hin.
GV: Lu Hai Phong

Page 8

Trong trng hp tt c cc gi tr trong tt c cc danh sch hng khc gi tr ca <Biu thc>

thc hin <Cu lnh> sau ELSE
d. V d:
VAR n:integer;
BEGIN
Write('Nhap N: ');readln(N);
CASE N OF
1: Write('so 1');
2: Write('so 2');
3: Write('so 3');
4: Write('so 4');
5: Write('so 5');
6: Write('so 6');
7: Write('so 7');
8: Write('so 8');
9: Write('so 9');
0: Write('so 0');
ELSE write('so khac');
END;
END.
e. Ch :
+ Tt c cc hng khi s dng trong danh sch u phi khc nhau
+ Danh sch hng v cc cu lnh phi c cch nhau bng du hai chm (:)
3. Bi tp
1. Gii phng trnh bc nht: ax+b=0 (a<>0)
2. Gii phng trnh bc 2: ax2+bx+c=0 (a<>0)
3. Hy cho bit nm N c phi l nm nhun hay khng? (Bit rng nm nhun l nm chia ht cho
400 hoc chia ht cho 4 nhng khng chia ht cho 100)
4. Nhp vo t bn phm 3 s nguyn dng a, b, c hy cho bit 3 s ny c phi l di 3 cnh ca
mt tam gic hay khng?
5. Vit chng trnh cho bi tp 4 Trang 51 SGK Tin hc 11
6. Vit chng trnh in ra mn hnh gi tr nh nht ca hai s a, b
7. Vit chng trnh in ra mn hnh gi tr ln nht ca 3 s a, b, c
8. Nhp vo im trung bnh ca 1 em hc sinh v cho bit xp loi hc tp ca e hc sinh . Kt qu
xp loi c quy c nh sau:
+ Gii: im trung bnh8.0; + Kh: 6.5 im trung bnh<8.0
+ Trung bnh: 5.0 im trung bnh<6.5; + Yu: 3.5 im trung bnh<5.0
+ Km: 0im trung bnh<3.5
9. Nhp vo 1 thng v cho bit thng c bao nhiu ngy (gi s thng nhp vo khng phi l ca
nm nhun)

GV: Lu Hai Phong

Page 9

IV. CU LNH LP
1. Cu lnh FORDO
a. C php
+ Dng lp tin: FOR <Bin m>:=<Gi tr u> TO <Gi tr cui> DO <Cu lnh>;
+ Dng lp li: FOR <Bin m>:=<Gi tr cui> DOWNTO <Gi tr u> DO <Cu lnh>;
b. Gii thch:
- FOR, TO, DOWNTO, DO l t kha (tn dnh ring)
- <Bin m> c kiu d liu nguyn, k t, logic.
- <Gi tr u>, <Gi tr cui> c cng kiu d liu vi Bin m
- <Cu lnh> l mt Cu lnh trong Pascal
c. Hoat ng cua cu lnh FOR DO
+ ngha
- Dang lp tin: Cu lnh c vit sau t khoa DO c thc hin tun t vi <Bin m> ln lt
gia tri tng t <Gia tri u> n <Gia tri cui>
- dang lp lui: Cu lnh vit sau t khoa DO c thc hin tun t vi <Bin m> ln lt giam
t <Gia tri cui> xung <Gia tri u>
- Ch : Gi tr u<Gi tr cui.
Cu lnh FORDO l dng lp vi s ln xc nh t trc
+ Lit k tng bc
- Dng lp tin
B1: Bin mGi tr u
B2: Nu Bin m>Gi tr cui th Thot khi
vng lp
B3: Thc hin <Cu lnh>
B4: Bin mBin m+1. Quay li B2

Dng lp li
B1: Bin mGi tr cui
B2: Nu Bin m<Gi tr u th thot khi
vng lp
B3: Thc hin <Cu lnh>
B4: Bin mBin m-1. Quay li B2

d. V d
+ Bi ton: Tnh tng 1+2++(N-1)+N
Dng lp tin
VAR i,tong,N:Integer;
BEGIN
Write(Nhap N: );Readln(N);
Tong:=0;
FOR i:=1 TO N DO
Tong:=Tong+i;
Write(Tong= ,Tong);
END.

Dng lp li
VAR i,tong,N:Integer;
BEGIN
Write(Nhap N: );Readln(N);
Tong:=0;
FOR i:=N DOWNTO 1 DO
Tong:=Tong+i;
Write(Tong= ,Tong);
END.

+ S ln lp li l N ln

GV: Lu Hai Phong

Page 10

2. Cu lnh WHILE..DO
a. C php: WHILE <iu kin> DO <Cu lnh>;
+ WHILE, DO l t kha
+ <iu kin> l biu thc quan h hoc biu thc logic
+ <Cu lnh> l mt cu lnh trong Pascal
b. Hot ng
+ <Cu lnh> ch c thc hin khi <iu kin> cho gi tr TRUE
+ S khi:

c. V d
1
1
1
1
+ Bi ton 1: Tinh va a kt qua ra man hinh tng: S = +
+
++
+
a+N
a a +1 a + 2
1
Cho n khi
<0.0001
a+N
PROGRAM Tong_WHILE_DO;
VAR i:integer;
a,tong:real;
BEGIN
Write('Nhap a: ');readln(a);
tong:=0; i:=0;
WHILE 1/(a+i)>=0.0001 DO
BEGIN
tong:=tong+1/(a+i);
i:=i+1;
END;
Write(tong:0:2);
END.
+ Bi ton 2: Tnh tng ca dy s 1+2+3+(N-1)+N vi N l s nguyn dng nhp vo t bn
phm
Lp tin
Lp li
PROGRAM Tong_WHILE_DO;
PROGRAM Tong_WHILE_DO;
VAR i,N,tong:integer;
VAR i,N,tong:integer;
BEGIN
BEGIN
Write('Nhap N: ');readln(N);
Write('Nhap N: ');readln(N);
tong:=0; i:=1;
tong:=0; i:=N;
WHILE i<=N DO
WHILE i>0 DO
BEGIN
BEGIN
tong:=tong+i;
tong:=tong+i;
i:=i+1;
i:=i-1;
END;
END;
Writeln(tong);
Writeln(tong);
END.
END.

GV: Lu Hai Phong

Page 11

3. Cu lnh lp REPEATUNTIL
a. C php: REPEAT <Cu lnh> UNTIL <iu kin>;
+ REPEAT, UNTIL l t kha
+ <Cu lnh> l mt cu lnh trong Pascal
+ <iu kin> l mt biu thc logic hoc biu thc quan h
b. Hot ng
+ Thc hin <Cu lnh> trc ri thc hin kim tra <iu kin>, nu <iu kin> cho gi tr
FALSE th lp li qu trnh trn, ngc li nu <iu kin> cho gi tr TRUE th thot khi vng lp.
+ S khi
Cu lnh

Sai

iu
kin

ung

c. V d
1
1
1
1
+ Bi ton 1: Tinh va a kt qua ra man hinh tng: S = +
+
++
+
a+N
a a +1 a + 2
Cho n khi

1
<0.0001
a+N
PROGRAM Tong_REPEAT;
VAR i:integer;
a,tong:real;
BEGIN
Write('Nhap a: ');readln(a);
tong:=0; i:=0;
REPEAT
Tong:=Tong+1/(a+i);
i:=i+1;
UNTIL (1/(a+i-1)<0.0001);
Writeln(tong:0:2);
END.

4. Nhn xt
+ Cu trc lp khng xc nh (WHILE...DO v REPEATUNTIL) c th thay th cho cu trc lp
xc nh (FORDO) trong mi trng hp
+ Trong cu lnh REPEATUNTIL t nht c 1 ln lp, i vi WHILEDO l 0
+ <iu kin> trong REPEATUNTIL l ph nh ca <iu kin> trong WHILEDO
+ Trong cu lnh WHILEDO, thng c nhiu <cu lnh> c thc hin nn ta phi t cc <Cu
lnh> trong BEGINEND; cn trong REPEATUNTIL th khng cn thit, n t ng xem cc cu
lnh sau REPEAT l 1 cu lnh ghp
+ Trong cu lnh WHILEDO, qu trnh lp li c thc hin khi <iu kin> cho gi tr TRUE.
Ngc li trong REPEATUNTIL qu trnh lp li khi <iu kin> cho gi tr FALSE.
+ Trong <Cu lnh> ca cc cu lnh lp khng xc nh phi c yu t tc ng n <iu kin>,
nu khng s dn n tnh trng lp v hn. Khi chng trnh b lp v hn ta nhn t hp phm
CTRL+BREAK
GV: Lu Hai Phong

Page 12

5. Bi tp
1
1
1
1
1
+
+
... +
+
vi N nhp t bn phm
a a +1 a + 2
N 1 N
1 2 3
N 1
N
+
Bi 2. Tnh tng S = + + ... +
vi N nhp t bn phm
2 3 4
N
N +1
1 1
1
1
+ ... Cho n khi
Bi 3. Tnh tng S = + + ... +
<2x10-6
1! 2!
N!
N!
Bi 4. Nhp vo t bn phm tui ca cha v con (Tui cha hn tui con t nht l 25). Hi bao nhiu
nm na th tui cha gp i tui con
Bi 5. Mt ngi gi tit kim vi s tin A ng vi li sut t% mi thng. Hi sau bao nhiu thng,
ngi rt tin th nhn c t nht B ng? Bit rng tin li c cng vo vn sau mi thng
Bi 6. Tm c chung ln nht ca hai s M v N
Bi 7. Vit chng trnh kim tra tnh nguyn t ca mt s nguyn dng
Bi 8. Phn tch mt s nguyn dng thnh tha s nguyn t. V d 120=2*2*2*3*5;
Bi 9. Nhp vo mt s nguyn v in ra mn hnh s theo th t ngc li. V d vi s 123405 th
in ra mn hnh 504321
Bi 10. Nhp vo mt s nguyn dng N, hy tm tt c cc s x, y, z sao cho tha mn cc iu kin
sau: x+y+z=N; x mod 3=0; y mod 4=0; z mod 5=0; (x,y,z0)
Bi 11. Vi hai ch s x v t, khong cch ca chng c nh ngha l s nguyn khng m nh
nht d(x,y) m khi cng thm d(x,y) vo mt ch s no trong hai ch s x,y th kt qu nhn c
l mt s nguyn c ch s hng n v trng vi ch s cn li. V d: d(2,5)=3 v 2+3=5, d(5,1)=4
v 1+4=5, cn d(1,9)=2 v 9+2 = 11.
Vi hai s nguyn dng X v Y c cng s lng ch s, khong cch d(X,Y) gia hai s X v Y l
tng khong cch gia cc cp ch s cng hng tng ng.
V d d(213,419)=d(2,4) + d(1,1) + d(3,9) = 2 + 0 + 4 = 6.
Yu cu: Cho hai s X v Y c cng lng ch s N, hy tm khong cch d(X,Y).
Bi 1. Tnh tng S =

Bi 12. Hai s t nhin c gi l Nguyn t tng ng nu chng c chung cc c s nguyn

t. V d cc s 75 v 15 l nguyn t tng ng v cng c cc c nguyn t l 3 v 5. Cho trc
hai s t nhin N, M. Hy vit chng trnh kim tra xem cc s ny c l nguyn t tng ng vi
nhau hay khng.
Bi 13: Cho s nguyn N. Hy tm s nguyn M l nh nht sao cho tng cc ch s ca M bng N
V d N=16 th M =79
Bi 14: Cho s nguyn N. Hy tm dy cc s nguyn dng lin tip nhau sao cho tng ca chng
bng N (in ra tt c cc trng hp)
V d: N=21
21=10+11
21=6+7+8
21=1+2+3+4+5+6
p dng cng thc tnh tng ca dy cp s cng c cng sai d
2*Sn=N(2*A1+(N-1)*d), trong bi ny d=1 nn ta c
2*Sn=N(2*A1+N-1)
Vi vi mi N ta s tm c A1 (iu kin A1 v N nguyn)

Bi 15: Vit chng trnh tm tt c cc s t nhin c 3 ch s sao cho sau khi vit s theo
th t ngc li th ta thu c 1 s nguyn t cng nhau vi s cho. Bit rng 2 s c gi
l nguyn t cng nhau khi c chung ln nht ca chng bng 1.
V d: 710 th s o ca n l 017, hai s ny l nguyn t cng nhau v c chung ln nht
ca chng bng 1

GV: Lu Hai Phong

Page 13

V. MNG MT CHIU
1. Khi nim
Mng mt chiu l dy hu hn cc phn t cng kiu. Mng c t tn v mi phn t ca n c
mt ch s. m t mng mt chiu cn xc nh kiu ca cc phn t v cch nh s cc phn t
ca n.
V d: Cho dy A gm 8 s 1, 4, 5, 3, 6, 7, 10, 5, cc s c nh s th t t 1 n 8, lc ny ta c
th khai bo 1 mng A gm c 8 phn t lu tr gi tr ca 8 s ny.
+ Ta c mng A nh sau:
Gi tr

10 5

S th t

+ Trong mng A trn c:

- Tn mng: A
- S lng phn t: 8
- Kiu d liu: S nguyn
Ngoi ra trong mng 1 chiu cc ngn ng lp trnh cn cho php xc nh cch khai bo mng, cc
tham chiu n cc phn t trong mng.
2. C php
C hai cch khai bo mng
+ Khai bo trc tip
VAR <Tn bin mng> :ARRAY[<Kiu ch s>] OF <Kiu phn t>;
+ Khai bo gin tip
TYPE <Tn kiu mng> =ARRAY[<Kiu ch s]> OF <Kiu phn t>;
VAR <Tn bin mng>:<Tn kiu mng>;
+ Gii thch
- VAR, TYPE, ARRAY, OF l cc t kha
- <Tn bin mng>, <Tn kiu mng>: Do ngi dng t theo quy tc ca Pascal
- <Kiu ch s> l mt on s nguyn lin tc t N1 n N2 vi N2N1. N1 v N2 cng c th l
kiu k t hoc kiu logic
- <Kiu phn t>: l kiu d liu ca cc phn t, ta c th dng tt c cc kiu d liu trong Pascal
dng lm <Kiu d liu>
- Chu y: T khoa TYPE dung inh nghia kiu d liu
+ Vi du:
- Vi mang A nh trn ta co th khai bao nh sau:
VAR A:ARRAY[1..8] OF Integer;
- Khai bao mang B co 26 phn t, <Kiu chi s> la cac ky t t A n Z, <Kiu phn t> la s
nguyn:
VAR B:ARRAY[A..Z] OF Integer;
- Khai bao mang C co <Kiu chi s> la cac s nguyn, <Kiu phn t> la s thc
VAR C:ARRAY[-100100] OF Integer;
- Khai bao mang D co <Kiu phn t> la kiu mang 1 chiu
VAR D:ARRAY[1..100] OF ARRAY[1..100] OF Integer;
3. Cach tham chiu n phn t cua mang 1 chiu
GV: Lu Hai Phong

Page 14

+ Tham chiu n phn t mang 1 chiu c xac inh bng Tn bin mang va chi s t trong cp
du ngoc [ va ]
+ Vi du:
- Cho khai bao VAR A:ARRAY[1..100] OF Integer; Tham chiu n phn t th 4 trong mang ta vit
A[4].
- Cho khai bao VAR A:ARRAY[a..z] OF Integer; Tham chiu n phn t th 4 trong mang ta
vit A[d].
4. Mt s vi du
a. Nhp va in d liu cho mang 1 chiu co N phn t
VAR A:ARRAY[1..100] OF Integer;
N, i:Integer;
BEGIN
Write(Nhap N: ); Readln(N); {N lasl
ng ph
n tcu
a
ma
ng}
{Nh
p dliu}
FOR i:=1 TO N
DO
BEGIN
Write(Nhap A[,i,]= ); Readln(A[i]);
END;
{Xu
t dli
u}
FOR i:=1 TO N DO Write(A[i]:3);
END.
b. Tim gia tri ln nht cua day s (Day s c lu tr bng mang 1 chiu)
VAR A:ARRAY[1..100] OF Integer;
N, i, max:Integer;
BEGIN
Write(Nhap N: ); Readln(N); {N lasl
ng ph
n tcu
a
ma
ng}
{Nh
p dliu}
FOR i:=1 TO N
DO
BEGIN
Write(Nhap A[,i,]= ); Readln(A[i]);
END;
{Ti
m max}
Max:=A[1];
FOR i:=2 TO N DO
IF A[i]> Max THEN Max:=A[i];
Write(Gia tri lon nhat: ,Max);
END.
c. Tinh tng cua mt day s (Day s c lu bng mang mt chiu)
VAR A:ARRAY[1..100] OF Integer;
N, i, Tong:Integer;
BEGIN
Write(Nhap N: ); Readln(N); {N lasl
ng ph
n tcu
a
ma
ng}
FOR i:=1 TO N DO
BEGIN
Write(Nhap A[,i,]= ); Readln(A[i]);
END;
Tong:=0;
FOR i:=1 TO N DO Tong:=Tong+A[i];
Write(Tong cua day so: ,Tong);
END.
GV: Lu Hai Phong

Page 15

5. Bi tp
Bi 1: Vit chng trinh nhp vao mt day s A co N phn t va thc hin cac cng vic sau
a. In ra man hinh vi tri cua gia tri nho nht trong day s
Vi du vi day 6 phn t 8, 4, 10, 3, 1, 9 thi kt qua in ra man hinh la 5 do A[5]=1 la gia tri nho nht
b. In ra man hinh tng cua cac phn t chia ht cho K (K nhp t ban phim)
c. Co bao nhiu s chn, bao nhiu s le
d. In ra man hinh tt ca cac s nguyn t trong day s
e. Sp xp day s theo th t tng dn v gia tri
f. Tim s m co gia tri ln nht trong day
g. Tim s dng co gia tri nho nht trong day
h. Xoa k phn t trong day bt u t vi tri Vt (K va Vt nhp t ban phim)
i. Tao mt mang B co M phn t (MN) ma gia tri cua mang c ly t day s A t vi tri Vt. Th t
cua cac s khng thay i khi a t A sang B
j. Chen mt s nguyn K vao vi tri vt cua day A (K va v tr nhp t ban phim)
Bi 2: Phn lp (10 im)
Gi S(x) l s c ca s nguyn dng x. Hai s nguyn dng x v y c gi l hai s cng lp k
nu S(x) = S(y) = k .
V d: S(6) = 4 v 6 c bn c l 1, 2, 3, v 6.
S(8) = 4
S(7) = 2
S(13) = 2
Nh vy, 6 v 8 l hai s thuc lp 4 ;
7 v 13 l hai s thuc lp 2.
Cho N s nguyn dng a1, a2, ..., aN. Hy cho bit:
+ Cc s cho c chia thnh bao nhiu lp khc nhau.
+ S lng phn t trong mi lp l bao nhiu?
Bi 3: Cho dy s nguyn A1, A2,,AN gm N phn t v mt s nguyn Z. Vit chng trnh tm
ra mt phn t Ai sao cho |Ai-Z| l nh nht, s Ai c gi l s gn Z nht. Vi Z, N c nhp
t bn phm cn cc s Ai c sinh ngu nhin
V d: Cho dy 5 -3 7 12 -2 9
Vi Z=8 th chng trnh xut kt qu: 9 l phn t gn 8 nht
Vi Z=-8 th chng trnh xut kt qu: -3 l phn t gn Z nht

VI. KIU MANG 2 CHIU

1. Khai nim
- Mang 2 chiu la bang (gm cac dong va ct) cac phn t cung kiu. Nh vy ta co xem mi dong
hoc mi ct cua mang hai chiu la mang 1 chiu
2. Cu phap
+ Khai bao trc tip
VAR <Tn bin mang>:ARRAY[<Kiu chi s hang>,<Kiu chi s ct>] OF <Kiu phn t>;
+ Khai bao gian tip bin mang qua kiu mang hai chiu
TYPE <Tn kiu mang>= ARRAY[<Kiu chi s hang>,<Kiu chi s ct>] OF <Kiu phn t>;
VAR <Tn bin mang>:<Tn kiu mang>;
+ Vi du:
VAR A:ARRAY[1..100,1..100] OF Integer;
GV: Lu Hai Phong

Page 16

TYPE Mang2d=ARRAY[1..100,1..100] OF Real;

VAR A:Mang2d;
3. Cach tham chiu n phn t cua mang 2 chiu
+ Tham chiu n phn t cua mang hai chiu c xac inh bi tn mang cung vi hai chi s c
phn cach bi du phy va t trong cp ngoc [ va ].
+ Vi du:
- tham chiu n phn t hang 5, ct 3 cua mang co tn la A ta vit A[3,5]
- in gia tri nay ra man hinh ta vit Write(A[3,5]); hoc Writeln(A[3,5]);
- Gia tri A[3,5] cung co th dung trong cac biu thc S:=S+A[3,5];
- Hai chi s co th la bin co th la hng. Vi hai bin i va j tng ng co kiu d liu cung vi <Kiu
chi s> ta co tham chiu n phn t dong i ct j: A[i,j]
4. Mt s vi du
a. Nhp va in gia tri cho mang hai chiu
VAR A:ARRAY[1..100,1..100] OF INTEGER;
N, M, i, j:Integer;
BEGIN
{Nh
p ma
ng hai chi
u}
Write('Nhap N, M: ');Readln(N,M);
FOR i:=1 to N DO
FOR j:=1 TO M DO
BEGIN
Write('Nhap A[',i,',',j,']= ');
Readln(A[i,j]);
END;
{In ma
ng hai chi
u ra ma
n hi
nh}
FOR i:=1 TO N DO
BEGIN
FOR j:=1 TO M DO Write(A[i,j]);
Writeln;
END;
END.
b. Tinh tng cua cac phn t trong bang s (Bang s c lu trong mang hai chiu)
VAR A:ARRAY[1..100,1..100] OF INTEGER;
N, M, i, j, tong:Integer;
BEGIN
{Nh
p dli
u}
Write('Nhap N: ');Readln(N);
Write('Nhap M: ');Readln(M);
FOR i:=1 to N DO
FOR j:=1 TO M DO
BEGIN
Write('Nhap A[',i,',',j,']= ');
Readln(A[i,j]);
END;
{Ti
nh t
ng}
Tong:=0;
FOR i:=1 TO N DO
FOR j:=1 TO M DO Tong:=Tong+A[i,j];
Write('Tong cua bang so: ',tong);
END.
GV: Lu Hai Phong

Page 17

5. Bi tp
Bi 1. Cho mang hai chiu gm N dong va N ct, mi phn t la 1 s nguyn. Thc hin cac yu
cu sau:
a. Tinh tng cac phn t trong mang
b. Tinh tng cac phn t nm phia trn ng cheo chinh. (ng cheo chinh la ng cheo cha cac
phn t co toa dong bng toa ct)
HD: Chi tinh tng cac phn t co chi s ct ln hn chi s dong
c. im yn nga la im ma gia tri cua no ln nht trn dong va nho nht trn ct. Yu cu tim va
in ra man hinh tt ca cac im yn nga trn mang. Trng hp khng co thi in ra man hinh
KHONG CO
Bi 2. Tao bang
Cho mt bng A gm N x N s nguyn (N 100), cc dng c nh s t trn xung di bt u
t 1, cc ct c nh s t tri qua phi cng bt u t 1. Mi s trong bng c gi tr tuyt i
khng vt qu 30000. Bng B c to ra t bng A theo qui tc sau:
Phn t ca B nm dng i, ct j c gi tr bng tng ca cc s nm trong (i,j) v cc k
n trong bng A: Bij = Aij+A(i+1)j+A(i-1)j+Ai(j+1)+Ai(j-1)
Ch : Cc phn t nm ngoi bng c xem nh c gi tr bng 0.
Bi 3. Tng ln nht
Cho mt bng A gm N x N s nguyn (N 100), cc dng c nh s trn xung di bt u t
1, cc ct c nh s t tri qua phi cng bt u t 1. Mi s trong bng c gi tr tuyt i khng
vt qu 10000. ng cho chnh ca bng l ng thng ni hai (1,1) v (N,N). Nh vy trn
bng c 2N-1 ung cho song song vi ng cho chnh.
Bi ton: Hy tm ng cho song song vi ng cho chnh c tng cc phn t trn ng cho
l ln nht.
ng cho

GV: Lu Hai Phong

Page 18

VII. KIU XU
- Xu l dy cc k t trong b m ASCII
- Mi k t c gi l mt phn t ca xu
- S lng k t trong xu c gi l di ca xu
- Xu c di bng 0 gi l xu rng
- C th xem xu l mng mt chiu m mi phn t l mt k t, cc k t c nh s th t v
bt u bng 1
- Tham chiu n phn t ca xu c xc nh bi tn bin v ch s c t trong cp ngoc
vung [ v ]
1. Khai bo xu
C php: VAR <Tn bin>: STRING [ di ln nht ca xu];
- VAR, STRING: T kha
- Tn bin: t t theo qui tc Pascal
- di ln nht ca xu l mt hng s dng khng qu 255
+ Khi khai bo c th b qua di ln nht ca xu VAR <Tn bin>:STRING;
Lc di ln nht ca xu s c ngm nh gi tr l 255
2. Cc thao tc x l xu
a. Php ghp xu:
- K hiu: du cng (+)
- ngha: Dng ghp nhiu xu thnh 1
- V d: hoc+ sinh hoc sinh
b. Cc php so snh
+ Php bng (=), ln hn (>), nh hn (<), ln hn hoc bng (>=), nh hn hoc bng (<=)
+ Xu A>B nu k t u tin khc nhau gia chng trong xu A c m ASCII ln hn
+ Nu A v B l xu c di khc nhau v A l on u ca B th A < B
+ Hai xu bng nhau khi chng ging nhau hon ton
3. Mt s hm v th tc chun
a. Hm COPY(S,Vt,N) To xu gm N k t lin tip bt u t v tr Vt ca xu S
- S, Vt, N c th l bin hoc hng
- V d: St:=COPY(Niem_vui_,6,3);
St= vui
b. Hm Length(S) cho gi tr l di xu S
- S c th l hng hoc bin xu
- V d: a:=Length(do_dai_bang_3);
a = 13
c. Hm POS(S1,S2) tr v v tr xut hin u tin ca xu S1 trong xu S2
- S1 v S2 c th l bin hoc hng
- V d: a:=POS(ab,acabcab);
a=3
d. Hm UPCASE(ch) cho ch ci in hoa ng vi ch ci trong ch
- Ch l mt k t
- V d: ch:=UPCASE(a);
ch= A

GV: Lu Hai Phong

Page 19

e. Th tc STR(value, st): Th tc ny thc hin vic chuyn i gi tr kiu s(value) sang dng
xu k t v gn cho binst.
V d: n l mt s nguyn c gi tr: n:=150;
STR(n,st) s cho kt qu xu st l: st=150;
f. Th tc VAL(st, value,code) i mt xu k t st sang dng s v gn cho bin value, nu bin
i thnh cng th code s nhn gi tr bng 0. ngc li th cho gi tr khc khng
V d: VAL(123,value,code) lc ny code s nhn gi tr bng 0 v value=123
g. Th tc DELETE(St,Vt,n) thc hin xa n k t trong xu St bt u t v tr Vt
- St l bin xu, Vt v N c th l bin hoc hng
- V d: St= Khoa Hoc
DELETE(St,3,5); St=Khoc
h. Th tc INSERT(S1, S2, Vt) thc hin vic chn xu S1 bt u vo v tr Vt
- S1 c th l bin hoc hng xu
- S2 l bin xu
- Vt c th l bin hoc hng s nguyn dng
- V d: S2= Kham_pha
INSERT(_xong,S2,5);
S2= Kham_xong_pha
4. Mt s vi du
Vi du 1: Nhp vao t ban phim ho va tn cua hai ngi va cho bit tn cua ngi nao dai hn
HD: S dung ham LENGTH(St) ly dai tn cua hai ngi
Chng trinh
VAR a,b:String;
BEGIN
Write('Nhap ten nguoi 1: ');
Readln(a);
Write('Nhap ten nguoi 2: ');
Readln(b);
IF LENGTH(a)>LENGTH(b)
THEN write(a)ELSE write(b);
readln;
END
Vi du 2: Nhp vao t ban phim 1 xu ri in ra man hinh xu o theo th t ngc lai
HD: In ln lt tng ky t cua xu ra man hinh t cui v u xu
Chng trinh
VAR i,k: Byte;
a: String;
BEGIN
Write(Nhap xau:);
readln(a);
k:=Length(a);
FOR i:=k DOWNTO 1 DO
write(a[i]);
Readln;
END.
GV: Lu Hai Phong

Page 20

Vi du 3: Nhp vao t ban phim 1 xu va in ra man hinh sau khi a loai bo tt ca cac ky t trng
HD: Duyt t u n cui xu, nu gp ky t trng thi thc hin xoa ky t trng o trong xu
Chng trinh
VAR st:string;
BEGIN
Write('Nhap Xau: ');Readln(St);
WHILE pos(' ',st)<>0 DO delete(St,pos(' ',st),1);
write(st);
END.
5. Bi tp
Bi 1: Nhp vo 1 xu t bn phm v cho bit c phi l xu i xng hay khng? (Xu i xng
khng thay i khi ta vit ngc n)
V d: ABBBA , 123S321 l cc xu i xng
Bi 2: Nhp vo t bn phm 1 xu v in ra mn hnh sau khi xa b cc k t trng d tha
Cc k t trng d tha khi: k t trng ng u xu, ng cui xu, nu c 2 k t trng ng lin
tip trong xu th c 1 k t trng d tha
Bi 3: Nhp vo t bn phm 1 xu sau sp xp li xu theo th t tng dn ca m ASCII cc k
t trong xu
Bi 4: Nhp vo mt xu t bn phm v thay th tt c cc cm k t anh bng cm k t em
Bi 5: Nhp vo h v tn y ca mt ngi v in ra mn hnh tn ca ngi
Bi 6: Nhp t bn phm mt xu hy cho bit s ln xut hin ca mi ch ci ting anh trong xu
. khng phn bit ch hoa hay ch thng
Bi 7: Nhp vo t bn phm 1 xu k t ri in ra mn hnh cc t ca xu theo th t ngc li.
V d xu St= mot hai ba ta cung hat th kt qu in ra mn hnh l hat cung ta ba hai mot. Bit
rng hai t c cch nhau bi mt du cch
Bi 8: Nhp vo t bn phm 1 xu ri cho bit s lng t trong xu
Bi 9: Mt cm trong mt biu thc ton hc l on nm gia hai du ng v du m ngoc n.
Vi mi biu thc cho trc hy tch cc cm ca biu thc .
V d vi biu thc a*(x+1)*((b+2)/(y-3)) ta tch c thnh cc biu thc (x+1); (b+2); (y-3); ((b+2)/
(y-3))
Bi 10: Cho xu S c khng qu 250 k t. Hy tm cch nn S sao cho nu c nhiu k t lin tip
ging nhau th thay bng 1 s nguyn v tip theo l k t . V d S=AAAABCCC th kt qu sau
khi nn l S=4AB3C;
Yu cu: Cho xu S hy in ra mn hnh sau khi nn xu S
Bi 11: Nam lm c mt chui t nhng vin mu m cu su tp c. Cc vin ca
Nam c mu xanh, hoc vng, c k hiu tng ng l G, R, Y. Theo Nam mt chui p
phi c c 3 mu trn v s lng cc vin mi mu phi bng nhau.
Yu cu: Cho xu S c di khng qu 250 ch bao gm cc k t G, R, Y, mi k t tng trng
cho mt vin ca Nam. Hy cho bit chui ca Nam c phi l chui p hay khng?
V d: S= RRGGYRYG => YES
S= RGRGY => NO
Bi 12: Cho xu S ch bao gm cc k t la tinh thng vi di ti a 255 k t. Hy vit chng
trnh to xu T bng cch xa cc k t lin tip ging nhau trong xu S v ch li 1 k t i din
trong on .
V d:
Cho S= hhoooooocccsiiiiiinhhhhh => T= hocsinh
GV: Lu Hai Phong

Page 21

Bi 13: Sa xu
Hy vit chng trnh nhp vo t bn phm mt xu k t, trong , nu tnh t tri sang phi th k
t # l du hiu xo i mt k ng ngay trc n nu c. Sau in ra mn hnh xu sa cha theo
ng qui nh.
V d:
Ta#oi thi hoc sinua#h###nh gioi tin hoj#c c ngha l Toi thi hoc sinh gioi tin hoc
D liu : Vo t bn phm xu cn sa.
Kt qu: In ra mn hnh xu sa.

GV: Lu Hai Phong

Page 22

VIII. KIU BN GHI

Kiu d liu bn ghi (Record) dng m t cc i tng c cng mt s thuc tnh m cc thuc
tnh c th c cc kiu d liu khc nhau.
Trong kiu bn ghi cc ngn ng lp trnh a ra quy tc, cch thc xc nh:

Tn kiu bn ghi

Tn cc thuc tnh (trng)

Kiu d liu ca mi trng

Cch khai bo bin

Cch tham chiu n trng

1. Khai bo
+ nh ngha kiu bn ghi
TYPE<Tn kiu bn ghi>=RECORD
<Tn trng 1>:<Kiu trng 1>;
.
<Tn trng k>:<Kiu trng k>;
END;
+ Khai bo bin bn ghi
VAR<Tn bin bn ghi>:<Tn kiu bn ghi>;
+ V d: lu tr thng tin ca mt hc sinh c cc thng tin v h tn, ngy sinh, gii tnh, im
ton, im l, im ha ta thc hin nh ngha v khai bo bin bn ghi nh sau:
TYPE Hoc_Sinh=RECORD
Ho_ten, N_sinh:String[30]
G_tinh:Boolean;
DT, DL,DH:real;
END;
VAR A,B:Hoc_Sinh;
C:Array[1..100] of Hoc_Sinh;
+ Tham chiu n trng ca bn ghi:
Nu A l bin kiu bn ghi v X l tn mt trng ca A, tham chiu n trng X, ta vit A.X
V d:
+ tham chiu n h v tn ca hc sinh A ta bit: A.ho_ten
+ tham chiu n im mn ton ca hc sinh th 10 trong lp ta vit: C[10].DT
2. Gn gi tr
+ Dng lnh gn trc tip: Nu A v B l hai bin kiu bn ghi cng kiu th ta c th gn gi tr
ca B cho A bng lnh B:=A;
+ Gn gi tr cho tng trng: V d ta c th gn A.Ho_ten:=B.Ho_ten;
+ Nhp gi tr t bn phm cho tng trng:
V d: Readln(A.DT);
3. Cu lnh WITH DO
Khi lm vic vi nhiu trng ca mt bin bn ghi, vic tham chiu n tng trng phi thng qua
tn bin nn phi vit li tn bin nhiu ln. gii quyt vn ny ta dng cu lnh WITH DO
C php: WITH <Tn bin bn ghi> DO <Cu lnh>;
Gii thch:
+ WITH, DO: T kha
GV: Lu Hai Phong

Page 23

+ <Tn bin bn ghi>: tn bin c khai bo

+ <Cu lnh>: Mt cu lnh trong Pascal c s dng tham chiu n trng trong <Tn bin bn
ghi>
V d: Cho khai bo
TYPE Hoc_Sinh=RECORD
Ho_ten, N_sinh:String[30]
G_tinh:Boolean;
DT, DL,DH:real;
END;
VAR C:Array[1..100] OF Hoc_Sinh;
n,i:integer;
on chng trnh sau s dng cu lnh WITH DO tham chiu n trng ca bin bn ghi
BEGIN
Write('Nhap so luong hoc sinh: ');Readln(N);
FOR i:=1 TO N DO
WITH C[i] DO
BEGIN
Write('Ho ten hoc sinh ',i,' '); readln(ho_ten);
Write('Ngay sinh hoc sinh ',i,' '); readln(N_Sinh);
Write('Diem Toan, Ly, Hoa ',i,' '); readln(DT,DL,DH);
END;
END.
4. V d:
im tng kt cui nm hc ca hc sinh lp khi 11 gm c cc ct: h tn, ngy sinh, im trung
bnh (TB), hc lc, hc bng.
Yu cu:
1. Nhp thng tin v h tn, ngy sinh, TB ca hc sinh trong 1 lp (ti a 50 hc sinh)
2. Da vo TB hy cho bit hc lc ca hc sinh. Cch xp loi nh sau:
+ Loi GIOI nu 8TB.
+ Loi KHA nu 6.5TB<8.0,
+ Loi TB nu 5.0TB<6.5.
+ Loi YEU nu 3.0TB<5.
+ Cn li l loi KEM
3. Nh trng s ly 5 hc sinh c TB cao nht trao hc bng. Nhng hc sinh no c hc bng
th gi tr trng hc bng l YES ngc li l NO
4. Sp xp danh sch hc sinh theo tn
5. Sau khi thc hin cc yu cu trn, in danh sch ton b hc sinh ra mn hnh vi th t nh sau:
H v tn, ngy sinh, im trung bnh, hc lc, hc bng
USES CRT;
TYPE HOCSINH=RECORD
Hoten,NS,HL,HB:String;
DTB:Real;
END;
VAR HS:ARRAY[1..50] OF Hocsinh;
A:HocSinh;
n,i,k,j,dem:integer;
ten1,ten2:string;
BEGIN
CLRSCR;
GV: Lu Hai Phong

Page 24

{=========NHAP DU LIEU===========}
Write('Nhap so luong hoc sinh: ');
Readln(n);
Writeln('Nhap Thong tin cho hoc sinh: ');
FOR i:=1 TO N DO
BEGIN
Writeln('Hoc Sinh Thu ',i);
Write('
Ho va Ten: ');Readln(HS[i].Hoten);
Write('
Ngay Sinh: ');Readln(HS[i].NS);
Write('
Diem Trung Binh: ');Readln(HS[i].DTB);
Writeln('-----------------');
END;
{==========SAP XEP=============}
FOR i:=1 TO N-1 DO
FOR j:=i+1 TO N DO
BEGIN
Ten1:='';
k:=length(HS[i].Hoten);
WHILE HS[i].hoten[k]<>' ' DO
BEGIN
ten1:=HS[i].hoten[k]+ten1;
k:=k-1;
END;
Ten2:='';
k:=length(HS[j].Hoten);
WHILE HS[j].hoten[k]<>' ' DO
BEGIN
ten2:=HS[j].hoten[k]+ten2;
k:=k-1;
END;
IF ten1>ten2 THEN
BEGIN
A:=HS[i];HS[i]:=HS[j];HS[j]:=A;
END;
END;
{============HOC LUC================}
FOR i:= 1 TO N DO
IF HS[i].DTB>=8 THEN HS[i].HL:='GIOI'
ELSE IF HS[i].DTB>=6.5 THEN HS[i].HL:='KHA'
ELSE IF HS[i].DTB>=5 THEN HS[i].HL:='TB'
ELSE IF HS[i].DTB>=3.5 THEN HS[i].HL:='YEU'
ELSE HS[i].HL:='KEM';
{=============HOC BONG==============}
FOR i:=1 TO N DO
BEGIN
dem:=N;
FOR j:=1 TO N DO
IF HS[i].DTB>HS[j].DTB THEN dem:=dem-1;
IF dem<=5 THEN HS[i].hb:='YES' ELSE HS[i].HB:='NO';
END;
{=========XUAT DU LIEU==============}
WRITELN('|-------HO VA TEN-------|--NGAY SINH--|--DIEM
TB--|--HOC LUC--|--HOC BONG--|');
WRITELN('---------------------------------------------------------------------------');
FOR i:=1 TO n DO
GV: Lu Hai Phong

Page 25

BEGIN
WRITELN('|','|':24,'|':14,'|':12,'|':12,'|':13);
Write('| ',HS[i].hoten,'|':(23-length(HS[i].hoten)));
Write(' ',HS[i].NS,'|':(12-length(HS[i].NS)));
Write(' ',HS[i].DTB:5:2,'|':5);
Write('
',HS[i].HL,'|':(8-length(HS[i].HL)));
Write('
',HS[i].HB,'|':(9-length(HS[i].HB)));
writeln;
END;
WRITELN('---------------------------------------------------------------------------');
READLN;
END.
5. Bi tp
Bi 1: Mt cng ty cn qun l cc thng tin v H tn, ngy sinh, h s lng, chc v, ph cp,
lng ca cc nhn vin trong cng ty. Yu cu:
1. Nhp cc thng tin H tn, ngy sinh, h s lng, chc v ca N nhn vin
2. Thc hin tnh lng cho cc nhn vin trong mt thng
Bit rng:
+ Ph cp chc v c quy nh:
Gim c (GD): 3,000,000 ng
Ph gim c (PGD): 2,500,000 ng
Trng phng (TP): 2,000,000 ng
Ph phng (PP): 1,500,000 ng
Chc v khc (CVK): 1,000,000 ng
+ Lng=730000*h s lng+Ph cp chc v
+ 2.34H s lng8.0
3. Cng ty c u tin cho 5 nhn vin tr tui nht i hc nng cao trnh . Hy in ra mn hnh
danh sch cc nhn vin c i hc (y thng tin)
Bi 2: Phn s
Mt phn s gm 2 phn l t s v mu s. Nhp vo t bn phm 2 phn s bt k v thc hin cc
php tnh cng, tr, nhn, chia hai phn s

GV: Lu Hai Phong

Page 26

CH 6 KIU D LIU TP

GV: Lu Hai Phong

Page 27

CH 7 CHNG TRNH CON

GV: Lu Hai Phong

Page 28

CH 8: PHC TP CA THUT TON

BI TP

Phn tch thi gian thc hin ca cc on chng trnh sau:

Cu 1
Readln(n);
S:=0;
i:=1;
WHILE i<n DO
BEGIN
Readln(X);
S:= S + X;
Inc(i);
End;
M:= S/n;

Cu 2
j:=n;
d:=0;
REPEAT
j:=j div 2;
d:=d+1;
UNTIL j<1;

Writeln(M);
Cu 3.
FOR i := 1 TO n DO
FOR j := 1 TO n DO
BEGIN
c[i,j] := 0;
FOR k := 1 TO n DO
c[i,j] := c[i,j] + a[i,k] * b[k,j];
END;
Cu 4.
FOR i:=1 TO n DO
IF i mod 2 =0 THEN c:=c+1
ELSE c:=c+2;
Cu 5.
FOR i:=1 TO n DO
IF i mod 2 = 0 THEN
FOR j:=1 TO n DO c:=c+1;
Cu 6.
d:=0
FOR i:=1 TO n-2 DO
FOR j:=i+1 TO n-1 DO
FOR k:=j+1 TO n DO d:=d+1;

GV: Lu Hai Phong

Page 29