Th 3+5+7: 15h

HON V CH CI
Cho mt xu S ch gm cc ch ci in hoa, 1 <= di <= 9.
Yu cu: Lit k cc hon v theo th t t in
D liu vo: Gm 1 dng duy nht cha xu S
D liu ra:
+ Dng 1: Ghi s lng hon v tm c (K)
+ K dng tip theo, mi dng ghi mt xu hon v ca xu S theo ng th t t in
V d:
QBHV.INP
ABAB

QBHV.OUT
AABB
ABAB
ABBA
BAAB
BABA
BBAA

PHN TICH
Cho m t s nguyn dng N (N30) Hay phn tich N thnh tng ca cc s nguyn dng. Cc cch phn
tich l hon v ca nhau ch tinh l m t cch
D li u vao: t t p vn ban TONG.INP gm duy nht m t s N
D li u ra: ghi vo t p vn ban TONG.OUT gm nhiu dng mi dng l m t cch phn tich s N, cch
dng c sp xp theo chiu tng dn. Cc s trn m t dng c cch nhau 1 ky t trng
Vi du:
TONG.INP TONG.OUT
6
111111
11112
1113
1122
114
123
15
222
24
33
6
VNG TRN S NGUYN T
Mt vng trn cha n vng trn nh (n chn). Cc vng trn nh c nh s t 1 n n theo chiu kim
ng h. Cn in cc s t nhin t 1 n n vo cc
1 vng trn nh sao cho tng ca 2 s trn 2 vng trn nh
lin tip l s nguyn t. Vng trn 1 lun c ghi s 1.
4
Vi du: vi N=6 ta c 1 cch in nh6hnh v sau:
3

5
2

D liu: Vo t tp tin RING.INP cha s nguyn dng chn n (2 < n < 20).
Kt qu: Ghi vo tp tin vn ban RING.OUT, gm nhiu dng, mi dng l mt cch in, cc s trn mt
dng cch nhau bng 1 ky t trng
Vi du:
RING.INP
6

RING.OUT
143256
165234

RING.INP
8

RING.OUT
12385674
12583476
14765832
16743852

BI TON RT TIN T NG ATM

Mt my ATM hin c n (n20) t tin c gi tr t1, t2,,tN. Hay a ra mt cch tra li vi s tin ng bng S.
D liu vao: t tp vn ban ATM.INP
+ Dng u cha 2 s n v S
+ Dng th 2 gm n s t1, t2,,tn
Kt qu ra: ghi vo tp vn ban ATM.OUT c dng: Nu c th tra ng S th a ra cch tra, nu khng th
ghi -1.
Vi du:
ATM.INP
10 390
200 10 20 20 50 50 50 50 100 100

ATM.OUT
20 20 50 50 50 100 100

Bi ton ngi du lch

Cho N thnh ph c nh s t 1 n N v cc tuyn ng giao thng hai chiu gia chng, mng li giao
thng ny c cho bi mang C[1..n,1..n], y Cij=Cji l chi phi i on ng trc tip t thnh ph i n
thnh ph j.
Mt ngi du lch xut pht t thnh ph 1, mun i thm tt ca cc thnh ph

BI TP C BN V QUY
1.Tinh S(n) = 1 + 2 + 3 + ... + n - 1 + n
2.Tinh S(n) = 1^2 + 2^2 + 3^2 + ... + (n-1.^2 + n^2
3.Tinh S(n) = 1 + 1/2 + 1/3 + ... + 1/n
4.Tinh S(n) = 1/2 + 1/4 + ... + 1/2n
5.Tinh S(n) = 1 + 1/3 + 1/5 + ... + 1/(2n+1.
6.Tinh S(n) = 1/(1*2. + 1/(2*3. + 1/( n(*n-1. .
7.Tinh S(n) = 1/2 + 2/3 + 3/4 + ... + n/(n+1.
8.Tinh S(n) = 1/2 + 3/4 + 5/6 + ... + (2n+1./(2n+2.
9.Tinh T(n) = 1*2*3*.....*n
10.Tinh T(x,n) = x^n
11.Tinh S(n) = 1 + 1.2 + 1.2.3 + .... + 1.2.3....n
12.Tinh S(x,n) = x + x^2 + x^3 + ... + x^n
13.Tinh S(x,n) = x^2 + x^4 +.... + x^2n
14.Tinh S(x,n) = x + x^3 + x^5 +....+ x^(2n+1.
15.Tinh S(n) = 1 + 1/(1+2. + 1/(1+2+3. + ... + 1/(1+2+3+...+n)
16.Tinh S(x,n) = x + (x^2./2! + (x^3./3! + ... + (x^n)/n!
17.Tinh S(x,n) = 1 + (x^2./2! + (x^4./4! + ... + (x^2n)/(2n)!
18.Tm c s l ln nht ca s nguyn dng n . Vi d : n = 100 c l ln nht ca 100 l 25
19.Tinh S(n) = sqrt(2 + sqrt (2 + ... sqrt ( 2 + sqrt(2. . . .
20.Tinh S(n) = sqrt(n + sqrt (n-1 + sqrt(n-2 + ...sqrt(2 + sqrt (1. . . . .
21.Tinh S(n) = sqrt(1 + sqrt(2 + sqrt (3 + ...sqrt (n-1 + sqrt (n)....
22.S(n) = 1/(1 + 1/(1 + 1/(1 + 1/(... 1 /(1/(1 + 1/(1 + 1 .......
23.Hay m s lng ch s ca s nguyn dng n
24.Hay tinh tng cc ch s ca s nguyn dng n
25.Hay tinh tich cc ch s ca s nguyn dng n
26.Hay m s lng ch s l ca s nguyn dng n
27.Hay tinh tng cc ch s chn ca s nguyn dng n
28.Hay tinh tich cc ch s l ca s nguyn dng n
29.Cho s nguyn dng n) Hay tm ch s u tin ca n
30.Hay tm ch s ao ngc ca s nguyn dng n
31.Tm ch s ln nht ca s nguyn dng n
32.Tm ch s nh nht ca s nguyn dng n
33. Hay kim tra s nguyn dng n c ton ch s l hay khng ?
Cho day s Fibonaci 1, 1, 2, 3, 5, 8, 13,Trong Fi c tinh theo cng thc
F1=F2=1
Fi = Fi-1+Fi-2 vi i>2
Hay tm s Fibonaci th N trong day s
34. Vi s nguyn dng N cho trc, xt tp hp A(N) gm tt ca cc phn s c gi tr trong on [0..1] vi
mu s khng ln hn N) Vi d vi N=5 ta c cc phn s:
0/1; 1/5; 1/4; 1/3; 2/5; 1/2; 3/5; 2/3; 3/4; 4/5; 1/1
Cho s nguyn dng N) Vit chng trnh in ra mi phn s ti gian thuc A(N) theo th t tng dn ca
gi tr
35. Thp H ni
C 3 ct A, B, C, trn ct A c N ci da. Nhim v l chuyn tt ca cc da A sang C sao cho
+ Mi ln ch c chuyn 1 da
+ Da nm di c kich thc ln hn da nm trn
+ Ch c dng thm 1 cc B
Vi N=3
AC

AB
CB
AC
BA
BC
AC;
36. Tm kim nh phn
Cho s nguyn dng N v day N s nguyn A1, A2,,AN v mt s nguyn K. Hay cho bit v tri ca K trong
day s a cho, nu K khng xut hin trong day s th tra v gi tr 0
37. Cho ma trn kich thc NxN mi ch cha cc s 0 v 1. Hai c gi l chung 1 vng nu nh n c
cnh chung. Hay cho bit vng cha (x,y) c bao nhiu c gi tr bng 1.
Vi d: 6x6 vi (x,y)=(3,4)
1 1 0 1 0 1
0 0 0 1 0 1
1 1 1 1 0 1
0 0 0 0 0 1
1 1 0 1 0 1
0 1 1 0 1 0
Kt qua: 6

NG RAY 1
Cho s ng ray xe la nh hnh sau

Ban u c N toa tu xp theo th t t 1 n N theo chiu t phai sang tri trn ng ray A, ngi ta mun
xp li cc toa tu theo th t mi t phai qua tri (p1, p2,,pN) ln ng ray C theo nguyn tc: cc toa tu
khng c vt nhau trn ng ray, mi ln ch c chuyn mt toa tu t AC, AB hoc BC. Hay
cho bit iu c thc hin c khng? Nu c th a ra cc chuyn?
Vi d: N=4; Th t cn c l (1, 4, 3, 2)
Phng n chuyn: AC; AB; AB; AC; AC; BC; BC
NG RAY 2
Yu cu nh bi trn vi s ng st di y:

S SIU NGUYN T
s siu nguyn t l s m khi b 1 s ty y cc ch s bn phai ca n th phn cn li vn l 1 s nguyn t
vi d: 2333 l 1 s siu nguyn t c 4 ch s v 233, 23, 2 cng l cc s nguyn t.
Cho s nguyn dng N, hay a ra mn hnh tt ca cc s siu nguyn t nh hn hoc bng N. (N109)

BIU THC NGOC

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 hay tch cc cm ca biu thc .
Vi 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))
038. LUCKY NUMBER
Hai ch s 4 v 7 l nhng ch s may mn cn cc ch s khc th khng phai l ch s may mn v mt s
nguyn c gi l s may mn nu dng biu din ca n trong h thp phn ch bao gm nhng s may mn.
vi d 4, 7, 47, 74747,
Yu cu: hay cho bit s may mn th K l bao nhiu? (1K109)
D liu vao: t tp LUCKY.INP gm mt s nguyn K duy nht
D liu ra: ghi vo tp LUCKY.OUT l s may mn th K
Vi du
LUCKY.INP
LUCKY.OUT
1
4
2
7
3
47
4
77
015. Tranh sn du
Steve ci t chng trnh to tranh sn du. Chng trnh h tr k mu nh s t 1 n k Tranh c v trn
manh vai kich thc nn . Cc hng c nh s t 0 t trn xung di (ta x), cc ct (ta y) nh
s t 0, t tri sang phai. Ban u cc u c mu trng (mu 1).
Chng trnh cung cp 3 lnh x ly:
PAINT c x1 y1 x2 y2 chn hnh ch nht c gc trn tri (x1, y1), gc di phai l (x2, y2) v t hnh ch
nht ny theo kiu v bn c: t mt v cch mt vi trn tri l mu c, cc khng t vn gi nguyn
mu c,
SAVE lu tranh hin ti,
LOAD j ly bc tranh c lu lnh SAVE th j (nh s t 1 tr i) ra x ly.
Chng trnh v b nhim vi rt v b h thng bao v xa. Nhng may mn, Steve vn cn lu c bin ban
x ly day cc cu lnh a kich hot, gm tt ca m cu lnh.
Yu cu: Cho n, k, m v day cc cu lnh a thc hin (1 n
1000, 2 k 105, 1 m 105). Tt ca cc cu lnh u hp
l. Hay khi phc li bc tranh a v.
D liu: Vo t file vn ban CANVAS.INP:
Dng u tin cha 3 s nguyn n, k v m,
Mi dng trong m dng sau cha 1 cu lnh trong bin ban
a lu.
Kt qu: a ra file vn ban CANVAS.OUT bc tranh di
dng ma trn nguyn kich thc nn.
V d:

CANVAS.INP
347
PAINT 2 0 0 1 1
SAVE
PAINT 3 1 1 2 2
SAVE
PAINT 4 0 2 0 2
LOAD 2

CANVAS.OUT
211
131
413

PAINT 4 2 0 2 0
QUN M
Cho bn c vua kich thc NxN (4N16), cc dng c nh s th t trn xung di t 1 n N, cc
ct c nh s th t tri qua phai t 1 n N. Giao gia dng x v ct y gi l (x,y). Mt qun ma ban u
ng (s,t) c th di chuyn ti a qua 8 xung quanh n theo lut c vua (i theo hnh ch L) nh hnh di
y:

Hy cho bit t xut pht (s,t), qun m di chuyn n (u,v) qua t nht bao nhiu bc?
D liu vao: t tp KNIGHT.INP
+ Dng u tin ghi s nguyn dng N
+ Dng th 2 ghi 4 s s, t, u, v. cc s cch nhau mt ky t trng
D liu ra: ghi vo tp KNIGHT.OUT mt s nguyn duy nht cho bit s bc it nht qun ma di chuyn.
Vi du:
KNIGHT.INP KNIGHT.OUT
8
2
3454

Bai 2: REPAIR (MS0035)

Mt cng xng c cu trc hnh ch nht c chia thnh M vung hng dc v N vung hng ngang
(MxN). Cc vung c th c cc bc tng dc theo ng bin ca n theo hng ng (D), ty (T), nam
(N), bc (B). phng c gii hn bi cc bc tng ca vung gp li.
Hay cho bit cng xng c bao nhiu phng
D liu vao: Tp tin vn ban REPAIR.INP
+ Dng u tin hai s nguyn dng M v N (0M,N50)
+ Mi dng tip theo, mi dng c N s p (0p15). S p biu th cho s vung tng ng c bao nhiu
bc tng xung quanh. S p l tng ca:
1 (nu c tng phia T)
2 (Nu c tng phia B)
4 (nu c tng phia D)
8 (nu c tng phia N)
D liu ra: Tp tin vn ban REPAIR.OUT
+ S lng phng ca cng xng
Vi du:
REPAIR.INP
47
11 6 11 6 3 10 6
7 9 6 13 5 15 5
1 10 12 7 13 7 5
13 11 10 8 10 12 13

REPAIR.INP
5

REPAIR.INP
47
3222226
1004104
1004104
9 8 8 12 9 8 12

REPAIR.INP
1

Bai 1: Cho mt li vung gm M dng N ct. Trong mi ca li cha cc s nguyn dng t 1 n

100, mi vung dng x ct y ki hiu l (x,y). T mt vung c th di chuyn sang vung chung cnh.
Mt vng l tp hp cc vung k cnh vi nhau v c gi tr bng nhau. Cc k cnh vi vng v c gi tr
khc nhau vi gi tr cc trong vng th khng thuc vng.
Hay cho bit trong li vung c bao nhiu vng c cng mt gi tr.
D liu vao: t tp vn ban VUNG.INP
+ Dng u tin cha 2 s nguyn dng M v N
+ Trong M dng tip theo, dng th i ch N s nguyn dng tng ng gi tr ca li
D liu ra: ghi vo tp VUNG.OUT
Gm nhiu dng mi dng ghi 2 s k v t cho bit c t vng c cng gi tr k. Nu c nhiu dng th cc
dng c sp xp theo chiu tng dn ca k
Vi du:
VUNG.INP
56
113365
133665
231115
222355
332311

VUNG.OUT
13
21
33
51
61

Bai 1: Li (MS0002)
Cho mt li vung gm M dng N ct. Trong mi ca li ch cha s 0 hoc 1, mi vung dng x
ct y ki hiu l (x,y). T mt vung c th di chuyn sang vung chung cnh. Mt vng l tp hp cc
vung k cnh vi nhau v c gi tr bng nhau. Cc k cnh vi vng v c gi tr khc nhau vi gi tr cc
trong vng th khng thuc vng. Cho trc hia vung (x1,y1) v (x2,y2). Hay cho bit hai vung a cho c
cng thuc 1 vng hay khng, trong trng hp hai vung ny khng cng thuc mt vng hay kim tra xem
di chuyn t (x1,y1) sang (x2,y2) c phai i qua ng mt vng trung gian hay khng (Nu i qua ng mt
vng trung gian th gi l hai cch mt vng)
Vi du: Hnh bn di l vung 4x6, hai (3,4) v (1,2) l thuc mt vng, hai (2,3) v (1,6) cch mt vng
1 1 0 0 1 1
0 1 1 0 0 1
0 0 1 1 0 0
1 1 0 0 0 0
D liu vao: Cho trong file vn ban LUOI.INP
Dng u tin ghi cc s M, N, x1, y1, x2, y2 (1 x1, x2 M100; 1y1, y2,N100)
Trong M dng tip theo, mi dng ghi N s 0 hoc 1 tng ng vi gi tr ca cc li
Cc s cch nhau it nht mt khoang trng
D liu ra: Ghi ra file vn ban LUOI.OUT gm 1 s nguyn:
Nu hai (x1,y1) v (x2,y2) cng thuc mt vng th ghi s 1
Nu hai (x1,y1) v (x2,y2) cch mt vng th ghi s 2
Cc trng hp khc ghi s 3
Vi du:
LUOI.INP
462316
110011
011001
001100
110000

LUOI.OUT
2

Bai 2:
Cho mt bang hnh ch nht c chiu di m, chiu rng n, c m x n vung (m,n nguyn), gi tr ca mi
vung l 0 hoc 1. Nu cc s 0 bn trong cc c chung it nht mt cnh ta gi cc ny c chung thnh
phn lin thng, tng t cho cc s 1. Nu cc thnh phn lin thng ny c it nht mt bin ta ni l
thnh phn lin thng gip bin.
Bai ton: Cho bang hnh ch nht nh trn hay tm thnh phn lin thng gip bin ln nht
D liu vao: t file vn ban CHUNHAT.INP c cu trc nh sau:
Dng u tin l hai s m v n
M dng v n ct tip theo ghi gi tr mi
D liu ra: Trong file vn ban CHUNHAT.OUT
Dng u ghi tng s , nu khng c th ghi 0
Dng tip theo ghi ta cc trong thnh phn lin thng gip bin ln nht
Vi du
CHUNHAT.INP
CHUNHAT.OUT
56
111111
110000
001000
110111
000100

7
(2,3) (2,4) (2,5) (2,6)
(3,4) (3,5) (3,6)

BI TP
(09/11/2013)
Bai 1: Qun tng (Quc gia nm 2006)
Xt bn c vung kich thc nn. Cc dng c nh s t 1 n n, t di ln trn. Cc ct c nh s t
1 n n t tri qua phai.
nm trn giao ca dng i v ct j c gi l (i,j).
Trn bn c c m (0 m n) qun c. Vi m > 0, qun
c th i (ri, ci), i = 1,2,..., m. Khng c hai qun c
no trn cng mt . Trong s cc cn li ca bn
c, ti (p, q) c mt qun tng. Mi mt nc i, t
v tri ang ng qun tng ch c th di chuyn n
c nhng trn cng ng cho vi n m trn
ng i khng phai qua cc a c qun
Cn phai a qun tng t xut pht (p, q) v ich
(s,t). Gia thit l ich khng c qun c. Nu ngoi
qun tng khng c qun no khc trn bn c th ch
c 2 trng hp: hoc l khng th ti c ich, hoc
l ti c sau khng qu 2 nc i (hnh tri). Khi trn bn c cn c cc qun c khc, vn s khng cn
n gian nh vy.
Yu cu: Cho kich thc bn c n, s qun c hin c trn bn c m v v tri ca chng, xut pht v ich
ca qun tng. Hay xc nh s nc i it nht cn thc hin a qun tng v ich hoc a ra s -1
nu iu ny khng th thc hin c.
Input
Dng u tin cha 6 s nguyn n, m, p, q, s, t.
Nu m > 0 th mi dng th i trong m dng tip theo cha mt cp s nguyn ri , ci xc nh v tri qun th i.
Hai s lin tip trn cng mt dng c ghi cch nhau it nht mt du cch.
Output
Gm 1 dng duy nht l s nc i tm c
Example
QBBISHOP.INP
QBBISHOP.OUT
837214
3
54
34
47
Hn ch: Trong tt ca cc test: 1 n 200.

BI TP
(08/11/2013)
Bai 1: Chut va khoai lang
Trong mt manh vn hnh ch nht c kich thc MxN, ngi ta chia manh vn thnh M hng v N ct,
cc hng v ct to thnh cc n v hnh vung c cnh bng 1, ngi ta trng khoai lang trong nhng n
v hnh vung. Trong manh vn ny c mt ch chut trong hang, ch chut ny cn xc nh min (Hai
min khc nhau khng c mt cnh vung no chung) ngi ta a trng khoai lang c din tich ln nht trong
manh vn o mt ng hm n phn din tich ln nht . Hay vit chng trnh gip ch chut thc
hin cng vic o hm
D liu: t tp tin vn ban CHUOT.INP
+ Dng u tin ghi 2 s nguyn dng M v N l kich thc ca manh vn (1M,N100).
+ Trong M dng tip theo, mi dng c N ky t 0 hoc 1, vi y ngha 0 l khng trng khoai lang, 1 l c
trng khoai lang
Kt qu: Ghi vo tp tin vn ban CHUOT.OUT mt s nguyn l tng s dy khoai lang ca min c din
tich ln nht (gia s mi ch c ti a mt dy khoai lang)
Vi du:
CHUOT.INP CHUOT.OUT
66
11
000111
000011
000011
000011
000011
111000

BI TP
(Ngay 02/11/2013)
027. BNG S
Rn yu thich mn ton, nhng li khng mnh lm v phn s. gip
im yu ny thy gio ra bi tp v nh nh sau.
Cho bang 22 cha 4 s dng A, B, C v D 0 < A, B, C , D 100):

Rn

khc

phc

Gi tr ca bang ny l

Ta c th chuyn cc s trong bang theo chiu kim ng h:

Nhim v ca Rn l xc nh s ln chuyn it nht nhn c bang c gi tr ln nht.

d, vi bang sau ta ch cn chuyn mt ln l c bang

gi tr ln nht:
D liu: Vo t file vn ban TABLE.INP:
Dng th nht cha 2 s A v B,
Dng th 2 cha 2 s C v D.
Kt qu: a ra file vn ban TABLE.OUT mt s
nguyn s ln chuyn.
V d:
TABLE.INP TABLE.OUT
41 99

Vi
c

100 13
033. CP BN
Steve sng mt th trn nh. u c mt bn cang m nm th mi ha mi c mt tu cp bn. Hm nay
l mt ngy ng nh bi v tt ca cc tu ra vo cang ny du cp bn. Steve nh du n l ngy 1.
Ngy thng tri qua phng lng. Ngy c tu cp bn c Steve coi l th v v c ghi li trn lch. Steve
nhn thy l cc tu gh vo cang theo chu k nht nh,mi tu c mt ch k ring ca mnh. Vi d, nu chu
k l 3 ngy th tu gh cang vo cc ngy 1, 4, 7, 10, . . .
Yu cu: Cho n s ln c tu gh cang (1 n 5000) v cc ngy c tu cp bn. Hay xc nh s lng tu
khc nhau it nht cp bn.
D liu: Vo t file vn ban LANDFALL.INP:
Dng u tin cha s nguyn n,
Mi dng trong n dng sau cha mt s nguyn ngy tu cp bn (khng vt qu 109).
Kt qu: a ra file vn ban LANDFALL.OUT mt s nguyn s lng tu khc nhau it nht cp bn.
V d:

LANDFALL.INP
5
1

LANDFALL.OUT
2

7 F
11 F
13 F
19 F
21 F
39
Dem:=0;
While do
Begin
{tm ngy u tin i m con tu dem+1 cp bn ngy 1
D:=A[i]-A[1]; ok[i]=flase;
For j:=i+1 to N do
If A[j]-A[i] =d then
Begin
Ok[j]:=false;
I:=j;
End;
End;

034. XA UI
rn luyn k nng x ly xu thy gio vit mt xu chun b trc ln bang, ln lt tng ky t, t tri sang
phai. Nu xut hin mt phn ui khng rng l xu con trong phn bn tri cn li ca xu th hc sinh phai
ku ln:Xa ui!. Thy gio s xa phn ui ny ri vit tip cc ky t cn li vo cui xu ang c trn
bang.
Yu cu: Cho xu ban u m thy gio chun b. Xu c di khng qu 1000 v ch cha cc ky t la tinh
thng. Hay xc nh xu cn li trn bang.
D liu: Vo t file vn ban SUFFIX.INP gm mt dng cha xu ban u.
Kt qu: a ra file vn ban SUFFIX.OUT xu cn li trn bang.
V d:
SUFFIX.INP
abcabc

SUFFIX.OUT
abc

Abc
Kim tra 1 ky t x xut hin trong xu S? pos(x,S)>0: x xut hin trong S
C php: pos(s1,s2): tra v v tri xut hin u tin ca S1 trong S2. Nu S1 k xut hin trong
S2 th tra v 0
Var S:ansistring; //FreePascal

Ch:char;
S:=;
n:=0;//N l s lng phn t ca day
While not eof(f) do
Begin
Read(f,ch);
If xuathien(ch,A)=false then begin inc(N);A[n]:=ch;end;
End;
Write(s);

BI TP
(Ngay 1/11/2013)
Bai 1: ng i
Mt con robot di chuyn theo mt chng trnh nh sn trn mt phng to . Chng trnh ny c th hin di

dng mt day N lnh (1 N 3000). Cc lnh thuc mt trong cc dng sau:

F S: i thng theo hng hin ti S bc.

R S: R phai 900 v i S bc.

L S: R tri 900 v i S bc.

Yu cu: Cho mt chng trnh iu khin robot, hay xc nh chiu di T on ng m con robot a i c, bit mi
bc ca n di d(cm). Ban u con robot ng ti v tri (0,0) v hng theo chiu dng ca trc honh.
D liu: Vo t file vn ban PATH.INP:
Dng u tin cha 2 s nguyn dng N v d.
N dng tip theo, mi dng cha mt lnh theo quy cch nu trn.
Kt qu: Ghi ra file PATH.OUT cha chiu di T tm c.
Vi du:
PATH.INP
41
F5
R7
F2
L9

PATH.OUT
23

Bai 2: Tr chi
Chng ta c mt tr chi nh sau: Bn A s dng 3 ci cc c (khng nhn thy vo bn trong), v 3 ci cc
ny c p xung bn. Ci cc bn tri nht bn trong c mt qua bng. Chng ta c 3 cch di chuyn hai ci
cc nh sau:

Chng ta s nhp vo mt chui ti a l 50 ky t, cha cch di chuyn ca cc cc.

Yu cu: a ra v tri ca qua cu c trong cc. C 3 v tri l 1, 2, 3 theo th t t tri sang phai
D liu vao: t file MOVE.INP gm 1 dng duy nht l xu ky t ch bao gm cc ch ci in hoa A, B, C
D liu ra: ghi vo file MOVE.OUT 1 s nguyn duy nht cho bit v tri cc cha qua cu
Vi du:
MOVE.INP
MOVE.OUT
AB
3
Bai 3: Bin i bng

Xt bang vung gm n dng v n ct. Cc dng c nh s t 1 n n t trn xung di. Cc ct c nh s t

1 n n t tri sang phai. nm v tri dng i v ct j ca bang c gi l (i,j). Trn bang A a cho, khoang cch t
(i,j) n (p,q) c tinh bng |i-p|+|j-q|. Ti (i,j) ca bang A ghi s nguyn khng m a ij, i=1,2,,n; j=1,2,..,n. Da vo
cc s c ghi trn bang A, ngi ta cn xy dng mt bang B cng kich thc vi A m trn (i,j) ca bang B s
c ghi s bij xc nh nh sau:
Nu aij > 0 th bij = aij

Nu aij = 0 th bij c gi tr bng gi tr apq ca (p,q) gn (i,j) nht trong s cc c gi tr khc 0 trn dng i v ct j
ca bang A. Trong trung hp c nhiu khc khng c cng khoang cch nh nht n (i,j) th (p,q) oc chn l
cha s ln nht trong chng. Nu tt ca cc phn t ca dng i v ct j u c gi tr 0 th b ij = 0.
Yu cu: cho bang A, hay tm bang B.
D liu: vo t file vn ban NZTABLE.INP gm:
Dng u tin ghi s nguyn dng n (n 50)
Dng th i trong s n dng tip theo ghi n s nguyn khng m a i1, ai2, , ain l cc s trn dng th i ca bang, i=1,2,
,n; aij 10000.
Kt qu: a ra file vn ban NZTABLE.OUT gm n dng, dng th i ghi n s nguyn dng b i1, bi2, , bin l cc s
trn dng th i ca bang B.
Hai s lin tip trn cng mt dng c ghi cch nhau bi mt du cch.
Vi du:
NZTABLE.INP

NZTABLE.OUT

4
1030
4005
0060
0000

1335
4465
4666
4065

BI TP QUAY LUI
(Ngy 20/10/2013)
Bai 1: Cho s nguyn dng N (N15) v day s nguyn A1, A2,,AN i mt khc nhau. Hay
lit k tt ca cc hon v ca day s a cho, mi hon v c ghi trn mt dng. Cc s trn
mt dng cch nhau bi mt ky t trng
Bai 2: Cho s nguyn dng N (N12), hay lit k tt ca cc xu nh phn c di N
Bai 3: Mt my ATM c N (N15) t tin c gi tr ln lt l t1, t2,,tN. Hay a ra mt cch
tra ng vi s tin bng S
D liu vao: ATM.INP
+ Dng u tin ghi 2 s N v S
+ Dng tip theo ghi N s nguyn dng, s th i c mnh gi l ti
D liu ra: ghi vo tp ATM.OUT
+ Nu c cch tra ng S tin th a ra cch tra, ngc li ghi -1
Vi du:
ATM.INP
ATM.OUT
10 390
20 20 50 50 50 100 100
200 10 20 20 50 50 50 50 100 100
Bai 4: Cho s nguyn dng N (N20). Hay lit k tt ca cc xu c di N ch gm 2 ky t
A v B m khng c 2 ky t B no ng cnh nhau
Vi du:
D liu vao D liu ra
4
AAAA
AAAB
AABA
ABAA
ABAB
BAAA
BAAB
BABA

BI TP MNG HAI CHIU

(Ngay 19/10/2013)
Bi 1. Cho mng hai chiu gm N dong v N c t, mi phn t l 1 s nguyn. Thc hin cc yu cu sau:
a. Tinh tng cc phn t trong mang
b. Tinh tng cc phn t nm phia trn ng cho chinh. (ng cho chinh l ng cho cha cc phn t
c ta dng bng ta c t)
HD: Ch tinh tng cc phn t c ch s c t ln hn ch s dng
c. Tinh tng cc s nguyn t trong mang
d. im yn nga l im m gi tr ca n ln nht trn dng v nh nht trn c t. Yu cu tm v in ra mn
hnh tt ca cc im yn nga trn mang. Trng hp khng c th in ra mn hnh KHONG CO
Bi 2. To bng

Cho mt bang A gm N x N s nguyn (N 1000), cc dng c nh s t trn xung di bt u t 1, cc

ct c nh s t tri qua phai cng bt u t 1. Mi s trong bang c gi tr tuyt i khng vt qu
30000. Bang B c to ra t bang 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 bang 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 phai cng bt u t 1. Mi s trong bang c gi tr tuyt i khng vt qu 10000.
ng cho chinh ca bang l ng thng ni hai (1,1) v (N,N). Nh vy trn bang c 2N-1 ung cho
song song vi ng cho chinh.
Bi ton: Hay tm ng cho song song vi ng cho chinh c tng cc phn t trn ng cho l ln
nht.
1
3
2
4

2
4
5
3

4
2
4
2

3
5
3
5

ng cho

Bai 4: Min lin thng (Olympic 2011)

Cho bang s ch nht kich thc MxN vung n v (M dng nh s t 1 n M t trn xung, N ct
nh s t 1 n N t tri sang). Mi ghi s 0 hoc 1. Mt min 0 ca bang s l tp hp cc chung cnh v
cha s 0.
Yu cu: Hay xc nh s min 0 ca bang s v min 0 c din tich ln nht
D liu vao: T file vn ban MIEN.INP
- Dng u ghi 2 s nguyn M v N (0<M,N100)
- M dng tip theo mi dng ghi N s 0 hoc 1, cc s cch nhau it nht mt ky t trng.
D liu ra: Ghi vo file vn ban MIEN.OUT gm 2 dng
- Dng th nht: ghi s lng min 0
- Dng th 2 ghi din tich min 0 c din tich ln nht
Vi du:
MIEN.INP
MIEN.OU
Gii thich
T
45
35
10001
10001
01001
01001
10111
10111
10000
10000

BI TP XU
(Ngay 18/10/2013)
Bi 1: Nhp vo t bn phim 1 xu v in ra mn hnh sau khi xa b cc ky t trng d tha
Cc ky t trng d tha khi: ky t trng ng u xu, ng cui xu, nu c 2 ky t trng ng lin tip trong
xu th c 1 ky t trng d tha
Bi 2: Nhp vo mt xu t bn phim v thay th tt ca cc cm ky t anh bng cm ky t em
Bi 3: Nhp t bn phim mt xu hay cho bit s ln xut hin ca mi ch ci ting anh trong xu . khng
phn bit ch hoa hay ch thng
Bi 4: Nhp vo t bn phim 1 xu ky t ri in ra mn hnh cc t ca xu theo th t ngc li. Vi d xu
St= mot hai ba ta cung hat th kt qua in ra mn hnh l hat cung ta ba hai mot. Bit rng hai t c cch
nhau bi mt du cch
Bi 5: 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 hay tch cc cm ca biu thc .
Vi 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 6: Cho xu S c khng qu 250 ky t. Hay tm cch nn xu S sao cho nu c nhiu ky t lin tip ging
nhau th thay bng 1 s nguyn v tip theo l ky t . Vi d S=AAAABCCC th kt qua sau khi nn l
S=4AB3C;
Yu cu: Cho xu S hay in ra mn hnh sau khi nn xu S
Bi 7: Nam a lm c mt chui t nhng vin mu m cu su tp c. Cc vin ca Nam c
mu xanh, hoc vng, c ky hiu tng ng l G, R, Y. Theo Nam mt chui p phai c ca 3 mu
trn v s lng cc vin mi mu phai bng nhau.
Yu cu: Cho xu S c di khng qu 250 ch bao gm cc ky t G, R, Y, mi ky t tng trng cho mt
vin ca Nam. Hay cho bit chui ca Nam c phai l chui p hay khng?
Vi d: S= RRGGYRYG => YES
S= RGRGY => NO
Bi 8: Cho xu S ch bao gm cc ky t la tinh thng vi di ti a 255 ky t. Hay vit chng trnh to
xu T bng cch xa cc ky t lin tip ging nhau trong xu S v ch li 1 ky t i din trong on .
Vi d:
Cho S= hhoooooocccsiiiiiinhhhhh => T= hocsinh
Bi 9: Sa xu
Hay vit chng trnh nhp vo t bn phim mt xu ky t, trong , nu tinh t tri sang phai th ky t # l
du hiu xo i mt ky ng ngay trc n nu c. Sau in ra mn hnh xu a sa cha theo ng qui nh.
Vi du:
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 phim xu cn sa.
Kt qu: In ra mn hnh xu a sa.

BI TP
(Ngay 13/10/2013)
012. TU CHIN
Em ngi bn ca Steve rt thich tr chi bn tu chin. Nhng tr chi a qu c v khng tm c u
ca. Steve ha s vit li chng trnh tr chi . Vic u tin l phai ln s b tri tu. Ban b tri tu l
li vung kich thc nm (1 n, m 1000). Tu chin l q to thnh hnh ch nht 1q , nm gn trong
ban (1 q).
Steve a b tri c k tu, tu th i c xc nh bi ta cc
u v cui (x1i, y1i), (x2i, y2i), trong hoc x1i = x2i hoc y1i =
y2i (1 x1i x2i n, 1 y1i y2i m, 0 k 104, i = 1 k). Hai
tu chin bt k phai khng c im chung, d l trn cnh hay
nh. Hay tinh s kha nng v tri c th t thm 1 tu c kich
thc 1x1.
Yu cu: Cho n, m, k v ta (x1i, y1i), (x2i, y2i) ca cc con tu.
a ra s v tri c th b tri thm mt tu kich thc 11.
D liu: Vo t file vn ban SHIPS.INP:

Dng u tin cha 3 s nguyn n, m v k,

Dng th i trong k dng sau cha 4 s nguyn x1i, y1i, x2i
v y2i.
Kt qu: a ra file vn ban SHIPS.OUT mt s nguyn s kha nng b tri tu mi.
V d:
SHIPS.INP
10 10 10
1112
1434
1 7 1 10
3161
3638
3 10 4 10
6676
8182
8 10 8 10
10 6 10 10

SHIPS.OUT
17

MT S BI TP C BN
(bai tp v nha 4-10-13)
Bai 1: Phn tich s nguyn dng N thnh tich cc s nguyn t
Vi d: N=100
Phn tich thnh N=2*2*5*5
Bai 2: Cho s nguyn N dng v day s nguyn A1, A2,,AN trong A1<A2<<AN v mt s nguyn X.
Hay tm v tri i trong day s sao cho Ai=X. a ra mn hnh l gi tr ca i tm c tha man iu kin Ai=X,
ngc li nu khng tm c i th thng bo 0
Gii hn: N109
Bai 3: Thng k
Cho s nguyn dng N (N106) v day s nguyn dng A1, A2,,AN trong mi phn t c gi tr khng
vt qu 106
Hy cho bit:
+ S lng phn t khc nhau
+ S nguyn dng nh nht khng xut hin trong day s
+ S lng gi tr lp li nhiu nht
Vi du day s 6 5 6 2 3 1 6 7 5
+ S lng phn t khc nhau: 6 (ch gm cc s 1 2 3 5 6 7)
+ S nguyn dng nh nht khng xut hin trong day s: 4
+ S lng gi tr lp li nhiu nht: 3 (s 6 lp li 3 ln)

BI TP NGY 5-10-13
Bai 1. D HI
Bui d hi din ra rt vui v v c rt ng ngi ti tham d. Khng ai bit c chinh xc nhng ngi no
a ti v tng cng c bao ngi a tham d. Steve l mt trong nhng ngi tham d, cho bit l d hi ny
cng ng v vui nh bui d hi tun trc, c mi m2 ca phng d hi c m ngi.
Hm sau 5 t bo a phng tng thut v bui d hi v thng bo v s ngi tham d. Mi t bo c mt
s liu thng k ring ca mnh.
Yu cu: Cho m, p din tich ca phng d hi (theo m2), 5 s liu m cc t bo a cung cp. Hay xc nh
lch ca s liu nu trn bo vi con s dn xut t thng tin ca Steve, tc l hiu ca s liu a nu vi s do
Steve tinh. Cc s liu ng trn bo c gi tr khng vt qu 106.
D liu: Vo t file vn ban PARTY.INP:
Dng u tin cha 2 s nguyn m v p,
Dng th 2 cha 5 s nguyn s liu ng trn bo.
Kt qu: a ra file vn ban PARTY.OUT trn mt dng nm hiu tm c.
V d:
PARTY.INP
PARTY.OUT
5 20
-1 1 900 -100 -3
99 101 1000 0 97
Bai 2. HI NM
Trc mt Mario l mt day 10 cy nm xp thnh mt hng di, mi cy nm c mt gi tr ring, l mt s
nguyn khng vt qu 100. Mario khng cn phai hi ht nm m ch cn t tng gi tr cng gn 100 cng
tt v ch c hi lin tc cc cy nm cnh nhau. Nu c hai kha nng gn 100 tng ng nhau (vi d 98
v 102) Mario s chn phng n c gi tr ln hn.
Yu cu: Cho gi tr cc cy nm theo trnh t t tri sang phai. Hay xc nh tng gi tr nm Mario hi c.
D liu: Vo t file vn ban MUSHROOM.INP gm 10 dng, mi dng cha mt s nguyn, dng th i xc
nh gi tr cy nm i.
Kt qu: a ra file vn ban MUSHROOM.OUT mt s nguyn tng gi tr nm Mario hi c.
V d:
MUSHROOM.IN
MUSHROOM.OUT
P
1
110
2
3
5
8
13
21
34
55
79
Bai 3. Tr chi xy nha
Tn chng trnh: BUILD.???
Trong cc tr chi, Bi thich nht chi tr xy nh cao tng. thc hin tr chi ny Bi thng ly cc khi
hnh vung c cao 1 chng ln nhau, Bi mun xy nh cng cao cng tt nn a sp nhng khi hnh
vung ln di v khi hnh vung nh trn. Mt hm, ch ca Bi i cng tc v tng cho Bi rt nhiu khi
hnh vung khc, Bi quyt nh ngay l xy thm mt ta nh na, ch trong chc lt Bi a hon thnh nhng

ri Bi ngh s gp hai ta nh li c mt ta nh c cao bng tng ca 2 ta nh c. Nu phai tho ht

ca hai ta nh ri ghp li th rt mt thi gian. Bn hay gip Bi thc hin cng vic
D liu vao: T file BUILD.INP
+ Dng u tin l s nguyn dng N cho bit cao ca ca ngi nh th nht (1N106)
+ N dng tip theo dng th i l mt s nguyn dng cho bit kich thc ca khi hnh vung th i dng
xy ngi nh th nht
+ Dng th N+2 l s nguyn dng M cho bit cao ca ngi nh th hai (1M106)
+ M dng tip theo dng th j l mt s nguyn dng cho bit kich thc ca khi hnh vung th j dng
xy ngi nh th 2
D liu ra: Ghi vo file BUILD.OUT gm N+M dng trong dng th i cho bit kich thc ca khi hnh
vung th i trong trng nh mi
Gii hn: Cc s nguyn dng u 109
Vi du:
BUILD.INP
BUILD.OUT
2
8
7
7
2
7
3
4
8
2
7
4

DY NH PHN

Mt day nh phn di n (n10) l mt day x=x1x2xn trong xi {0,1}, i=1,2,,n. Hay lit k tt

ca day nh phn di n
Vi du:
D liu vao
N=3

D liu ra
000
001
010
011
100
101
110
111

BI TON RT TIN T NG ATM

Mt my ATM hin c n (n20) t tin c gi tr t1, t2,,tN. Hay a ra mt cch tra li vi s tin ng bng S.
D liu vao: t tp vn ban ATM.INP
+ Dng u cha 2 s n v S
+ Dng th 2 gm n s t1, t2,,tn
Kt qu ra: ghi vo tp vn ban ATM.OUT c dng: Nu c th tra ng S th a ra cch tra, nu khng th
ghi -1.
Vi du:
ATM.INP
ATM.OUT
10 390
20 20 50 50 50 100 100
200 10 20 20 50 50 50 50 100 100
NGI DU LCH
Cho N thnh ph nh s t 1 n N v cc tuyn ng giao thng hai chiu gia chng, mng li giao
thng ny c cho bi mang 2 chiu C[1..N,1..N], y Cij=Cji l chi phi i on ng trc tip t thnh ph
i n thnh ph j.
Mt ngi i du lch xut pht t thnh ph 1, mun i thm tt ca cc thnh ph cn li mi thnh ph
ng mt ln v cui cng quay li thnh ph 1. Hay ch ra cho ngi hnh trnh vi chi phi it nht.
D liu vao: t tp vn ban TSP.INP
+ Dng u cha s nguyn N (1N20) l s lng thnh ph
+ N dng tip theo mi dng N s m ta mang C
D liu ra: Ghi vo tp vn ban TSP.OUT
+ Dng u l chi phi nh nht
+ Dng th 2 m ta hnh trnh
Vi d:
TSP.INP
TSP.OUT
Hnh minh ha
TSP.INP
TSP.OUT
Hnh minh ha
4
97
4
117
0 20 35 42 1 2 4 3 1
0 20 35 10 1 2 4 3 1
20 0 34 30
20 0 90 50
25 24 0 12
35 90 0 12
42 30 12 0
10 50 12 0

Bai 1. HON V
Cho xu S ( di khng vt qu 10) ch gm cc ky t t A n Z (cc ky t trong xu S i mt khc
nhau). Hay lit k tt ca cc hon v khc nhau ca xu S
Vi du:
D liu vo D liu ra
XYZ
XYZ
XZY
YXZ
YZX
ZXY
ZYX

Bai 4: CHIA NHM

Cho day s A gm N (N10) s nguyn a1, a2,,aN v mt s nguyn dng K (1<K<N). Hay a ra mt
cch chia day s thnh K nhm m cc nhm c tng bng nhau
Vi du:
D liu vo
D liu ra
N=5; K=3
Nhm 1: 1 9
Day s: 1 4 6 9 10 Nhm 2: 4 6
Nhm 3: 10
Bai 5: PHN TICH
Cho s nguyn dng n (n10) v day s nguyn dng a1, a2,,an (ai109). Tm s nguyn dng m nh
nht sao cho m khng phn tich c di dng tng ca mt s cc s (mi s c s dng khng qu 1 ln)
thuc n s trn.
Vi d:
D liu vo Kt qua ra
N=4
13
Day s:
1236
Bai 6: Cho mt xu S ch gm cc ky t t 0 n 9 c di nh hn 11 v mt s nguyn dng M. Hay
a ra mt cch chn vo S cc du - v + thu c s M cho trc (Nu c th)
Vi d: M=8; Xu S=1234567 mt cch chn l: -1+2-3+4+5-6+7

Bai 8:
Mt xu X=x1x2xM c gi l xu con ca xy Y=y1y2yN nu ta c th nhn c xu X t xu Y bng
x1 yi1 , x2 yi2 , xm yim
cch xa i mt s ki t, tc l tn ti mt day cc ch s: 1i1<i2<<im<N
Vi d: X= adz l xu con ca xu Y= baczdtz; i1=2<i2=5<i3=7
Nhp vo mt xu S ( di khng qu 15 ky t ch gm cc ky t t a n z), Hay lit k tt ca cc xu con
khc nhau ca xu S.
Vi d:
D liu vo D liu ra
S= aba
1. a
2. b
3. aa
4. ab
5. ba
6. aba

BI 9: T HP
Mt t hp chp K ca N phn t l mt tp con gm K phn t gm N phn t
Vi d: tp {1,2,3,4} c cc t hp chp 2 phn t l {1,2} {1,3} {1,4} {2,3} {2,4} {3,4}
Cho s nguyn dng K v N (KN), hay lit k tt ca cc t hp chp K ca N phn t
BI 10: CHNH HP LP
Chnh hp lp chp K ca N phn t l mt day gm K thnh phn l mt phn t ca tp N phn t c xt th
t v khng yu cu cc thnh phn khc nhau.
Vi d: Day nh phn di M l mt chnh hp lp chp 2 ca M phn t. Cc day nh phn c di 3 l: 000,
001, 010, 011, 100, 101, 110, 111
Hay vit chng trnh lit k tt ca cc chnh hp lp chp K ca N phn t
BI 11: CHNH HP KHNG LP
Chnh hp khng lp chp K ca N phn t l mt day K thnh phn ly t tp N phn t c xt th t nhng
cc thnh phn khng c ging nhau.
Vi d chnh hp khng lp chp 2 ca 3 phn t: 1 2, 1 3, 2 1, 2 3, 3 1, 3 2.
Vit chng trnh lit k tt ca cc chnh hp khng lp chp K ca N phn t (KN)
BI 12: BA L
Mt chic ba l c th cha c mt khi lng w. C n (n20) vt c nh s 1, 2,,n. vt i c
khi lng ai v c gi tr ci. Cn chn cc vt cho vo ba l tng cc vt c gi tr ln nht

Bai 1. DY NGOC
Cho s nguyn dng N (n10), hay lit k tt ca cc cch khc nhau t n du ngoc m v n du ngoc ng
ng n?
Vi du:
D liu vo
D liu ra
N=3
Hng dn:
Bai 2. Cho s nguyn dng N (N20), hay lit k tt ca cc xu di N ch gm hai ky t A hoc B m
khng c hai ky t B no ng cnh nhau.
Vi du:
D liu vo D liu ra
N=4
AAAA
AAAB
AABA
ABAA
ABAB
BAAA
BAAB
BABA
Bai 3: Cho mt xu S ch gm cc ky t t 0 n 9 c di nh hn 11 v mt s nguyn dng M. Hay
a ra mt cch chn vo S cc du - v + thu c s M cho trc (Nu c th)
Vi d: M=8; Xu S=1234567 mt cch chn l: -1+2-3+4+5-6+7

007 Cung in (Olympic 2011)

mt vng quc n c 1 v vua v ng c N quy phi. Trn ming t hnh vung c kich thc NxN, nh
vua mun xy dng cho mi quy phi, mi ngi mt cung in (gia s mi cung in u nm trn mt manh
t kich thc 1x1). Vn l cc quy phi ny c tinh ghen ght nhau nn nh vua khng mun cc cung in
nhn thy nhau t cc hng (ngang, dc, cho). Chi phi xy dng cc cung in trn mi t c th c gi
thnh khc nhau. Nh vua mun xy dng N cung in vi tng chi phi thp nht.
Yu vu: Bn hay gip nh vua thc hin cng vic
D liu vao: T file vn ban CUNGDIEN.INP gm N+1 dng
- Dng u cha s N (1N16)
- N dng sau, mi dng cha N s l chi phi xy dng ti t tng ng (Chi phi xy dng cung in
trong mt c gi tr nguyn t 1 n 100). Mi s cch nhau it nht mt khoang trng
D liu ra: Ghi ra file vn ban CUNGDIEN.OUT gm mt s duy nht cho bit tng ch phi thp nht cho
vic xy dng. Gia s d liu lun c li giai
Vi du:
CUNGDIEN.INP

CUNGDIEN.OUT
15

4
3 4 12 3
6171
2415
12 3 8 7
*Giai thich: Cc c chn l (1,2), (2,4), (3,1), (4,3)
013. GII M S

Cc ch s t 1 n 9 c ma ho di dng cc t ch cha cc ky t a. b v c theo quy tc sau:

Vi d s 132 s c vit thnh accb.
Ch s

cc

bbc

cbc

abc

bac

aac

cac

Yu cu: t xu ky t cho trc, hay tm s nguyn dng tng ng.

D liu: Vo t file vn ban DECODE.INP xu cha khng qu 100 ky t a,b, c.
Kt qu: a ra file vn ban DECODE.OUT s tng ng hoc -1 nu xu khng tng ng vi mt s
nguyn no.
V d:
DECODE.INP

DECODE.OUT

abcac

129

abccc

63

035. S PHNG LNG

S phng lng l s m ngoi tr 2 cha s u v cui, mi ch s cn li u b hn trung bnh cng ca ch
s ng trc v sau n, tc l vi
x = an10n+an-110n-1+ . . .+a110+a0

ai <

ai 1 ai 1
2

, i = 1 n-1

Steve say m tm hiu v cc s phng lng v mun bit l vi n nguyn cho trc (1 n 10) c tn ti s
phng lng c ng n ch s v nu c th s ln nht l bao nhiu.
Yu cu: Cho n. Hay xc nh s phng lng ln nht c ng n ch s. Nu ko tn ti a ra s -1.
D liu: Vo t file vn ban SMOOTH.INP gm mt dng cha s nguyn n.
Kt qu: a ra file vn ban SMOOTH.OUT gi tr xc nh c.
V d:
SMOOTH.INP SMOOTH.OUT
3

989

017. Dy ABC
Cho trc s nguyn dng N (N100). Hay tm mt xu ch gm cc ky t A, B, C tha man 2 iu kin
+ C di N
+ Hai on con bt k lin nhau u khc nhau (on con l mt day lin tip cc ky t ca xu)
004 TM BIU THC
Cho xu s N= 123456789 v s nguyn M
Yu cu: Hay tm cch chn vo N cc du cng hoc tr thu c biu thc c gi tr bng M (nu c
th)
D liu vao: c t file vn ban BTHUC.INP c ni dung duy nht l s nguyn M
D liu ra: Ghi vo file vn ban BTHUC.OUT. Ghi tt ca cc biu thc thu c nu c, nu khng thu
c biu thc no c gi tr bng M th ghi l KHONG CO
Vi du:
BTHUC.INP
500

BTHUC.OUT
1-234-56+789
1-2+345+67+89
-12+34+567-89

1000

KHONG CO

010. Cc k t
Tr chi c m ta nh sau: trn mt bang hnh ch nht chia R hng v C ct c cc ky t ch hoa (A-Z)
c vit trn mi ca bang. Trc khi bt u tr chi c mt hnh gc trn bn tri ca bang(hng 1, ct
1). Trong mi bc di chuyn, mt ngi chi c th di chuyn hnh n v tri cc lin k (ln trn, xung
di, sang tri, sang phai) vi rng buc rng hnh khng th di chuyn n v tri k tip nu ny cha ky t
a xut hin m hnh a di chuyn qua. Mc ich ca tr chi l chi c nhiu bc di chuyn nht c th
c.
Vit chng trnh xc nh s v tri ti a trong bang m hnh c th ving thm trong tr chi.
D liu vao: Vo t tp tin vn ban LETTERS.INP
- Dng th nht cha hai s nguyn R v C, c vit cch nhau bi mt du cch, (1 R, C 20 )
- R dng tip theo cha, mi dng cha 1 xu ky t. Mi dng biu din mt hng ca bang.
Kt qu ra: Ghi vo tp tin vn ban LETTERS.OUT mt s nguyn l gi tr ln nht cc v tri m hnh c th
di chuyn trn bang.
Vi du:
LETTERS.IN
LETTERS.OUT
P
24
3
CAAB
ADCB
36
6
HFDFFB
AJHGDH
DGAGEH

004: LT NN
Cho nn nh hnh vung cnh n=2k (2k10) b khuyt 1 phn t ti gc trn phai (khuyt phn 2). Hay lt nn
nh a cho bng nhng vin gch hnh thc th to bi 3 vung n v

D liu vao t tp vn ban LATNEN.INP duy nht mt s nguyn dng k

D liu ra ghi vo tp LATNEN.OUT cch lt nn
Vi du:
LATNEN.INP
3

LATNEN.OUT
11330000
14430000
2 4 13 13 0 0 0 0
2 2 13 16 0 0 0 0
5 5 14 16 16 15 9 9
5 8 14 14 15 15 12 9
6 8 8 7 10 12 12 11
6 6 7 7 10 10 11 11

005: ( thi Olympic 30/4 nm 2012 Khi 10)

Cho day A gm N s nguyn dng a1, a2,,aN, mi s trong day A ch xut hin ng 1 ln (1N,
ai100000)
Yu cu: Tm on di nht gm cc phn t trong day trn to thnh mt hon v cc phn t ca tp gi tr
{1, 2, , K} (1KN)
D liu vao: t file vn ban PASWAP.INP
+ Dng 1: ghi s N
+ T dng 2 tr i ghi N s a1, a2,,aN gia cc s cch nhau it nht mt du cch hay du xung hng
Kt qu: ghi vo file PASWAP.OUT
Nu khng c on no tha man th ghi 0
Ngc li: + Dng 1: ghi imax l ch s u tin ca on di nht tm c trong day A
+ Dng 2: ghi dmax l s phn t ca on di nht
Vi du:
PASWAP.INP
PASWAP.OUT
7
3
10 9 3 4 1 2 8
4
006. S NH NHT
Cho mt s nguyn dng k v mt xu ki t s. Xu s ch gm cc ky t l cc ch s 0..9 v cc ch ci la
tinh thng a.. z, trong c it nht k ki t l ch s. Vit chng trnh loi b mt s ky t ra khi xu s
sao cho k ky t cn li theo ng th t to nn s nh nht. Trong k ky t cn li c th cho php cc ch
s 0 ng u.
D liu vo: t file vn ban MIN.INP gm 2 dng. Dng th nht cha s nguyn dng k (k<=10). Dng th
hai cha xu s c di nh hn 250.
Kt qu: Ghi ra file MIN.OUT gm mt dng ghi k ki t cn li to nn s nh nht.
V d:
MIN.INP

MIN.OUT

4
7mn04ngpt2012

0012

007. Xoa s
Bm rt yu thich s hc. Hin nay, Bm ang nghin cu v cc s to thnh bi vic ghp cc s nguyn
t lin tip li vi nhau. Theo , s th n c tinh cht ny c to thnh bng cch ghp s nguyn t th
nht, th hai, ..., cho n th n theo th t t tri sang phai. Cc s u tin ca day s c tinh cht ny l:
2, 23, 235, 2357, 235711,...
Bm ky hiu s th n ca day s l an.
Trong bi ton ny, bn cn lp trnh gip Bm xa k ch s ra khi s a n sao cho s cn li thu c l ln
nht c th.
D liu vao: t t p KDEL.INP
Gm mt dng duy nht cha hai s nguyn n v k (1 n 50000, k khng m v nh hn s ch s ca
an).
D li u ra: ghi vao t p KDEL.OUT
Gm mt dng duy nht cha s ln nht thu c sau khi xa ng k ch s ra khi s an.
Vi du:

KDEL.INP

KDEL.OUT

54

71

008. DY HP DN
Day 2k s nguyn gi l hp dn nu ca tng k phn t u ln tng k phn t cui u khng ln hn s
cho trc.
Yu cu: Cho n, s v cc phn t a1, a2, . . ., an (2 n 105, 1 s 2 109). Cc s ai u nguyn dng

v tng ca chng khng vt qu 2109. Vi mi i, i= 1 n, hay xc nh di day con hp dn di nht

gm cc phn t lin tip nhau bt u t phn t ai.
D liu: Vo t file vn ban INTEREST.INP:

Dng u tin cha 2 s nguyn n v s,

Dng th i trong n dng sau cha s nguyn ai.
Kt qu: a ra file vn ban INTEREST.OUT n s nguyn, mi s trn mt dng, s th i l di day con
th v gm cc phn t lin tip nhau bt u t phn t ai.
V d:

INTEREST.INP
83
1
1
1
1
1
1
1
1

INTEREST.OUT
6
6
6
4
4
2
2
0

009. V11WATER

Ngun: http://vn.spoj.com/problems/V11WATER/
Nm 2011, tnh trng ngp lt trong thnh ph tr ln nghim trng hn. V vy, mi ngi quyt nh xy
dng h thng mi che cho ton thnh ph.
Mi che c b rng l N, c chia lm N phn c di nh nhau. cao ca mi phn l h1, h2, ..., hn.
Khi tri ma, mt phn nc s ng li trn mi v mt phn s thot ra ngoi theo hai bn tri v phai ca
mi che. Do , thnh ph s khng phai chu canh ma lt nh trc.
Nhm mc ich bao tr mi che, bn cn vit chng trnh tinh lng nc ln nht c th ng li trn mi che.
D liu vao: t tp V11WATER.INP
+ Dng u ghi s N. (1 <= N <= 100000)
+ Dng sau ghi N s t nhin h1, h2, ..., hn. (1 <= hi <= 100000)
Gm mt s duy nht th hin lng nc tm c.
D liu ra: ghi vo tp V11WATER.OUT
+ Mt s duy nht th hin s lng nc tm c
Gii hn: 50% s test c N <= 1000.
Vi du:
V11WATER.INP
5
13123

V11WATER.OUT
3

Bai 1: DY S
Xt day s nguyn a1, a2, . . ., an , . . ., trong a1 = 1, an c xc nh nh sau: ao ngc th t
vit cc ch s ca an-1 (trong h c s 10) v cng thm 2 vo s nhn c.
Phn u ca day s ny c gi tr nh sau:
Ch s
1
2
3
4
5
Dy a
1
3
5
7
9
6
Yu cu: Cho s nguyn dng n. Hay xc nh an (1 n 10 ).

6
11

7
13

8
33

...
...

D liu vo: t file vn ban DAYSO.INP gm nhiu tests, mi test cho trn mt dng cha mt s nguyn n.
Kt qu: a ra file vn ban DAYSO.OUT, kt qua mi test a ra trn mt dng.
DAYSO.INP
1
12

DAYSO.OUT
1
77

Bai 2: TM S
Cho s nguyn X. Hay lp trnh tm s nguyn Y nh nht thoa man ng thi cc iu kin sau:
iu kin 1: Y ln hn X.
iu kin 2: S lng mi loi ch s c trong Y ng bng s lng loi ch s tng ng c trong X.
D liu: Vo t tp vn ban FINDNUM.INP gm duy nht s X (|X| 999999). Ch s u tin ca X khc 0.
Kt qu: Ghi ra tp vn ban FINDNUM.OUT s Y tm c. Nu khng c s Y nh vy, ghi ra s 0.
VI D
Test 2
Test 3
Test 4

FINDNUM.INP
330
-876200
100122

FINDNUM.OUT
0
-876020
100212

Bai 3: SU TP C
Bnh rt thich tr chi su tp c. Tr chi ny nh sau: u tin Bnh ch c mt mn c vi tui 1
ngy. Trong N ngy tip theo, ngy th i, cu ghi li tui ca mn c m mnh c sau cu b sung
thm mt vt c tui Xi ngy vo b su tp ca mnh. Cng vic tng chng n gian nhng khi s
lng c tng ln v c bit sau mi ngy tui ca mn c li tng ln 1. Bn hay vit chng trnh
gip Bnh xc nh tui ca mn c nht sau N ngy su tp
D liu vo t tp COLLECTO.INP vi cu trc nh sau
+ Dng u ghhi s N (N100000)
+ N dng tip theo, dng th i ghi s Xi
D liu ra ghi vo tp COLLECTO.OUT ghi mt s duy nht l tui ca mn c nht
Vi du:
COLLECTO.
INP
2
3
1

COLLECTO.
OUT
4

COLLECTO.
INP
4
1
1
2
2

COLLECTO.
OUT
5

Bai 4: Dy lin tuc

Day s A1, A2,,AN c gi l day s lin tc nu trong n c mt tt ca cc s t 1 n N. Cho trc
mt day s A1, A2,,AN. Hi phai thay bao nhiu s trong day c mt day lin tc.
D liu vao: Tp vn ban PERMU.INP

+ Dng u ghi s N (N

106)

+ N dng cn li vi dng i (i = 1..N) ghi s Ai (1 Ai 106)
D liu ra: Tp vn ban PERMU.OUT
Ch mt dng duy nht ghi s cc s cn thay i day a cho tr thnh day lin tc.
Vi du
PERMU.OUT
3
213

PERMU.OUT
0

PERMU.OUT
2
22

PERMU.OUT
1

Bai 5: COUNT N
Ngun bi: http://vn.spoj.pl/problems/COUNTCBG/

Vi 1 s t nhin N(1<= N <= 10^9) ta c th phn tich n thnh tng ca mt s s t nhin lin tip (tt
nhin nhng s ny phai nh hn N). Vi d vi N = 5 ta c duy nht 1 cch phn tich l 5 = 2+3. Bi ton t ra
l cho s t nhin N, hay cho bit c bao nhiu cch phn tich s t nhin N thnh tng ca cc s t nhin lin
tip.
D li u vao t t p COUNTCBG.INP
Gm nhiu dng`, mi dng cha mt s nguyn N. (Gii hn : s dng <= 100)
D li u ra ghi vo t p COUNTCBG.OUT
Mi dng ghi mt s nguyn l s cch phn tich s N c c dng tng ng trong input.
Vi du:
COUNTCBG
.INP
12
5
4
13
45
100
234
3
175

2n=(x+y)*(y-x+1)
t x+y=i => y-x+1=2n div i

COUNTCBG.
OUT
1
1
0
1
5
2
5
1
5

Bai 6. DY S
Steve khng tp trung t tng trong gi ton v vy thy gio cho thm bi tp v nh rn luyn kha nng
tp trung t tng v tinh cn thn chu o.
Ni dung bi tp l cho n xu ch bao gm cc ky t la tinh thng v ch s. on cc ky t s lin tc to
thnh mt s nguyn. mi on ky t s lin tc Steve phai trich ra s ln nht c th, sp xp cc s nhn
c t cc xu a cho v a ra theo th t khng giam, mi s c a ra di dng khng c cc s 0
khng c ngha.
Vi d, vi n = 1 v xu l 01a2b3456cde478 day s cn a ra l 1, 2, 478, 3456.
Yu cu: Cho s nguyn n (1 n 100) v n xu, mi xu c di khng qu 100. Hay a ra day s
nhn c a sp xp theo th t khng giam, mi s trn mt dng.
D liu: Vo t file vn ban NUMBERS.INP:
+ Dng u tin cha s nguyn n,
+ Mi dng trong n dng sau cha mt xu ch gm cc ky t la tinh thng v s.
D liu am bao c khng qu 500 s c tch ra.
Kt qu: a ra file vn ban NUMBERS.OUT day s nhn c a sp xp theo th t khng giam, mi s
trn mt dng.
V d:
NUMBERS.INP
NUMBERS.OU
T
4
0
43silos0
2
zita002
2
le2sim
43
231233
231233
Bai 7. WCALC
Ngun bi: http://vn.spoj.com/problems/WCALC/
Khi cn b, cc bn hc sinh hc c cch tr phn s bng cch quy ng mu s, ri mi thc hin php

tr:

5 9 15 9
6 1

4 12 12 12 12 2

Nhng mt ln, An tinh th hiu hai phn s bng cch ly hiu hai t s v hiu hai mu s v thy tht

ngc nhin l kt qua vn ng:

5 9
59
4 1

4 12 4 12 8 2

An thy tinh cht ny tht k diu v An mun bit, vi phn s cho trc, c bao nhiu cp gi tr a>=0 v

m>=0 sao cho:

a b ab

m n mn

D li u vao: t t p vn ban WCALC.INP: Mt dng cha hai s nguyn dng b v n cch nhau it nht
mt du cch (1 <= b, n <= 10^6; trong 50% s test b, n <= 1000).
D li u ra: ghi vo t p vn ban WCALC.OUT mt s nguyn duy nht l s lng cp (a,m) tinh c.

Vi du:

WCALC.INP

WCALC.OUT

9 12

+ Tch cc xu s, a vo mang A c Na xu s {0003,0003,4563}

A=rng// Na:=0; vi Na l s lng phn t ca A
Tch xu S;
St=;S:=S+a;
For i:=1 to length(S) do
If S[i] l ch s then St:=St+S[i]
Else if st<> then begin
Inc(Na);A[Na]:=st;st:=;
End;
Vi d: S= 43lios0a
+ Tm di max ca xu di nht
+ A[i]=0+A[i] sao cho length(A[i])=max
+ Sp xp tng

Bai 1: PALINDROME VNG

Palindrome l xu dc t tri sang phai cng ging nh c t phai sang tri, vi d xu madam. T mt
xu ngi ta c th to ra xu mi bng cch y vng mt s ln: a ky t cui xu v ghi u xu. Vi d,
t xu array, bng cch y vng ta c th nhn c cc xu:

array yarra ayarr rayar rraya

Trong s cc xu nhn c c mt xu l palindrome. Trong trng hp ny ngi ta ni array l mt
xu palindrome vng. Ban thn xu palindrome cng l xu palindrome vng (vi s ln y vng bng 0).
Yu cu: Cho xu S khng qu 100 ky t. Hay xc nh xem S c phai l xu palindrome vng hay khng.
D liu: Vo t file vn ban PALIN.INP gm mt dng cha xu S.
Kt qu: a ra file vn ban PALIN.OUT

+ Nu S l xu palindrome vng th ghi s ln it nht cn phai y vng

+ Nu S khng phai l palindrome vng th ghi -1
V d:

PALIN.INP
array

PALIN.OUT
3

Bai 2: T ONG
T ong bao gm nhiu ging nhau hnh lc bt. Cc ny , cha mt, sp, ong non, . . . Ban u ong
xy mt . Sau xy tip cc k cnh vi ban u, lm thnh lp th hai, sau xy tip cc k cnh vi
lp th hai, lm thnh lp th 3, . . .
Ngi ta tm thy mt t ong ln c ti n lp. Hay xc nh s ca t ong tm thy.

D liu: Vo t file vn ban BEEHIVE.INP gm mt dng cha s nguyn n (1 n 109).

Kt qu: a ra file vn ban BEEHIVE.OUT mt s nguyn s lng trong t ong.
V d:
BEEHIVE.IN
P
4

BEEHIVE.OU
T
37

Bai 3: DY S
Cho day s F di v tn. Nguyn tc xy dng day F rt n gian.
+ F[1] = 1
+ Vi i > 1, u tin ta ly F[i] = F[i - 1] * 2, sau sp xp cc ch s trong F[i] theo th t tng dn. (Cc
ch s 0 u F[i], ta coi nh l khng c ngha v c th xa i).
Nh vy, cc s u tin trong day s F l: 1, 2, 4, 8, 16, 23, 46, 29, 58, ...
Cho s n, bn hay tm s F[n]. Bit rng s lng ch s ca F[n] lun nh hn 106.
D liu vao: t t p C11SEQ3.INP cha m t s nguyn dng duy nht l n (1 n 106).
D li u ra: ghi vo t p C11SEQ3.OUT mt s nguyn dng duy nht l s cn tm.
Vi du:
C11SEQ3.INP C11SEQ3.OUT
7
46
Bai 4: FIND THE COW!
C b Bessie a trn thot v ang trn mt i ni vi nhng ng c cao. Nng dn John (FJ), ngi
ang mun tm kim Bessie, a quyt nh b trn ng c bng tay v u gi tm ra du vt ca Bessie.
Khng may thay, ng ta c m t cht vn vi vic tm kim Bessie: Day c trc mt FJ trng nh mt
chui ngoc n c di N (1 N 50,000); vi d: )((()())()) FJ bit rng chn sau ca Bessie ging nh mt
cp du m ngoc n ((, v chn trc ca c ta ging nh mt cp du ng ngoc n )). V tri ca Bessie
c th c din ta bi m t cp x < y , trong (( c tm v tri x, v )) c tm v tri y. Hay m c bao
nhiu v tri m Bessie c th ang ng.
D li u
vao: ghi t t p COWFIND.INP ghi mt chui ngoc n c di l N
D li u ra: ghi vo t p vn ban COWFIND.OUT m t s nguyn cho bit v tri Bessise ang ng
Vi d:
COWFIND.INP COWFIND.OUT
)((()())())
4
Gii thich: Cc v tri Bessise c th ng l: 1. )((()())()) 2. )((()())()) 3. )((()())()) 4. )((()())())
Bai 5: BI TON DIN TICH TAM GIC
Cho mt hnh ch nht ABCD, cnh AB=a, cnh BC=b. a,b l cc s nguyn dng trong khoang [1, 100]
Mt im M chy trong on BC vi BM=x . x l s nguyn dung trong khoang [0, b], mt im N chy
trong on CD vi CN=x
Tinh gi tr ln nht v gi tr nh nht ca din tich tam gic AMN khi
M, N lu ng.
D liu vo: c cho trong tp tin CHUNHAT.inp, gm mt dng
ghi hai s nguyn dng ln lt l a, b. Hai s cch nhau mt khoang
trng
D liu ra : Yu cu xut ra tp tin CHUNHAT.out, gm bn dng:
+ Dng u l gi tr ln nht ca din tich tam gic AMN (mt
ch s thp phn)
+ Dng th hai l mt gi tr ca x din tich tam gic AMN t
gi tr ln nht
+ Dng th ba l gi tr nh nht ca din tich tam gic AMN (mt ch s thp phn)
+ Dng th t l mt gi tr ca x din tich tam gic AMN t gi tr nh nht
Vi du:
CHUNHAT.INP
CHUNHAT.OUT
10 6
30.0
0
17.5

5
Bai 6: VIP-NUMBER
Cho mt bang A l mt li vung kich thc NxN (3N1000) gm cc s nguyn dng khng qu
1000. Ta gi giao ca dng i ct j l A[i,j] vi (1i,jN). Mt Vip-Number c nh ngha l phn t ln
nht so vi cc k cnh ca n. Vi d A[i,j] cha Vip-Number nu Max (A[i-1,j] ; A[i,j-1] ; A[i+1,j] ;
A[i,j+1]) < A[i,j] v (1<i,j<N).
Yu cu: Cho trc mt s nguyn dng N l kich thc ca bang A, yu cu m s lng Vip-Number
trong bang A.
D liu: Cho bi file vn ban VIPNUM.INP:
+ Dng u cha s nguyn dng N.
+ N dng sau, mi dng gm N s nguyn dng biu din bang.
Kt qu: Ghi ra file vn ban VIPNUM.OUT gm mt dng duy nht l kt qua tm c.
Vi du:
VIPNUM.INP VIPNUM.OUT
4
2
1211
1321
1252
1325
Bai 7: THIT K LP HC TRT TUYT
Nng dn Jonh (FJ) c N (2N1000) ngn i, mi ngn i c chiu cao l mt s nguyn trong phm vi
t 1 n 100. Trn nhng ngn i ny c rt nhiu tuyt bao ph v vy FJ quyt nh m lp hc trt tuyt
cho cc con b ca ng.
Tht khng may FJ nhn c d n thay i cch thu thu ca chinh ph trong nm ti, theo d n th
chinh ph s nh thu nhng ngi nng dn rt cao nu nh chnh lnh gia ngn i cao nht v thp
nht ln hn 17.
Bit c s h ca d n ny FJ quyt nh cai to li mt s ngn i ca mnh sao cho chnh lnh
gia ngn i cao nht v thp nht nh hn hoc bng 17, c nh vy mi khng b nh thu
Bit rng chi phi tin thay i cao ca mt ngn i t A thnh B l (A-B) 2 n v. Hay gip FJ chn
nhng qua i thay i cao sao cho chi phi l it nht
D liu vao: t tp SKINDESIGN.INP
+ Dng u tin cha s nguyn dng N
+ N dng tip theo mi dng cha mt s nguyn Ai th hin cao ca qua i th i
D liu ra: ghi vo tp SKINDESIGN.OUT mt s nguyn duy nht l chi phi nh nht tm c
Vi du:
SKINDESIGN.INP SKINDESIGN.OUT
5
18
20
4
1
24
21

Bai 8: ZIC-ZAC (gi)

Lp trnh to ma trn kich thc NxN.
Vi d vi N=5
1
3
4
10
11

2
5
9
12
19

6
8
13
18
20

7
14
17
21
24

15
16
22
23
25

1
16
15
14
13

2
17
24
23
12

3
18
25
22
11

4
19
20
21
10

5
6
7
8
9

Bai 9: XOY
Lp trnh to ma trn kich thc NxN.
Vi d vi N=5

Bai 1: Chia on mt dy s
Cho day s t nhin A1, A2,,AN. Hay tm cch chia day s trn thnh nhiu on nht sao cho tng cc s
trong tt ca cc on con u bng nhau
D liu vao: t tp vn ban CHIA.INP
+ Dng u tin ghi s N
+ Dng th 2 ghi N s A1, A2,,AN. Cc s cch nhau 1 ky t trng
D liu ra: ghi vo tp vn ban CHIA.OUT hai s K v S, trong K l s on chia c v S l tng ca
mi on. Trong trng hp khng th chia c th K=0 v S=0
Vi du:
CHIA.INP CHIA.OUT
6
38
351780
Bai 2: Sp xp xu.
Ngi ta nh ngha: T l mt nhm ky t lin tip khng cha ky t trng
Cho mt xu St gm cc ky t ly t tp a .. z v du cch. Xu khng qu 20 t, mi t di khng
qu 10 ky t.
Yu cu: Sp xp cc t ca xu ky t theo th t khng giam ca di cc t trong xu St.
D liu vo: Cho trong file vn ban SAPXAU.INP, c cu trc:
- Dng 1: Ghi mt xu ky t St (c it nht 1 t).
D liu ra: Ghi ra file vn ban SAPXAU.OUT, theo cu trc:
- Dng 1: Ghi cc t ca xu ky t sau khi c sp xp. Cc t c ghi cch nhau ng mt du cch.
V d:
SAPXAU.INP
SAPXAU.OUT
acb abcde abcd abc
acb abc abcd abcde
Bai 3: Dy con lin tip
Cho day s nguyn dng gm N phn t A1, A2,, An.
Yu cu: Hay lit k tt ca cc day con gm cc phn t ng lin tip ca day trn sao cho tng gi tr cc
phn t ca day con bng M.
D liu vo: Cho trong file vn ban DAYCON.INP, c cu trc nh sau:

- Dng 1: Ghi 2 s nguyn dng N v M. Hai s c ghi cch nhau it nht mt du cch. (1 N 1000; 1

32000)

- Dng 2: Ghi N s nguyn dng Ai. Cc s c ghi cch nhau it nht mt du cch. (1 Ai 10000 )
D liu ra: Ghi ra file vn ban DAYCON.OUT, gm nhiu dng. Mi dng ghi mt day con tm c. Cc day
con c ghi theo th t xut hin ca n trn day ban u. Cc s trn cng mt dng c ghi cch nhau it
nht mt du cch.
Nu khng tm c day con tha man iu kin th ghi ra file mt s: 0.
V d:
DAYCON.INP
DAYCON.OUT
11 6
312
14312165141
6
51
141
56
0
12521
Bai 4: Bin i s
Xt mt s N c 4 ch s v khng phai tt ca cc ch s u ging nhau. Php tinh lch c thc hin nh
sau:

+ To s th nht N1 bng cch xp cc ch s theo trnh t giam dn

+ To s th hai N2 bng cch xp cc ch s theo trnh t tng dn (nu c ch s 0 u th N2 s
khng phai l s c 4 ch s)
+ Tinh hiu N1-N2 v gn li cho N
Cc bc trn c thc hin cho n khi nhn c s N l 6174 hoc 0
Vi d: Nu N=1023
+ bc 1: N1=3210, N2=123, N=N1-N2=3087
+ bc 2: N1=8730, N2=378, N=N1-N2=8352
+ bc 3: N1=8532, N2=2358, N=N1-N2=6174
Vy ta cn thc hin 3 ln bin i
Yu cu: Hay xc nh s ln bin i thc hin theo yu cu trn.
D liu vao: t tp BIENDOI.INP ghi s nguyn dng N
Kt qu ra: ghi vo tp BIENDOI.OUT mt s nguyn duy nht cho bit s ln bin i
Vi du:
BIENDOI.INP
BIENDOI.OUT
5364
3

1
1
1
2
3
1
2
3
1
1
Nu length(A[i])=length(A[i-1]) th B[i]=B[i-1]+1 else B[i]:=1;

3
2

Bai 1: S rn hai u
S rn hai u l mt s nguyn dng N sao cho: Khi thm hai ch s a, b vo hai u s N y (theo

aNb 99 N

aNb

dng
) s c s mi c gi tr nng ln 99 ln. Tc l:
.
Yu cu: Cho trc hai ch s nguyn a, b (0 a, b 9). Tm S rn hai u N.
D liu vo: Cho trong tp vn ban TWOHEAD.INP gm 2 s a, b cch nhau mt du cch.
Kt qu: Ghi vo tp vn ban TWOHEAD.OUT cha s N cn tm. Trong trng hp c nhiu hn mt s N
tha man, hay a ra s b nht. Cho bit d liu vo lun tn ti kt qua.
V d:
TWOHEAD.INP
81

TWOHEAD.OUT
9

K=s lng ch s ca B
A*10m+k+N*10k+b=99N
=> a*10m+1+b=89 *N
For m:=0 to 9 do
If (a*10m+1+b) mod 89) then
Begin
Writeln(a*10m+1+b) div 89);
Break;
End;
10m+1=(89N-b)/a
Bai 2. B S PY TA GO
Mt b ba s t nhin c gi l b s Py-ta-go nu tha man iu kin: bnh phng mt s bng tng
bnh phng hai s cn li.
Vi d: B s (3, 4, 5) l mt b s Pytago v : 52=32+42.
Cho s nguyn dng N. Yu cu hay phn tich N thnh tng ca mt b s Pytago
D liu vao: T tp PYTAGO.INP cha s nguyn N (1N106)
Kt qu ra: ghi vo tp PYTAGO.OUT s lng b s Pytago tch c
Vi du :
PYTAGO.INP PYTAGO.OUT
Gii thich
30
1
30 5 12 13
M 132=52+122

A2+b2=c2
N=a+b+c
Bai 3. Nguyn liu sn xut
Mt ngi dng s tin l U -la v V Euro mua mt loi nguyn liu san xut. C N cng ty nc
ngoi bn nguyn liu trn c nh s t 1 n N. Cng ty th i (1iN) c gi bn Ai -la/1 kg nguyn liu
v Bi Euro/1 kg nguyn liu. Tuy nhin, ti mi cng ty ch bn nguyn liu cho mt khch hng hoc theo la, hoc theo Euro. Hay gip ngi tm cch chn ra 2 cng ty mua hng sao cho s lng nguyn liu
san xut c th mua c l nhiu nht.
D liu vao: T tp vn ban PROMATE.INP
+ Dng u cha 3 s nguyn: N U V (1N, u, v1000)
+ N dng tip theo cha N cp s nguyn Ai, Bi (1Ai, Bi1000), mi cp trn mt dng.
D liu ra: Ghi vo tp vn ban PROMATE.OUT S lng nguyn liu S(kg) ngi mua c vi 2
ch s thp phn.
Vi du :
PROMATE.INP PROMATE.OUT
3 2 5
S = 1.92
6 4
3 5
8 7
Giai thich vi d: Ngi mua nguyn liu ca cng ty th 2 bng -la v mua nguyn liu ca cng ty th
nht bng Euro S=2/3+5/4=1.92
Max:=0;
For i:=1 to N do
For j:=1 to N do
If(i<>j)and(u/A[i]+v/B[j]>max) then max:= u/A[i]+v/B[j];
Bai 4. S PHONG PH
Ngun bai: http://vn.spoj.pl/problems/NKABD/
Trong s hc, s phong ph l cc s m tng cc c s ca s (khng k chinh n) ln hn s . Vi
d, s 12 c tng cc c s (khng k 12) l 1 + 2 + 3 + 4 + 6 = 16 > 12. Do 12 l mt s phong ph.
Yu cu: Bn hay lp trnh m xem c bao nhiu s phong ph trong on [L,R].
D liu vao: t t p NKABD.INP gm 2 s L, R (1LR105)
D li u ra: ghi vo t p NKABD.OUT l s lng s phong ph trong on [L, R].
Vi du
NKABD.INP
NKABD.OUT
1 50
9
Gii thich:
T 1 n 50 c 9 s phong ph l:
12, 18, 20, 24, 30, 36, 40, 42, 48
Tinh tng c ca N
Tong:=1;
For i:=2 to trunc(sqrt(N)) do
If N mod i then tong:=tong+i+N div i;

Bai 1: TM S NGUYN T
Ngun bi: http://vn.spoj.pl/problems/PNUMBER/
Yu cu: Hay tm tt ca cc s nguyn t trong on [A,B]
D liu vo t t p PNUMBER.INP gm 2 s A, B nm trn 1 dng v cch nhau bng 1 ky t trng.
1AB200000;
D liu ra ghi vo t p PNUMBER.OUT ghi ra cc s trong on [A,B] mi s trn m t dng
V d:
PNUMBER.INP
PNUMBER.OUT
1 10
2
3
5
7
2
3
4
5
6
7
8
9
10
11
12
true
true
False
true
False
False
False
False
False
Mang 1 chiu: A:array[1.200000] of boolean;
true;
For i:=2 to 200000 do
If A[i]=true then
Begin
J:=i*2;
While j200000 do
Begin
A[j]:=false;
J:=j+i;
End;
For i:=a to b do if A[i] then write(i:6);
Sng s nguyn t
Bai 2. S THN THIN
S t nhin c rt nhiu tinh cht th v. Vi d vi s 23, s ao ngc ca n l 32. Hai s ny c c
chung ln nht l 1. Nhng s nh th c gi l s thn thin, tc l s 23 c gi l s thn thin, s 32
cng c gi l s thn thin.
Yu cu: hay m xem trong khoang t a n b (k ca a v b) c bao nhiu s thn thin. (10ab30000)
D liu vao: t t p NKNUMFRE.INP gm mt dng cha 2 s a,b. Hai s c cch nhau bng mt
khoang trng
D li u ra ghi vo t p NKNUMFRE.OUT
Bao gm mt s nguyn l kt qua ca bi ton.
Vi du
NKNUMFRE.INP
NKNUMFRE.OU
T
20 30
3
Bai 3: WORD COUNTING
Nguyn ang vit mt phn mm m t trong mt xu ky t. Cu cam thy bun chn sau khi vit xong
phn mm rt nhanh. By gi, cu mun tm P l s lng ln nht cc t c di bng nhau ng lin tip
trong xu cho trc.

Cho mt xu ch cha cc ky t t a n z v ky t trng. Mi t l mt chui cc ky t lin tip khc ky t

trng v cc t phn tch nhau bi it nht mt ky t trng. Nhim v ca bn l vit chng trnh gip Nguyn
tm s P ni trn.
D liu vao: t t p WORDCNT.INP
D liu vo gm nhiu b d liu tng ng vi nhiu test. Dng u tin cha mt s nguyn dng
khng ln hn 20 l s lng cc b d liu. Cc dng tip theo cha cc b d liu.
Trn mi dng tip theo cha xu ky t c khng qu 1000 t tng ng vi mi b d liu, mi t c
khng qu 20 ky t.
D liu ra: ghi vo t p WORDCNT.OUT
Vi mi b d liu, ghi ra trn mt dng s P m Nguyn mun tm.
Vi du
WORDCNT.INP
WORDCNT.INP
2
3
a aa bb cc def ghi
5
a a a a a bb bb bb bb c c

Bai 3: Tr chi th bong

Cho mt bang hnh ch nht kich thc MxN, M l s dng, N l s ct, cc dng v ct giao nhau thnh cc .
Mi ban u l rng hoc c bc tng. Minh tha bng vo dng u tin ca mt ct no . Qua bng
ri theo quy lut sau:
+ Nu vung phia di qua bng l bc tng hoc qua bng a dng cui cng ca ct th qua bng s
nm
+ Nu vung phia di qua bng l rng th qua bng s di chuyn xung vung
+ Nu vung phia di cha mt qua bng khc th qua bng ny s di chuyn nh sau:
- Nu vung bn tri v phia di ca qua bng l rng th qua bng s trt qua vung bn tri v ri
xung
- Nu qua bng khng trt c sang tri v vung bn phai phia di rng th qua bng s trt qua
phai
+ Cc trng hp cn li qua bng nm yn khng di chuyn
Minh s khng tha nhng qua bng khc khi qua bng trc ang di chuyn
Yu cu: Vit chng trnh m ta bang sau khi Minh tha tt ca cc qua bng vo bang
Ch y: Minh s khng bao gi tha bng vo ct m trn cng khng rng
D liu vao: T tp vn ban THABONG.INP
+ Dng u tin cha 2 s nguyn dng M v N (1M30000; 1N30)
+ M dng tip theo mi dng cha N ky t m ta trng thi ban u ca bang. Ky t . m ta trng thi
rng, ky t X m ta trng thi c bc tng
+ Dng k tip cha s nguyn K (1K100000) l s bng Minh tha
+ K dng tip theo mi dng cha mt s nguyn trong phm vi t 1 n N l ct m Bnh tha bng, Bnh tha
bng theo th t ca d liu vo
D liu ra: ghi vo tp vn ban THABONG.OUT gm M dng mi dng cha N ky t m ta trng thi cui
cng ca bang. Qua bng c biu din bng ky t O
Vi du:
THABONG.INP THABONG.OUT
THABONG.INP THABONG.OUT
54
.
76

.
O

O..
.
X

XX.
X
.
XX.

.
OOO.

.OO
.

.XX
4
.XX
O..O.O
1

1
6
1
1
1
4
4
6
4
4

 KIM TRA TH
Bai 1: Xp gch
Minh rt thich tr chi xp cc chic hp hnh vin gch. Minh t cc vin gch chng ln nhau v xy
thnh nhiu chng c cao khc nhau. Mt lt sau Minh mun xp li tt ca cc chng sao cho s lng
chng khng thay i nhng s lng cc hp trn mi chng bng nhau. Hay cho bit Minh cn di chuyn it
nht bao nhiu chic hp. Vi d: cc chic hp trc v sau khi xp

Trc khi di chuyn

Sau khi di chuyn
D liu vao: T tp vn ban XEPGACH
+ Dng u tin ghi s nguyn dng N cho bit s lng chng gch
+ Dng th 2 ghi N s nguyn dng, s th i ghi s lng vin gch trn chng th i. Lu y rng tng s
vin gch bao gi cng chia ht cho N
D liu ra: ghi vo tp vn ban XEPGACH.OUT mt s nguyn duy nht cho bit s lng vin gch it
nht cn di chuyn
Vi d:
XEPGACH.INP XEPGACH.OUT
6
5
524175
Bai 2: Tam gic s
Hnh sau m ta mt ban tam gic vi cc s nguyn khng m
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5
Hay vit chng trnh tinh tng ln nht cc s trn ng i t nh tam gic v kt thc ti mt im
no y tam gic. Bit:
+ Mi bc i ta c quyn i xung bn tri hoc bn phai ca s
+ S hng trong tam gic ln hn 1v 100
+ Cc s trong tam gic u l s nguyn khng m v 100
D liu vao: T file TAMGIAC.INP gm
+ Dng u ghi gi tr N (s lng cc dng trong tam gic)
+ Dng i+1 (1iN) ghi i s
Cc s cch nhau it nht mt khoang trng
D liu ra: Ghi vo file TAMGAC.OUT gm mt s duy nht l tng ln nht tm c
Vi du:
TAMGIAC.INP TAMGIAC.OUT
5
30
7
3 8
8 1 0
2 7 4 4
4 5 2 6 5

Bai 3: Thi u
Bang kt qua thi u vng trn ca mt giai v ch bng gm N i bng c cho bi ma trn vung
cp N, trong tt ca cc phn t thuc ng cho chinh bng 0, cn cc phn t khc c th bng 3, 1
hoc 0. l s im ca cc trn u: 3 thng, 1 ha, 0 thua.
1. Hay tm ch s ca cc i khng thua trn no
2. m s trn thng, thua, ha v tng s im ca tng i v in ra danh sch theo th t giam dn ca
tng s im
D liu vao: File vn ban THIDAU.INP gm N+1 dng
+ Dng u l N
+ N dng tip theo, dng th i cha N s l s im cc trn u ca i th i. Mi s cch nhau it nht mt
ky t trng
D liu ra: File vn ban THIDAU.OUT
+ Dng u tin ghi ch s ca cc i khng thua trn no, cc s c xp theo chiu tng v cch nhau it
nht mt ky t trng
+ Cc dng cn li l danh sch cc i c sp xp theo th t tng im giam dn, c 4 ct: S th t
ca i, s trn thng, s trn ha, s trn thua v tng s im
Vi du:
THIDAU.INP
5
01001
10000
33001
33301
13110

THIDAU.OUT
45
Stt
4
3
5
1
2

Thang
3
2
1
0
0

Hoa
1
1
3
2
1

Thua
0
1
0
2
3

Diem
10
7
6
2
1

Bai 1: ng i cc i
Ti mt x s n, nh vua ban hnh mt lun rt k l, tha bng t nhn, nh vua ra lnh xy dng mt
li A c kich thc MxN, trn mi nt li ghi mt s nguyn. Mt ngi xut pht t mt nt li ca ct 1,
ch cn sang c ct N ( no cng c). Quy tc l t nt A[i,j] c th di chuyn qua c 1 trong 3 nt
A[i,j+1]; A[i+1,j+1]; A[i-1,j+1]. Nu t nhn no i ht li A (n ct cui cng) m tng cc s i qua l ln
nht th c tha bng
Yu cu hay tm mt ng i tha man quy tc ca nh vua ra gip t nhn c tha bng
D liu vao: t tp vn ban MAXPATH.INP
+ Dng u tin cha 2 s M v N
+ Trong i dng tip theo mi dng cha N s nguyn l gi tr N s ca hng i trn li tng ng vi cc
ct t 1 n N
D liu ra: ghi vo tp vn ban MAXPATH.OUT ghi mt s nguyn duy nht c bit tng ln nht tm c
Vi du:
MAXPATH.INP
MAXPATH.OUT
45
35
12679
76567
12342
47876
Bai 2: Dy s
Cho 2 day s: A c n phn t, B c m phn t, cc phn t l cc s nguyn x
Tinh s lng gi tr trong A m c mt trong B
Yu cu: vit ra s lng tm c
D liu vao: File AB.INP c dng u l hai s n v m
T dng th 2 ln lt l n s ca day A v m s ca day B
0<m,n<105, |x|<109
Kt qu ra: File AB.OUT gm 1 dng ghi s lng tm c
AB.INP
34
2567556

AB.OUT
2

Bai 3: GOING ONCE, GOING TWICE, GONE!

Ngun bi: http://vn.spoj.pl/problems/AUCTION/
Ch n king ca n b khin cho nng trang ca nng dn John di ra 1 s lng c kh, v vy anh ta
mun bn u gi s c kh ny trang trai phn no chi phi chn nui. Anh ta c N (1 <= N <= 1,000) b c
kh ging nhau; khch hng s u gi mua ng c ny l M (1 <= M <= 1,000) nng dn khc sng gn
.
Mi mt nng dn i s cho nng dn John bit anh ta sn sng tra P_i (1 <= P_i <= 1,000,000) ng cho 1
b c kh. Mi mt nng dn ch mun mua 1 b c kh m thi.
am bao cc nng dn khng ghen t vi nhau, nng dn John s a ra 1 mc gi c nh cho tt ca ngi
n mua v bn cc b c kh cho nhng ai tra gi >= mc gi , nhng ngi cn li s b t chi giao dch.
Hay gip nng dn John tinh xem t mc gi nh nht l bao nhiu thu c nhiu tin nht c th.
D liu vao: t t p AUCTION.INP
+ Dng 1: Hai s nguyn cch nhau bi du cch: N v M
+ Dng 2..M+1: Dng i+1 cha 1 s nguyn duy nht: P_i

D li u ra: ghi vo t p AUCTION.OUT

Gm m t dng duy nht cha 2 s nguyn cch nhau bi du cch: gi bn ca John v s tin m John thu
c
Vi du:
AUCTION.INP
AUCTION.OU
T
54
7 21
2
8
10
7
Bai 4. MINNUM
Cho s nguyn X cha khng qu 1000 ch s, hay tm s nguyn Y sao cho Y l s nh nht c gi tr ln
hn X, trong cc ch s ca Y c ly t t p cc s nguyn phn bi t nhau {d1, d2,d10} trong 0dk9;
k10.
D li u vao: T t p vn ban MINNUM.INP
+ Dng u cha s nguyn K
+ Dng th 2 cha K s, s th i l gi tr ca di
+ Dng th 3 cha s nguyn X
D li u ra: ghi vo t p MINNUM.OUT l s nguyn Y tm c
Vi du:
MINNUM.INP MINNUM.OUT
3
30
305
18
Bai 5: CCH NHIT
Ngun bi: http://vn.spoj.pl/problems/INSUL/
Cho mt day N vin gch ln lt c cch nhit l cc s a 1.. aN. Nu xp ln lt cc vin gch theo trnh t
th cch nhit ca khi l a 1 + a2 + ... + aN + max(0, a2 - a1) + max(0, a3 - a2) + ... + max(0, aN - aN - 1). Nhim
v ca bn l tm cch xp sao cho cch nhit ca ca khi l ln nht c th.
D liu vao: t t p INSUL.INP
+ Dng u ghi s nguyn dng N (0 < n 10^5).
+ N dng sau mi dng ghi mt s ai ( 1 i N v 1 ai 10000).
D li u ra: ghi vo t p INSUL.OUT
Ghi trn mt dng kt qua cn tm.
Vi du:
INSUL.INP INSUL.INP
4
24
5
4
1
7

Bai 1. NHN
C 9 hng gch sp xp thnh mt hnh tam gic, hng th i c i vin (Xem hnh di). Mi vin gch v tri l
thuc hng l c gn mt nhan l mt s nguyn khng m.
Yu cu: Hay xc nh nhan ca cc vin cn li, bit rng, tr
hng cui cng, nhan mi vin gch bng tng nhan cc vin m
n ln hng di v nhan l s nguyn khng m.
D liu: Vo t file LABEL.INP:

Dng u tin cha s nguyn T s lng Tests,

Mi test cho trn 5 dng, ghi nhan ca cc vin v tri l

thuc hng l.
Kt qu: a ra file LABEL.OUT: kt qua mi test a ra trn 9 dng xc nh nhan ca mi vin gch.
V d:
LABEL.INP
2
255
54 67
10 18 13
3352
21211
256
64 64
16 16 16
4444
11111

LABEL.OUT
255
121 134
54 67 67
23 31 36 31
10 13 18 18 13
5 5 8 10 8 5
3235532
21123211
201021101
256
128 128
64 64 64
32 32 32 32
16 16 16 16 16
888888
4444444
22222222
111111111

Bai 2. CARO
Cc bn tr tm thy mt cun v nh ai qun trn gh cng vin. Trong cun v ny ch c cc
dng s kh hiu. Ban u cc bn ca chng ta ngh y l thng bo ma ha ca mt ip vin no nh
chuyn cho mt ngi khc v ang tm cch x ly, nhng may qu, ngi ch cun v a quay li tm v giai
thich y ch l ghi chp cc nc i ca mt vn u trong tr chi ca r gia 2 ngi trn trng ca r v hn.
Ngi th nht dng du cho, ngi th hai ch o, mi ngi n lt mnh i s nh du ca mnh vo
mt trng ty chn. Ai to c trc day t 5 ky hiu tr ln ca mnh theo chiu dc hoc ngang hay cho
th s thng.
Cc bn tr b thu ht bi vn u v mun xc nh xem ai a thng.
Yu cu: Cho n s nc i ca vn u (0 n 10 000), ta cc ca mi nc i, cho theo trnh t thc
hin nc i. Hay cc nh xem ai thng vn u ny hoc kt qua l ha, a ra thng bo tng ng First
player won hay Second player won hoc Draw. Nu sau mt nc i no a xc nh c ngi thng
nhng ngi chi vn c tip tc thc hin nc i th thng bo Inconsistent.
D liu: Vo t file vn ban CARO.INP:
Dng u tin cha s nguyn n,
Mi dng trong n dng sau cha 2 s nguyn x v y xc nh ta c i (|x|, |y| 109).

Kt qu: a ra file vn ban CARO.OUT dng thng bo xc nh c.

V d:
CARO.INP
9
11
12
22
23
33
34
44
45
55

CARO.OUT
First player won

Bai 3. GI TH
Ngun bi: http://vn.spoj.pl/problems/NKLETTER/
V Gim c cng ty XYZ cn gi m t vn ban quan trng ti m t i tc ca mnh. Vn ban l m t xu S
cc ch ci la tinh in thng. bao mt n i dung vn ban, ng Gim c gi 2 bc th. Bc th th nht l
phn u Sb ca xu S, bc th th 2 l phn cui Se ca S. Hai bc th Sb v Se am bao y n i dung ca
S, tuy nhin c th m t phn cui ca Sb c th c vit l p li trong phn u ca Se, song s ki t c vit
l p li khng bit trc.
Vi d: vi vn ban S=truongnguyenduquannhat to ra hai bc th:
Sb=truongnguyendu
Se=nguyenduquannhat
Sb=truongnguyendu v Se=nguyenduquannhat
Yu cu: Cho hai xu Sb v Se, hay xc nh m t xu S c th l n i dung ca bc th sao cho di ca
xu S l ngn nht.
D li u vao t t p vn ban NKLETTET.INP
+ Dng u cha xu Sb
+ Dng th hai cha xu Se. Mi xu c di khng qu 250.
D li u ra ghi vo t p NKLETTER.OUT
Ghi ra di ca xu S tm c.
Vi du:
NKLETTER.INP
NKLETTER.OUT
truongnguyendu
22
nguyenduquannhat

1. PHN MY THC TP
Trung tm my tinh cn phn my thc hnh cho N lp sinh vin (c nh s t 1 n N). Lp sinh vin i
c Xi sinh vin. Trong trung tm c M (M N) phng my c nh s t 1 n M. Phng my j c Yj my.
am bao vic hng dn thc hnh, mi sinh vin cn c mt my, ngoi ra cn cn mt my cho gio vin
hng dn. Khng c php di chuyn my t phng my ny sang phng my khc.
Yu cu: Xc nh s lng ln nht cc lp sinh vin c th ng thi phn b mi lp vo mt phng
my v sao cho trong mi phng my mi sinh vin c mt my ring lm vic v ngoi ra cn mt my
dnh cho gio vin hng dn.
D liu: Vo t file vn ban c tn COMASIGN.INP:
+ Dng u tin cha hai s nguyn N, M (1 N M 1000);
+ Dng th hai cha N s nguyn X1, ..., XN (1Xi1000,1 i N);
+ Dng th ba cha M s nguyn Y1, ..., YM (1Yi 1000, 1 i M).
Kt qu: Ghi ra file vn ban COMASIGN.OUT: l m t s nguyn P cho bit s lng ln nht lp sinh
vin tm c
Vi du:
COMASIGN.INP
34
534
3536

COMASIGN.OUT
2

2. T chc tham quan

Trong t t chc i tham quan danh lam thng canh ca thnh ph H Chi Minh, Ban t chc hi thi Tin
hc tr t chc cho N on (nh s t 1 n N) mi on i tham quan mt a im khc nhau. on th i i
tham quan a im cch Khch sn Hong d i km (i=1,2,...,n). Hi thi c M xe taxi nh s t 1 n M
(MN). Xe th j c mc tiu th xng l v lit/km.
Yu cu: Hay chn N xe phc v vic a cc on i tham quan sao cho tng chi phi xng cn s dng l it
nht.
D liu: Vo t file vn ban THAMQUAN.INP
+ Dng u tin cha hai s nguyn dng N, M (1N,M30000)
+ Tip theo l N dng, dng th i ghi s nguyn di (1di30000)
+ Cui cng l M dng, dng th j ghi vj (1vj30000)
Kt qu: Ghi ra file vn ban THAMQUAN.OUT:
+ Dng u tin ghi tng lng xng cn dng cho vic a cc on i tham quan (khng tinh lt v)
+ Dng th i trong s N dng tip theo ghi ch s xe phc v on i (i=1,2,...,N)
V d:
THAMQUAN.INP
THAMQUAN.OUT
34
256
7
2
5
3
9
4
17
13
15
10

Bai 1: cng phn s

Cho 2 phn s A/B v C/D
Yu cu: Hay xc nh 2 s nguyn dng E v F tha man 2 iu kin sau:
+ K 1: E/F=A/B+C/D
+ K 2: E/F l phn s ti gian
D liu vao: file vn ban BAI1.INP, c cu trc:
+ Dng 1 cha hai s A,B
+ Dng 2 cha 2 s C,D
(A,B,C,D l cc s nguyn dng v khng ln hn 10000)
D liu ra: file vn ban BAI1.out
c 1 dng cha 2 s E,F ghi trn cng 1 dng, cch nhau bi du cch trng.
Vi d:
BAI1.INP BAI1.OUT
25
9 10
36
Bai 2: R-bt qut sn
Trn tng nh c kich thc NxN c chia thnh NxN vung n v, ban u tt ca cc nn nh u c
mu trng. Mt con r-bt c lp trnh sn tng nh, mi ln n s sn trn mt hnh vung kich thc
KxK. Cc lnh iu khin r-bt c dng 4 s nguyn x y k v trong x, y l ta gc phia trn bn tri hnh
vung kich thc KxK m r-bt sn, v l mu m r-bt s sn trn hnh vung , cc mu c nh s bt
u t 0 (s 0 l mu trng). Hay cho bit sau M lnh c bao nhiu vung n v trn tng nh cha c rbt sn v mu cc trn tng nh
D liu vao: t tp vn ban SON.INP
+ Dng u tin hai s nguyn dng M, N (1N1000; 0M1000)
+ M dng tip theo mi dng cha 4 s nguyn cho bit cc lnh dng iu khin r-bt. R-bt s thc hin
ln lt tng lnh t lnh 1 n lnh M
D liu ra: ghi vo tp vn ban SON.OUT
+ Dng u ghi mt s nguyn cho bit s lng cc cha c sn
+ N dng tip theo, dng th ghi N s trong s th j dng i cho bit mu n sn (i, j)
Vi du:
SON.INP
SON.OUT
23
2
1122
220
2223
233
033
Bai 3: tm s ln
cho 1 day gm n ky t c mt trn bn phim, trong c it nht 4 ch s (n<10^6)
Yu cu: hay loi b 1 s ki t khi day sao cho 4 cs cui cng to nn s ln nht
D liu vao: BAI2.INP cha n ki t
D liu ra: BAI2.OUT cha 4 ki t to thnh s ln nht
Vi du:
BAI2.INP
BAI2.OUT
24t5j4r05f704y652k39 7693
3

9
8
7
30467230
023524
923
K:=4;
L:=v tri u tin
R:=v tri cui cng
Ok[i]=true cho bit k t i cha c chn
L:=1;
R:=length(s);
While k>0 do
begin
Vt:=v tri ca s ln nht, tri nht
K:=k-1;ok[vt]:=false;

If Length(s)-vt+1>k then L:=vt+1;

Else begin
Ok[u]:=false; u=vt+1 n R;
K:=k-R+vt;
R:=vt-1;
End;
B test l tp cc tp input m a bit trc output

3,
2

3,
5

6,
2

For u:=X[i] to X[i]+K[i]-1 do

A/B+C/D=((A*BCNN(B,D) div B)+(C*BCNN(B,D)div D))/BCNN(B,D)

Cu 1: Xo k t.
DELECHAR.PAS
Cho mt xu ky t St c di ti a 255 ky t, cc ky t c ly t tp a..z, A..Z, 0..9.
Yu cu: Hay xo ht cc ky t ch s trong xu St.
D liu vo: Ghi trong file vn ban DELECHAR.INP c cu trc nh sau:
- Dng 1: Ghi xu St.
D liu ra: Ghi trong file vn ban DELECHAR.OUT c cu trc nh sau:
- Dng 1: Ghi xu St sau khi a xo i cc ky t ch s.
V d:
DELECHAR.INP
DELECHAR.OUT
abc123DLA97ijk
abcDLA97ijk
Cu 2: Cc s nguyn t trong ma trn
MATRIX.PAS
Mt s t nhin P (P>1) l s nguyn t nu P c ng 2 c s l 1 v P.
Cho ma trn A gm M dng, N ct cha cc s nguyn dng. Cc dng c nh s t 1 n M theo th
t t trn xung di, cc ct c nh s t 1 n N theo th t tri sang phai.
(1M, N100, 1iM, 1jN, 1aij64000).
Yu cu: Hay m s lng cc phn t c gi tr l s nguyn t trong ma trn.
D liu vo: Ghi trong file vn ban MATRIX.INP theo cu trc nh sau:
+ Dng 1: Ghi hai s nguyn dng M v N.
+ Dng th i trong M dng tip theo: Mi dng ghi N s ln lt l cc phn t trn dng th i trong ma
trn A. cc s c ghi cc nhau it nht mt du cch.
D liu ra: Ghi ra file vn ban MATRIX.OUT theo cu trc nh sau:
Dng 1: Ghi s nguyn D l s lng phn t c gi tr l s nguyn t trong ma trn A.
V d:
MATRIX.INP
MATRIX.OUT
34
6
1697
2785
3456
Cu 3. So snh
Cho hai s thc A v B, hay so snh hai s thc v a ra thng bo >, < hoc =.
Input
- Dng 1: l s A (c khng qu 20000 ky t)
- Dng 2: l s B (c khng qu 20000 ky t)
Output
- a ra thng bo >, < hoc =.
COMPARE.INP
2.39
3.61
123
12.3
12345678
12345678.0

COMPARE.OUT
<
>
=

Cu 4. Khiu v
Mt lng qu c m chng trai nh s t 1 ti m v n c gi nh s t 1 ti n. Chng trai th i c chiu
cao ai (i = 1,2 ,,m), c gi th j c chiu cao bj ( j = 1, 2, n).
Trong mt bui khiu v, ngi ta mun chn ra mt s cp nhay. Mi cp nhay gm ng 1 chng trai
v 1 c gi v trong cp , chng trai phai cao hn c gi. Mi chng trai, c gi trong lng khng c tham
gia qu 1 cp nhay.
Yu cu: Tm mt s nhiu nhts cc cp nhay tha man yu cu trn.
D liu: Vo t file vn ban DANCE.INP
Dng 1 cha hai s nguyn dng m,n < 105

Dng 2 cha m s nguyn dng a1, a2, , am (a[i] < 109)

Dng 3 cha n s nguyn dng b1, b2, , bm (b[i] < 109)

Kt qua: Ghi ra file vn ban DANCE.OUT mt s nguyn duy nht l s cp nhay theo phng n tm c.
Vi d:
DANCE.INP
DANCE.OUT
32
1
123
23

BI 1: SP XP S
Cho s nguyn dng N (N105) v day s nguyn i mt khc nhau A1, A2,,AN. (|Ai|109). Thc hin
cc cng vic sau
a. Vi 1 s nguyn K thuc A, hay sp xp li day s sao cho tt ca cc s ng trc K u nh hn K, tt
ca cc s ng sau K u ln hn K
b. Hay sp xp li day s sao cho s khng dng ng u day, s nguyn dng chn ng gia v s
nguyn dng l ng cui day
BI 2: UA ROBOT
Trong cuc ua tc c N r-bt tham gia c nh s t 1 n N. ng ua c di d (mt). R-bt
th i c vn tc ua khng i l vi (mt/pht). Cc r-bt xut pht theo th t t 1 n N v cch nhau 1 pht.
R-bt i c gi l vt r-bt j (1jN) nu i xut pht sau j v v ich trc j. Yu cu xc nh tt ca cc
ln vt nhau ca cc r-bt trong cuc ua
D liu vao: T tp vn ban DUAR.INP
+ Dng u tin cha s nguyn dng N v d (N<105 v d<109)
+ Dng tip theo cha N s nguyn dng vi, (1iN, mi s khng vt qu 1000)
D liu ra: ghi vo tp vn ban DUAR.OUT s ln vt nhau ca tt ca cc r-bt trong cuc ua
Vi du:
DUAR.INP DUAR.OUT
5 10
7
12438
S th t
Tg+ thm
Tg hoan
thanh
Tng Tg
S ngi
vt

1
0
10

2
1
5

3
2
2.5

4
3
3.333333

5
4
1.25

10
4

6
2

4.5
0

6.3333
1

5.25
0

BI 3: NG TRN
Trn mt phng vi h trc to Decattes vung gc cho n im xanh v n im hon ton phn bit.
To cc im ny l s nguyn c gi tr tuyt i 10000.
Hy ch ra mt hnh tron nh nht tho mn:
C tm gc to (0, 0)
Bn trong hnh tron (tnh c ng bin), s im xanh = s im 1
D liu vao: t file vn ban CIRCLE.INP
+ Dng 1: Cha s nguyn dng n (n 50000)
+ n dng tip theo, mi dng cha honh v tung ca mt im xanh
+ n dng tip theo, mi dng cha honh v tung ca mt im
Cc s trn mt dong ca Input file cch nhau t nht mt du cch
Kt qu: Ghi ra file vn ban CIRCLE.OUT Ch gm mt dng ghi bn kinh ng trn tm c (Ghi di
dng s thc vi 6 ch s sau du chm thp phn)

CIRCLE.INP

CIRCLE.OUT

4
20
03
0 -3
4 -4
11
02
-3 0
-3 3

3.000000

BI 4: THAY TH T
Hai tp vn ban INPUT1.TXT v INPUT2.TXT c cho nh sau: tp INPUT1.TXT cha mt on vn
ban bt k c khng qu 106 ky t. Tp INPUT2.TXT cha khng qu 50 dng, mi dng gm hai t: t u l
t ich v t sau l t ngun. Hay tm trong tp INPUT1.TXT tt ca cc t l t ich v thay th chng bng
cc t ngun tng ng. Kt qua ghi vo tp KQ.INP (s l mt on vn ban tng t nh trong tp
INPUT1.INP nhng a c thay th t ich bi t ngun)
Vi du:
Tp INPUT1.INP cha on vn bn sau:
Nam moi sap den roi, ban co zui khong?
Chuc cac ban don cai tet thay zui ve va hanh phuc.
Chuc ban luon hc gioi!
Tp INPUT2.TXT cha cc dong sau:
ban em
zui vui
Tp KQ.OUT s cha on vn bn:
Nam moi sap den roi, em co vui khong?
Chuc cac em don cai tet thay vui ve va hanh phuc.
Chuc em luon hc gioi!

5 8 2 9 1 3 10 4
4 8 2 9 1 3 10 5
3 8 2 9 1 4 10 5
3 4 2 9 1 8 10 5
3 1 2 9 4 8 10 5
3 1 2 4 6 8 10 5
U1;vN;
While u<=v do
Begin
While A[u]<k do u:=u+1;
While A[v]>k do v:=v-1;
Swap(A[u],A[v]);

Inc(u);
Dec(v);
End;
+ Chia day ban u thnh 2
day sao cho mi phn t day
phia trc u nh hn tt ca
cc phn t day phia sau
+ Sp xp day phia trc
+ Sp xp day phia sau
Bi 1: giao im ca hai ng thng
Cho 4 im phn bit A(xA, yA), B(xB,yB), C(xC,yC), D(xD,yD). Hay in ra mn hnh giao im ca hai on
thng AB v CD. Trong trng hp khng ct nhau th in ra mn hnh NO. Bit rng gia hai on thng c it
nht mt giao im
Bi 2: a gic
Cho N a gic li thoa man cc tinh cht sau:
+ Vi 2 a gic bt k lun c mt a gic m mi im ca n nm trong a gic kia
+ Cc cnh ca chng khng c im chung
Bi ton t ra l: Vi mi a gic i, c bao nhiu a gic trong N a gic ni trn bao n (i nm trong bao
nhiu a gic)?.
D liu: Vo t tp vn ban DAGIAC.INP
+ Dng u tin ghi s t nhin N (3N10000)
+ Dng th i+1 ghi thng tin v a gic th i, bao gm: S u tin Si l s nh ca a gic; Si cp s
nguyn tip theo ln lt l honh v tung cc nh ca a gic. Cc s trn cng dng cch nhau it nht
mt du cch.

Kt qu: Ghi ra tp vn ban DAGIAC.OUT gm N dng, dng th i ghi s lng cc a gic bao a gic i.
Vi du:
DAGIAC.INP
DAGIAC.OUT
4
0
4 1 1 15 1 15 8 1 8
2
493964643
1
4 3 2 11 2 11 7 3 7
3
3848568
Bi 3: XY DNG NH MY
Do nn cng nghip rt pht trin nn nhu cu v in i vi t nc X tng lin tc. V vy chinh ph
mun xy dng thm K nh my in nguyn t, do cn tinh n ly do an ton nn cc nh my in nguyn t
phai t cng xa nhau cng tt trnh cc phan ng dy chuyn c th xay ra khi c s c. C N a im c
th chn xy dng nh my, bn hay gip chinh ph nc X chn ra K a im trong s N a im ni trn
sao cho khoang cch ca hai im gn nht c chn l ln nht.
D liu vao: T tp vn ban FACTORY.INP
+ Dng u tin ghi hai s nguyn N v K (1<K<N200)
+ N dng tip theo, dng th i ghi 2 s nguyn x i, yi l ta a im th i c th xy dng nh my (Cc
ta l nguyn c gi tr tuyt i khng vt qu 10000)
D liu ra: ghi vo tp FACTORY.OUT mt dng gm K s l s th t ca K im c chn xy
dng nh my
Vi du:
FACTORY.INP
FACTORY.OUT
53
134
00
21
60
34
41

Bai 1: C p im gn nht
Trn trc s, cho n im A1, A2,... An c ta ln lt: x1, x2,... xn. Cc im khng nht thit phn bi t.
Yu cu: Hay xc nh cc c p im Ai, Aj (0 < i < j < n + 1) sao cho khoang cch Ai, Aj ngn nht.
D liu vo: File vn ban NEAREST.INP gm 2 dng:
Dng 1: S nguyn n, 2 n 105
Dng 2: n s: x1, x2,... xn. Cc ta c gi tr tuy t i khng qu 109.
D liu ra: File vn ban NEAREST.OUT. Ghi ra hai gi tr trn m t dng: khoang cch ngn nht tm c v
s lng c p im c khoang cch bng khoang cch ngn nht.
V d:
NEAREST.INP
NEAREST.OUT
Giai thich
4
1 2
Khoang cach: 1
5 2 1 3
2 c
p im co
khoang cach 1:
(2,1) va (2,3)

Bai 2 - XAUFIB.

Cho 3 xu khc rng SA, SB, SR, di ca cc xu SA v SB khng vt qu 10, di xu

SR khng vt qu 15. Day xu F0,F1, F2, ..., Fn c xy dng bng php ghp xu (+) theo qui tc:
F0=SA, F1=SB, Fk+1=Fk-1+Fk; k=1,2,...,n-1. Hay xc nh s ln xut hin ca SR trong Fn.
D liu vao: File vn ban xaufib.inp c cu trc:
- Dng u tin cha s nguyn dng n (1 < n 35).
- Ba dng tip theo cha cc xu SA, SB, SR, mi xu trn mt dng.
D li u ra: File vn ban xaufib.out cha s ln xut hin tm c.
Vi du:
xaufib.in xaufib.out
Gii thch
p
F6 = ABBABBABABBAB
6
4
BAB xut hin 4 ln
A
trong F6 ti cc v tr: 3,
B
6, 8 v 11.
BAB
Bai 3: IM GP
Mnh c mt si dy thng c di N (1 N 10 4). Si dy thng c K nt tht cc v tri khc nhau
(2K100), bao gm ca nt tht mi u si dy. Mnh cho rng c mt s im gp si dy tr li sao
cho cc nt tht phia i din thng hng vi nhau nhtrong hnh sau:

Hay gip Mnh m s lng cc im c th gp li sao cho tha man iu kin trn. im gp c thl
nt tht nhng khng phai l nt tht hai u. Tt nhin, im gp c thl nt tht mt bn c th d ra (c
ngha l nu ca hai bn c nt tht th n s i din vi nhau). Hn na, Mnh ch gp li mt ln ti mt thi
im, cu ta khng bao gi gp nhiu ln.
D liu vao:T file NUT.INP gm:
- Dng u tin gm hai s K v N (hai s cch nhau it nht mt du cch trng).
- Cc dng cn li mi dng cha mt s nguyn t 0.. N l vtri ca cc nt tht.
Trong sc 2 nt tht l 0 v N.
Kt qu: ghi vo tp NUT.OUT: mt s duy nht l s lng cc nt tht tha man iu kin.
Vi du:
NUT.INP NUT.OUT
56
4
2
0
3
6
5

Bai 1: BN LA
ng A thu honh c n bao la, mi bao c khi lng tng ng l ai. Sau khi thu hoch, ng A xp n bao
la vo trong kho theo th t: bao 1 xp trc, n bao s 2,...bao ngoi cng l bao th n. ng d nh bn la
theo cch sau:
+ Bn nguyn bao la
+ Bn t ngoi vo trong (t bao th n)
+ S lng la bn i it hn hoc bng s lng la cn li trong kho
Hay cho bit ng ta bn c bao nhiu kg la?
D liu vao: t tp vn ban BANLUA.INP
+ Dng u tin ghi s nguyn dng N (N106).
+ Dng th hai ghi N s nguyn dng, s th i c gi tr ai (ai109)
D liu ra: ghi va tp vn ban BANLUA.OUT mt s duy nht cho bit s kg la m ng A bn c
BANLUA.INP
5
52 62 58 61 51

BANLUA.OUT
112

BANLUA.INP
2
52 62

BANLUA.OUT
0

Bai 2: TRU
Mt n tru c n con tru. Trong c x con tru ng, y tru nm v z con tru cn li l tru
gi. Cc con tru trong n n va ht m b c: mi con tru ng n ng 5 b, mi con tru nm n
ng 3 b v cc con tru gi th ba con mi n ht 1 b. Cho trc n v m, hi c bao nhiu b s (x,
y, z) tha man bi ton.
D li u
vao:File vn ban trau.inp cha 2 s n v m trn mt dng.
D li u ra: File vn ban trau.out cha m t s nguyn l p n ca bi ton.
Gii hn: n, m, x, y, z nguyn dng v c gi tr khng vt qu 5000.
Vi du:
TRAU.INP
TRAU.OUT
Gii thich:
C 1 b (x, y, z) tha man l (3, 1,
10 20
1
6) v 3 + 1 + 6 = 10 v 3 x 5 + 1 x
3 + 6 / 3 = 20
Bai 3: LY THA
Cho 3 s nguyn dng x, n, b. Hay tinh s d khi chia xn cho b.
D li u
vao:File vn ban LUYTHUA.INP cha 3 s x, n v b trn mt dng.
D li u ra: File vn ban LUYTHUA.OUT cha mt s nguyn l p n ca bi ton.
Gii hn: Cc s x, n, b nguyn dng v c gi tr khng vt qu 100.
Vi du:
LUYTHUA.INP
LUYTHUA.OUT
Gii thich:
302 = 900
30 2 17
16
900 mod 17 = 16
Bai 4: DIN TICH MIN PH
Mt trng hc X cn lm mi che nm ngang. Trng hc c N tm bt hnh ch nht, cc tm bt lm
mi che c th chng ln nhau. Tinh din tich che ph
D liu vao: T tp DIENTICH.INP
Dng u tin ghi s nguyn dng N (1<=N10)
Dng th 2 n N+1: mi dng cha 4 s nguyn l x 1, y1, x2, y2 trong (x1, y1) l im tri trn ca tm
bt hnh ch nht, (x2, y2) l im phai di ca tm bt hnh ch nht (cc s c gi tr tuyt i khng vt
qu 103)

D liu ra: ghi vo tp vn ban DIENTICH.OUT mt s nguyn duy nht cho bit phn din tich c ph
DIENTICH.INP DIENTICH.OUT
3
20
0541
2462
0541

0
1
2
3
4
5
6

0
0

1
0

2
0

3
0

4
0

5
0
0
0
0

6
0

A:array[-1000..1000] of byte;
A[i,j]:=0;
Bai 5: XP HNG
C N hc sinh, nh s th t 1, 2, , N, tham gia mt cuc thi lp trnh. Cc thi sinh c chm bi
ngay trong thi gian thi nn mi bn u bit im thi ca mnh. Ban t chc cho bit khng c hai thi sinh no
c cng im thi. Tuy nhin, bang xp hng cui cng li cha c cng b. Rt mong mun bit c th
hng xc nh mu huy chng, mt s thi sinh a so snh im thi vi nhau. C tt ca M so snh nh
vy, kt qua mi so snh l mt cp snguyn (A; B) c hiu l thi sinh A c im cao hn thi sinh B, ng
ngha A s c th hng kt qua cao hn B.
Cho bit thng tin v cc ln so snh, hay xc nh xem c bao nhiu thi sinh a c th bit chinh xc th
hng ca mnh.
D liu vao: T tp vn ban BRANK.INP
Dng th nht cha 2 s nguyn dng N v M (1<=N100; 1M10000)
M dng tip theo mi dng cha 1 cp s nguyn A, B
D liu ra: ghi vo tp BRANK.OUT l mt s nguyn cho bit s lng thi sinh bit chinh xc th hng
ca mnh
Vi du:
BRANK.INP BRANK.OUT
55
2
43
42
32
12

25
Thi sinh 2 v 5 bit chinh xc th hng ca mnh

Bai 5. CH XE BUT
Hng lm vic cho cng ty buyt HPC, cu c giao nhim v thu thp thng tin khch hng cng ty c
th thc hin vic ti u ha lch phc v. Bn xe buyt u tin Hng iu tra l bn xe cnh nh. Ti bn ny,
mi ngy, chuyn xe buyt u tin i qua thi im T0 , chuyn th hai i qua thi im T0+D, chuyn th
ba i qua thi im T0+2D, C N khch hng thng xuyn ch xe buyt ti bn, khch hng th i n bn
thi im si v s ln chuyn xe buyt u tin n bn thi im khng sm hn si.
Yu cu: Cho T0, D v thi im cc khch hng n bn, hay xc nh s hiu chuyn xe buyt s ln ca
tng khch hng.
D liu: Vo t file vn ban BUS.INP
+ Dng th nht cha ba s nguyn N, D, T0 (2N1000; 1D10000; 0T01000000)
+ Dng th hai ghi N s nguyn s1, s2,,sN (0si106)
Kt qu ra: ghi vo vn ban BUS.OUT gm 1 dng cha N s nguyn, s th i l s hiu chuyn xe bus
m hnh khch th i s ln
Vi du:
BUS.INP BUS.OUT
358
134
0 15 23