Booklet PDF

Tuyn tp bi
http://vn.spoj.pl
Cp nht ngy 17-01-2009
Bn quyn VNOI 2008-2009
Tuyn tp bi VOJ 17-01-2009
Mc lc
Ngy
M bi
Tn bi
Loi bi
Ngi gi
09-09-2006
ASSIGN4
Another Assignment Problem
acm
dtmp
09-09-2006
MULONE
Nhn 1
acm
dtmp
09-09-2006
PYRAMID2
Duyt binh
acm
hard7771988
09-09-2006
MESSAGE
Truy n tin
acm
dtmp
09-09-2006
CATALAN
Dy s Catalan
acm
dtmp
09-09-2006
TCDFZ
Ch s tn cng khc 0
acm
dtmp
09-09-2006
ELEVATOR
Thang my v tr
acm
dtmp
09-09-2006
BRACKET
Dy ngoc
acm
dtmp
09-09-2006
COND
Quan h
acm
dtmp
09-09-2006
HIWAY
Hai ng i
acm
dtmp
09-09-2006
KWAY
Trao i thng tin
acm
dtmp
09-09-2006
MINCOST
Lung vi chi ph nh nht
acm
dtmp
09-09-2006
ASSIGN1
Phn cng hoan thanh sm nh t
acm
dtmp
09-09-2006
STONE1
Ri si
acm
dtmp
09-09-2006
SUBSTR
Xu con
acm
dtmp
09-09-2006
RECT1
Cc hnh ch nht
acm
dtmp
09-09-2006
MAXCUB
Khi lp phng ln nht
acm
dtmp
09-09-2006
CP
S chnh phng
acm
dtmp
09-09-2006
METERAIN
Ma thin thch
acm
dtmp
09-09-2006
LIGHT
H thng n
acm
dtmp
09-09-2006
GSS
on con c tng ln nht
acm
dtmp
09-09-2006
QMAX
Gi tr ln nht
acm
dtmp
09-09-2006
BAOVE
Bo v
acm
dtmp
09-09-2006
POLY4
Sao a giac
acm
dtmp
09-09-2006
QMAX2
Gi tr ln nht ver2
acm
dtmp
09-09-2006
REL7
Bng quan h
acm
hard7771988
09-09-2006
DEGREE
S lng bc
acm
hard7771988
09-09-2006
THREE
Mng 3 nh
acm
hard7771988
09-09-2006
MINK
Huyn thoi Lc Vn Tin
acm
hard7771988

09-09-2006
KAGAIN
Chin trng qua
acm
hard7771988
09-09-2006
WALK
Do chi quanh nh
acm
hard7771988
09-09-2006
MIDAS
Vua Midas thch vng
acm
hard7771988
09-09-2006
MILITARY
Cu chuyn ngi lnh
acm
hard7771988
09-09-2006
HUGEKNAP
Ci ti ( Hard version )
acm
hard7771988
09-09-2006
FLOYD
Floyd hoc Dijkstra ( C bn )
acm
hard7771988
09-09-2006
HEAP1
Mt cht v Huffman Tree
acm
hard7771988
09-09-2006
XOR
Php Xor
acm
hard7771988
09-09-2006
CASTLE
Xy dng lu i
acm
hard7771988
09-09-2006
CAR
Lp lch sa cha t
acm
hard7771988
09-09-2006
TWO
Lp lch trn 2 my
acm
hard7771988
09-09-2006
MACHINE
Lp lch trn 3 my
acm
hard7771988
09-09-2006
KINV
Dy nghch th di K
acm
hard7771988
09-09-2006
GOLD
o giu vng
acm
hard7771988
09-09-2006
PTREE
Cy P nh ( C bn )
acm
hard7771988
09-09-2006
ENET
Mng in
acm
hard7771988
09-09-2006
AREA
Din tch hnh ch nht
acm
hard7771988
09-09-2006
EGG
Th trng , tr gii tr tui teen
acm
hard7771988
09-09-2006
MATCH1
Cp ghp khng trng s
acm
hard7771988
09-09-2006
MATCH2
B ghp y trng s cc tiu
acm
hard7771988
09-09-2006
FLOW1
Giao lu
acm
hard7771988
09-09-2006
CTREE
T mu nh nht
acm
hard7771988
09-09-2006
TWOSAT
Du lch
acm
hard7771988
09-09-2006
TELEPORT
Dch chuyn tc thi
acm
hard7771988
09-09-2006
ELECT
Thng nht t nc
acm
hard7771988
09-09-2006
CARPET
Tri thm
acm
hard7771988
09-09-2006
JACOBI
S hc 1
acm
hard7771988
09-09-2006
RECTP
Chu vi cc hnh ch nht
acm
hard7771988
09-09-2006
TRIANGLE
Din tch cc tam gic vung cn
acm
hard7771988
09-09-2006
POINT
Khong cch mong manh
acm
hard7771988
09-09-2006
ALERT
Bo ng
acm
hard7771988
09-09-2006
CHUOIHAT
Chui ht
acm
paulmcvn

09-09-2006
BONGDA
Lch thi u bng
acm
paulmcvn
27-04-2007
ITREE
Nhn ca cy
acm
hard7771988
27-04-2007
THEME
on cao tro ca bn nhc
acm
hard7771988
08-07-2007
CHEAT
Chi bi-a 1 l
acm
hard7771988
22-07-2007
COWGIRL
C gi chn b
acm
hard7771988
10-08-2007
RTF
Cn thng bng
acm
hard7771988
02-09-2007
NEWJ
S hc 2
acm
hard7771988
10-09-2007
HAOI5000
HAOI 5000
acm
duonghanguyen
14-09-2007
YUGI
Yugi-Oh
acm
nghia
15-09-2007
POST
A cng B
acm
hard7771988
15-09-2007
PYTHAEQ
Phng trnh Pythagore nghim nguyn
acm
duonghanguyen
15-09-2007
LIQ
Dy con tng di nht ( bn d )
acm
hard7771988
16-09-2007
LIS
Dy con tng di nht (bn kh)
acm
duonghanguyen
17-09-2007
BRIDGES
Xy cu
acm
duonghanguyen
17-09-2007
PNUMBER
Tm s nguyn t
acm
hard7771988
19-09-2007
DISNEY1
Cng vin Disneyland (version 1)
acm
nghia
19-09-2007
DISNEY2
acm
nghia
20-09-2007
VN_ZR_I
S khng (I)
acm
duonghanguyen
20-09-2007
COST
Li 1 bi phn vic
acm
hard7771988
21-09-2007
QTREEX
Truy vn trn cy
acm
beo_map
21-09-2007
PALINX
Xu i xng
acm
beo_map
21-09-2007
CLOCK
Chnh ng h
acm
hard7771988
21-09-2007
VN_ZR_II
S khng (II)
acm
duonghanguyen
22-09-2007
PCIRCLE
Vng s nguyn t
acm
hard7771988
27-09-2007
BWGAME
Tr chi en trng
acm
beo_map
27-09-2007
BWTRI
Tam gic en trng
acm
beo_map
31-10-2007
KTUAN
Phn tch s
acm
beo_map
16-11-2007
BIC
Vng ua xe p
acm
paulmcvn
16-11-2007
NK05EOPR
i ch
acm
paulmcvn
16-11-2007
NK05ORDR
Trt t
acm
paulmcvn
16-11-2007
NK05MNIM
Bc si
acm
paulmcvn
16-11-2007
NK05DSRT
Sa mc
acm
paulmcvn

17-11-2007
VNZR_III
S khng (III)
acm
beo_map
21-11-2007
IVANA
Tr chi vng s
acm
paulmcvn
26-11-2007
PRAVO
Tam gic vung
acm
paulmcvn
17-01-2008
LATGACH
Lt gch
acm
beo_map
17-01-2008
LATGACH2
Lt gch 2
acm
beo_map
17-01-2008
CHESS_
C vua
acm
beo_map
17-01-2008
CUTSEG
Rt gn on
acm
beo_map
18-01-2008
NKREZ
Hi trng
oi
paulmcvn
18-01-2008
NKTHEME
oi
paulmcvn
18-01-2008
NKLEAVES
Leaves
oi
paulmcvn
18-01-2008
NKMARS
Mars Map
oi
paulmcvn
18-01-2008
NKMOBILE
IOI01 Mobiles
oi
paulmcvn
18-01-2008
NKMOU
IOI05 Mountains
oi
paulmcvn
18-01-2008
NKPAIRS
IOI07 Pairs
oi
paulmcvn
18-01-2008
NKMSG
Truyn tin
oi
paulmcvn
18-01-2008
NKPOLICE
Police
oi
paulmcvn
18-01-2008
NKMINERS
IOI07 Miners
oi
paulmcvn
18-01-2008
NKLP
Hon v di nht
oi
paulmcvn
18-01-2008
NKTRAFIC
Monkey island
oi
paulmcvn
18-01-2008
NKLIGHT
H thng n
oi
paulmcvn
18-01-2008
NKRAIN
Ma thin thch
oi
paulmcvn
18-01-2008
NKDIST
Distance
oi
paulmcvn
18-01-2008
NKBUS
Bus
oi
paulmcvn
18-01-2008
NKTEST
Kim tra chng trnh
oi
paulmcvn
18-01-2008
LUBENICA
Lubenica
oi
paulmcvn
18-01-2008
NKTEAM
Team Selection
oi
paulmcvn
18-01-2008
NKINV
Dy nghch th
oi
paulmcvn
20-01-2008
NKPOLY
Chia a gic
oi
paulmcvn
Dy con di nht
oi
paulmcvn
20-01-2008 NKMAXSEQ
20-01-2008
NKPATH
ng i trn li
oi
paulmcvn
20-01-2008
NKNET
Mng truyn tin
oi
paulmcvn
22-01-2008
LQDBUS
n trng
oi
paulmcvn

25-01-2008
NKONEARC
Mng my tnh
oi
paulmcvn
25-01-2008
NKDEC
Trang tr dn n
oi
paulmcvn
27-01-2008
STEEL
Khun thp
oi
paulmcvn
27-01-2008
NKGOLF
Sn golf
oi
paulmcvn
27-01-2008
NKMINES
Tr chi d mn
oi
paulmcvn
29-01-2008
NKSGAME
VOI08 Tr chi vi dy s
oi
paulmcvn
29-01-2008
NKJUMP
VOI08 L c
oi
paulmcvn
29-01-2008
NKGIFTS
VOI08 Qu tt
oi
paulmcvn
12-02-2008
NKRACING
Vng ua F1
oi
paulmcvn
12-02-2008
NKTOSS
Tung ng xu
oi
paulmcvn
19-02-2008
GWCOINS
Tr chi vi nhng ng xu
acm
beo_map
19-02-2008
CRECT
m cc hnh ch nht
acm
beo_map
22-02-2008
F1
ua xe cng thc 1
acm
beo_map
22-02-2008
F2
ua xe cng thc 2
acm
beo_map
23-02-2008
NKPANO
Billboard painting
oi
paulmcvn
23-02-2008
NKCAT
Dy Catalan
oi
paulmcvn
23-02-2008
NKNLACE
Chui ht
oi
paulmcvn
23-02-2008
NKBRK2
Dy ngoc bc K
oi
paulmcvn
23-02-2008
NKBUSD
iu xe but
oi
paulmcvn
15-03-2008
GCDSUM
Tng cc c chung ln nht
acm
beo_map
18-03-2008
NKLINEUP
Xp hng
oi
paulmcvn
18-03-2008
NKDISNEY
Cng vin Disneyland
oi
paulmcvn
18-03-2008
NK2MFS
Lp lch trn hai my
oi
paulmcvn
18-03-2008
NKA1
A1
oi
paulmcvn
20-03-2008
VKNIGHTS
Qun m
oi
paulmcvn
20-03-2008
VWORDS
Tng ng ha hai t
oi
paulmcvn
20-03-2008
RAOVUON
Ro Vn
acm
beo_map
21-03-2008
NKLEAGUE
Gii bng
oi
paulmcvn
22-03-2008
V8SCORE
Chm im
oi
paulmcvn
22-03-2008
V8SORT
Sp xp
oi
paulmcvn
23-03-2008
V8ORG
T chc i lp
oi
paulmcvn
23-03-2008
V8MAYORS
Th trng
oi
paulmcvn

25-03-2008
SAFENET2
Mng my tnh an ton
oi
conankudo
26-03-2008
LEM
RIVER
oi
cun
26-03-2008
SUMS
S ph thuc
acm
aukcwe
26-03-2008
LEM1
COIN
oi
cun
27-03-2008
PBCWAYS
Tr chi di chuyn con tt
oi
naruto238
27-03-2008
PBCPOINT
Ni im
oi
naruto238
27-03-2008
LEM2
GUMBI
oi
cun
29-03-2008
PASSWORD
Password
oi
paulmcvn
31-03-2008
VNBRACK
Dy ngoc bc P
oi
beo_map
01-04-2008
MEO
Mo
oi
paulmcvn
01-04-2008
PAIRVIS
Help Conan !
oi
conankudo
01-04-2008
LSPITO
Help Conan ! (version 3)
oi
tikiupi
01-04-2008
CHATCHIT
Chat chit
oi
paulmcvn
01-04-2008
CONANSP
Conan Needs Help Again (Help Conan 4 )!
oi
conankudo
10-04-2008
LEM3
TRIP
oi
cun
10-04-2008
LEM4
WHITE BLACK
oi
cun
11-04-2008
LEM5
ARITHMETIC PROGRESSION
oi
cun
16-04-2008
LEM6
BIRTHDAY
oi
cun
19-04-2008
LSPALIN
Bc Palindrome
oi
tikiupi
20-04-2008
VBF1
Brainfck Nhp xut
oi
paulmcvn
20-04-2008
VBF2
Brainfck Ch d
oi
paulmcvn
27-04-2008
NKPOLI
a gic
oi
paulmcvn
27-04-2008
NKSEV
Tch t
oi
paulmcvn
27-04-2008
NKPOS
Ngi a th
oi
paulmcvn
27-04-2008
NKLAND
Mnh t t tin
oi
paulmcvn
27-04-2008
NKFLOW
Lung cc i trn mng
oi
paulmcvn
27-04-2008
NKBM
Cp ghp cc i trn th hai pha
oi
paulmcvn
27-04-2008
NKTARDY
Lp lch gim thiu tr hn
oi
paulmcvn
02-05-2008
GANNHAT
Closest distance
acm
aukcwe
08-05-2008
GROUP
Phn nhm
acm
aukcwe
24-05-2008
VCRISIS
Thm kch nng trang
oi
paulmcvn
24-05-2008
VNABOR
Vng hng xm b
oi
paulmcvn

24-05-2008
VBGRASS
Bi c ngon nht
oi
paulmcvn
24-05-2008
VCOWFLIX
i xem phim
oi
paulmcvn
24-05-2008 VCOLDWAT
Nc lnh
oi
paulmcvn
25-05-2008
CENTRE28
CENTRE
oi
cun
26-05-2008
KMIN
KMIN
oi
cun
27-05-2008
VMUNCH
Gm c
oi
paulmcvn
27-05-2008
VRATF
Nhng con ng quanh nng trang
oi
paulmcvn
27-05-2008
VCOWCAR
Xe t ca b
oi
paulmcvn
Sc mnh ca ngn t
oi
paulmcvn
27-05-2008 VWORDPOW
27-05-2008
VDANGER
Nguy him r rng trc mt
oi
paulmcvn
27-05-2008
VPARTSUM
Tng b phn
oi
paulmcvn
11-06-2008
NOIXICH
Ni Xch
oi
soncbg
11-06-2008
QBSEQ
Dy con di nht c tng chia ht cho K
acm
cun
11-06-2008
QBMAX
ng i c tng ln nht
acm
cun
11-06-2008
QBHV
Hon v ch ci
acm
cun
12-06-2008
QBHEAP
Hng i c u tin
acm
cun
12-06-2008
IOIBIN
Cc thng nc
acm
cun
12-06-2008
QBMST
Cy khung nh nht ( HEAP )
acm
cun
12-06-2008
SHHV
S hiu hon v
acm
cun
12-06-2008
BIGNUM
X l s nguyn ln
acm
cun
12-06-2008
NKPALIN
Chui i xng
oi
paulmcvn
12-06-2008
NKSEQ
Dy s
oi
paulmcvn
12-06-2008
NKSPILJA
Hang ng
oi
paulmcvn
12-06-2008
MYSTERY
S huyn b
oi
paulmcvn
12-06-2008
MPRIME
S nguyn t ghp
oi
paulmcvn
12-06-2008
NKCABLE
Ni mng
oi
paulmcvn
13-06-2008
CATGO
Ct g
oi
beo_map
13-06-2008
XUCXAC
Xc xc
oi
beo_map
13-06-2008
DEMSO
m s
oi
beo_map
13-06-2008
QBSQUARE
Hnh vung 0 1
acm
cun
13-06-2008
CHESSCBG
Bn c th
oi
soncbg
13-06-2008
IOI2008
IOI2008
acm
cun

14-06-2008
QBRECT
Hnh ch nht 0 1
acm
cun
14-06-2008
PBCSEQ
Cc on nguyn
oi
naruto238
15-06-2008
CDMUSIC
Help Conan 5 !
oi
hphong
15-06-2008
NKTICK
Xp hng mua v
oi
paulmcvn
15-06-2008
VTRI
Triangles
oi
paulmcvn
15-06-2008
VTRI2
Tam gic 2
oi
voj
18-06-2008
VSTEPS
Steps
oi
voj
22-06-2008
VBOARD
Chessboard
oi
paulmcvn
22-06-2008
MAKHOA
The secret key
oi
paulmcvn
29-06-2008
FACUP
The FA cup
oi
beo_chay_so
29-06-2008
CWAY
Counting paths in a complete graph
oi
beo_chay_so
30-06-2008
NDIGIT
The Nth digit
oi
beo_chay_so
06-07-2008
INTEGER7
Integers
oi
hard7771988
06-07-2008
PCYCLE
Exploring the maze
oi
hard7771988
10-07-2008
BFCHAL
Brainfck thch
oi
baochi810
13-07-2008
KDEL
Removing digits
oi
paulmcvn
13-07-2008
VBLOCKS
Blocks
oi
paulmcvn
15-07-2008
CONANGSS
Help Conan 8 !! Hurry up !!
oi
conankudo
15-07-2008
QVESCAPE
Help Conan 9 !
oi
hphong
17-07-2008
NKSTEP
Chuy n
oi
paulmcvn
17-07-2008
NKLEXIC
Th t t in
oi
paulmcvn
17-07-2008
NCOB
Cuc u cn no
oi
racer
17-07-2008
QVSICK
Help Conan 10 !
oi
hphong
18-07-2008
NBFA
Brainfuck Cng
oi
racer
18-07-2008
NBFM
Brainfuck Nhn
oi
racer
18-07-2008
NBFD
Brainfuck Chia
oi
racer
20-07-2008
HELPPM
Help the PM!
oi
beo_chay_so
21-07-2008
QTREE3
Query on a tree again!
oi
john_jones
21-07-2008
BCDIV
Chia nhm
oi
baochi810
21-07-2008
NRS
Xp toa
oi
racer
21-07-2008
PTRANG
Phn Trang
oi
huy391992
22-07-2008
EQUTRI
Tam gic
oi
kvd

24-07-2008
NKH
Tch T
oi
huy391992
26-07-2008
BASEH
C s H
oi
kvd
03-08-2008
NHP
Harry Potter and the Deathly Maze
oi
racer
03-08-2008
TRIBE
Tribe
oi
voj
05-08-2008
PBCWRI
Writing
oi
naruto238
09-08-2008
NOTE
Gp tin
oi
voj
09-08-2008
KANDP
M v tt
oi
voj
09-08-2008
GPMB
Gii phng mt bng
oi
voj
10-08-2008
TORCH
Rc uc Olympic
oi
voj
10-08-2008
CINEMA
Rp chiu phim
oi
voj
10-08-2008
HAOI6000
HAOI 6000
oi
voj
10-08-2008
NUMBERS
Nhng con s
oi
paulmcvn
10-08-2008
TWOOPERS
Hai thao tc trn chui
oi
voj
11-08-2008
MAXARR1
Help Conan 12 !
oi
hphong
11-08-2008
MAXARR2
Help Conan 13 !
oi
hphong
11-08-2008
PBCFIBO
Gi tr th S
oi
naruto238
13-08-2008
PACK
Help Conan 11 !
acm
hphong
17-08-2008
RECT3
Khi tam ch nht
oi
voj
17-08-2008
LSFIGHT
u trng VM08
oi
tikiupi
19-08-2008
RECT3_2
Khi tam ch nht II
acm
aukcwe
25-08-2008
HINHTHOI
Hnh thoi
oi
voj
25-08-2008
DIGIT0
S 0 tn cng
oi
voj
02-09-2008
FLOWER
Bng hoa
oi
hard7771988
02-09-2008
ANT
Kin
oi
voj
03-09-2008
QBTICKET
Mua v tu ho
oi
cun
05-09-2008
NSP
Hnh Tinh
acm
racer
06-09-2008
QBGAME
Tr chi trn ma trn
oi
cun
06-09-2008
QBCOND
Quan h c iu kin
oi
cun
07-09-2008
KINGDOM
The mightiest kingdom
oi
voj
07-09-2008
BINLADEN
Bin Laden
oi
voj
07-09-2008
WIFI
Computer lab
oi
voj
07-09-2008
PBCDEM
m dy
oi
huy391992
10

08-09-2008
NPR
Vn hon ho
acm
racer
09-09-2008
CPPSET
Tp hp ng
acm
paulmcvn
09-09-2008
PASSET
Tp hp ng (Pascal Version)
acm
voj
10-09-2008
MUL2COM
Binary multiplication
acm
paulmcvn
10-09-2008
BOSS
Ai l sp
acm
paulmcvn
10-09-2008
COIN34
34 ng xu
acm
paulmcvn
10-09-2008
POWER
Ly tha
acm
paulmcvn
14-09-2008
MEDIAN
Phn t trung v
acm
paulmcvn
21-09-2008
QBMSEQ
VOI07 Dy con khng gim di nht
oi
cun
VOI07 Siu th may mn
oi
cun
21-09-2008 QBMARKET
21-09-2008
QBROBOT
VOI07 Robot cu ha
oi
cun
22-09-2008
LABUDOVI
H Thin Nga
acm
huy391992
26-09-2008
DANCING
Nhng hnh nhn nhy ma
oi
voj
28-09-2008
QBSELECT
VOI06 Chn
oi
cun
28-09-2008
QBBISHOP
VOI06 Qun tng
oi
cun
28-09-2008
QBCIRARC
VOI06 Knh xung yu
oi
cun
28-09-2008
QBCHANGE
VOI06 Bin i bng
oi
cun
30-09-2008
QBSEGPAR
VOI05 Phn on
oi
cun
30-09-2008
QBFIREWK
VOI05 Pho hoa
oi
cun
30-09-2008
COLLECT
VOI05 B su tp
oi
cun
06-10-2008
COPYDNA
Copying DNA
acm
paulmcvn
06-10-2008
ROADS
Roads
acm
paulmcvn
06-10-2008
BOXES
Boxes
acm
paulmcvn
10-10-2008
LIGHTS
Lights
acm
aukcwe
18-10-2008
MTWALK
Mountain Walking
acm
paulmcvn
18-10-2008
LAZYCOWS
Lazy Cows
acm
paulmcvn
18-10-2008
POOL
Bi-a
oi
paulmcvn
20-10-2008
DPEQN
Congruence Equation
acm
paulmcvn
21-10-2008
DIVREL
Divisibility Relation
acm
paulmcvn
22-10-2008
TREECST
Tree Construction
acm
paulmcvn
22-10-2008
BONES
Xc xc b
oi
paulmcvn
22-10-2008
QUAD
Xy hng ro
oi
paulmcvn
11

22-10-2008
FWATER
Ti nc ng c
oi
paulmcvn
22-10-2008
PWALK
Do chi ng c
oi
paulmcvn
22-10-2008
ROTATION
Quay bnh xe
oi
paulmcvn
22-10-2008
PWRFAIL
Mt in
oi
paulmcvn
26-10-2008
KQUERY
K-query
acm
paulmcvn
26-10-2008
DQUERY
D-query
acm
paulmcvn
29-10-2008
FIRE
Phng chy
acm
cun
30-10-2008
ORDERSET
Order statistic set
acm
paulmcvn
30-10-2008
KQUERY2
K-query II
acm
paulmcvn
30-10-2008
HOUSE
Xy nh
acm
cun
30-10-2008
QBSTR
Xu con chung di nht
acm
cun
30-10-2008
QBPAL
m chui i xng
acm
cun
30-10-2008
QBSCHOOL
n trng
acm
cun
30-10-2008
QBBITSEQ
Dy bit
acm
cun
30-10-2008
QBTREEK
m cy nh phn
acm
cun
30-10-2008
QBAGENTS
Cc i l
acm
cun
30-10-2008
QBPOINT
B ba im thng hng
acm
cun
30-10-2008
QBWIRE
Chip & Dale
acm
cun
30-10-2008
QBFLOWER
Tng hoa
acm
cun
30-10-2008
QBMOUSE
Tr chi hi ch
acm
cun
30-10-2008
QBSTOCK
C phiu
acm
cun
30-10-2008
IQ
Tr chi tr tu
acm
cun
30-10-2008
QBSTAR
Bng s hnh sao
acm
cun
30-10-2008
QBPIZZA
Ct bnh pizza
acm
cun
30-10-2008
QBCAKE
Ct bnh
acm
cun
30-10-2008
VECTOR
Tng vector
acm
cun
30-10-2008
SCIRCLE
Din tch cc hnh trn
acm
cun
30-10-2008
GRNUM
nh s th
acm
cun
30-10-2008
QBSORT
Sp xp cc vin bi
acm
cun
30-10-2008
WS
Tch t
acm
cun
30-10-2008
DBMS
H qun tr c s d liu
acm
cun
30-10-2008
QBDISNEY
Thm quan cng vin Disney
acm
cun
12

30-10-2008
TRIPOD
King ba chn
acm
cun
30-10-2008
LEM7
COMPANY
oi
cun
07-11-2008
VNCUT
Ct hnh ch nht
oi
beo_map
11-11-2008
MIXUP2
n b hn lon
oi
hphong
11-11-2008
CHEER
ng vin n b
oi
hphong
11-11-2008
TOY
chi
oi
hphong
11-11-2008
AUCTION
Going Once, Going Twice, Gone!
oi
hphong
12-11-2008
LITES
Bt n
oi
hphong
12-11-2008
NKGUARD
Bo v nng trang
oi
hphong
16-11-2008
SETNJA
SETNJA
acm
racer
16-11-2008
SVADA
SVADA
acm
racer
16-11-2008
CAVLI
CAVLI
acm
racer
03-12-2008
HAF1
ua Xe
oi
kvd
07-12-2008
SQUARES
Hnh vung
acm
racer
07-12-2008
ALADDIN
Aladdin
acm
huy391992
07-12-2008
HCN
Chia hnh ch nht
acm
huy391992
07-12-2008
ADS
Qung co
acm
huy391992
09-12-2008
NKSP
Siu i xng
oi
paulmcvn
09-12-2008
NKTREE
Cy nh phn tm kim
oi
paulmcvn
09-12-2008
NKNL
Chui ht
oi
paulmcvn
09-12-2008
NKCITY
Xy dng thnh ph
oi
paulmcvn
10-12-2008
TREAT
Cho ko hay b ph no
oi
paulmcvn
10-12-2008
SEC
Tin mt
oi
paulmcvn
10-12-2008
FENCE
Hng ro ln nht
oi
paulmcvn
10-12-2008
WINCHK
Chi c
oi
paulmcvn
10-12-2008
COMPANY3
Cng ty
acm
cun
10-12-2008
QBBUILD
Xy dng ng
acm
cun
10-12-2008
QBTRANS
Vn chuyn hng
acm
cun
10-12-2008
QBDIVSEQ
Chia dy
acm
cun
10-12-2008
BUILD28
Xy ng
acm
cun
13-12-2008
THTRACE
UI BT
acm
huy391992
14-12-2008
HCN2
Khu vui chi
acm
huy391992
13

14-12-2008
DUAXE
ua xe
acm
huy391992
14-12-2008
BGAME
Game on board
acm
racer
15-12-2008
CUTSEQS
Ct dy
acm
cun
18-12-2008
RACE
ua xe - IOICamp
acm
huy391992
20-12-2008
QBINT
Pairs of Integers
acm
cun
21-12-2008
GLOVE
Choosing Gloves
acm
racer
21-12-2008
BINARY
S nh phn c ngha
acm
cun
21-12-2008
SHTH
S hiu t hp
acm
cun
23-12-2008
SHCH
S hiu chnh hp
acm
cun
25-12-2008
PAGAIN
Prime Again
acm
racer
26-12-2008
TRIPOD2
King ba chn ( hard version )
acm
beo_map
29-12-2008
MINMOVE
Minimum Rotations
acm
racer
30-12-2008
ALAKE
H nhn to
acm
huy391992
31-12-2008
TRIOMINO
Triomino Game
acm
racer
01-01-2009
NKNL2
Chui ht (Hard version)
acm
racer
03-01-2009
NKABD
S phong ph
oi
paulmcvn
03-01-2009
NKEDIT
Hiu chnh vn bn
oi
paulmcvn
03-01-2009
NKCATM
Bt chut
oi
paulmcvn
04-01-2009
NKDIVSEQ
Dy chia ht
oi
paulmcvn
04-01-2009
NKLETTER
Gi th
oi
paulmcvn
S thn thin
oi
paulmcvn
Word Counting
acm
paulmcvn
04-01-2009 LUCKYNUM
Lucky Numbers
acm
paulmcvn
05-01-2009 HNSUBWAY
Hanoi Subway System Construction
acm
paulmcvn
04-01-2009 NKNUMFRE
04-01-2009
WORDCNT
05-01-2009
EARTHQK
Earthquakes
acm
paulmcvn
05-01-2009
PRETTYP
Pretty Printing
acm
paulmcvn
05-01-2009
TRAFFICN
Traffic Network
acm
paulmcvn
05-01-2009
WINSTRAT
Winning Strategy
acm
paulmcvn
05-01-2009
HEADQRT
Farthest Headquarters
acm
paulmcvn
05-01-2009
ATOURISM
Adventure Tourism
acm
paulmcvn
05-01-2009
MOEBIUS
Moebius
acm
paulmcvn
11-01-2009
PALINY
Palindrome di nht
acm
huy391992
14

15-01-2009
DAMAGE
ng t
oi
paulmcvn
15
Another Assignment Problem

Ngy:
09-09-2006
im:
1.4
M bi:
ASSIGN4
S ngi gii c/
lm:
19 / 28
Loi bi:
acm
T l ng:
28.3%
Thi gian chy:
5s
Bi chy tt nht:
anhtrung (100 im 1.19s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Tran Quang Khai
Assume that you are a manager and there are m types of worker (numbered from 1 to m) and n types of task
(numbered from 1 to n). There are a(i) workers of type #i and b(j) postitions for task #j. C(i, j) is the cost of
hiring a worker of type #i to do the task of type #j. Your job is to minimize the cost of hiring workers to fill
all the positions given that the total number of workers is equal to the total number of positions.
Input
The first line of input contains the number of test cases nTest (1<= nTest <= 10). Each test case contains:
The first line contains the number of worker types - m and number of task types - n.
The second line contains m positive integers: a(1), a(2), ..., a(m).
The third line contains n positive integers: b(1), b(2), ..., b(n).
Each of the next m lines contains n integers describing matrix C(i, j).
Notes:
1 <= m, n <= 200;
1 <= a(i), b(i) <= 30000;
1 <= C(i, j) <= 10000.
Sum of a(i) equals to sum of b(j).
Output
For each test case write the minimum cost in a separate line (it will fit in a signed 32-bit integer).
Example
Input:
2
3 4
16

3 6 7
2 5 1 8
1 2 3 4
8 7 6 5
9 12 10 11
4 4
1 3 5 7
2 4 2 8
1 4 7 3
4 7 5 3
5 7 8 3
5 3 6 8
Output:
110
54
Nhn 1
Ngy:
09-09-2006
im:
0.3
M bi:
MULONE
S ngi gii c/
lm:
227 / 295
Loi bi:
acm
T l ng:
27.5%
Thi gian chy:
4s
Bi chy tt nht:
lightning31 (100 im 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
C C99 strict C++ PAS gpc

PAS fpc JAVA C# PERL Ngun bi:
CAML
Cho s S = 111...11 (n ch s 1, h thp phn), tnh S2.
Input
- Dng u tin: s lng test k.
- k dng tip, mi dng ghi s n - s lng ch s 1 ca S. (1 <= n <= 1000000)
Output
- Vi mi test ghi kt qu trn 1 dng.
17
Example
Input:
2
1
2
Output:
1
121
Duyt binh
Ngy:
09-09-2006
im:
0.5
M bi:
PYRAMID2
S ngi gii c/
lm:
116 / 161
Loi bi:
acm
T l ng:
29.5%
Thi gian chy:
1s
Bi chy tt nht:
silver_arrow (100 im 0.04s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngun bi:
Hiu add y nh , k ch
T li ku ca ( ci account
t b li hay s
Ngn ng cho php:
Tt c
Vo nm 1945, Lin X ang nh nhau vi pht xt c ht sc c lit. Hng triu thanh nin Lin X phi
ln ng nhp ng. Mt cuc duyt binh din ra, cc tn binh khng bit ng quay mt v bn no lin
xp ty , v tng ch huy thy th lin ra lnh: Nu hai tn binh lin tip v i mt vi nhau th ngay lp
phi quay ngc li(180 ), ng tc ny din ra trong vng 1s!. Ngi tng ch huy mun bit sau bao
lu th th i hnh s ngng quay?
Input
Dng u ghi s nguyn N l s tn binh.
Dng th hai gm ng N k t th hin cch ng ca cc tn binh. Nu hai tn binh lin tip quay mt
vo nhau th s c biu din bi >
Output
Gm mt s duy nht ghi thi gian i hnh ngng quay.
Example
Input:
18

4
<><>
Output:
1
Ch thch :
Ti thi im 0: <><>
Ti thi im 1: <<>>
Truyn tin
Ngy:
09-09-2006
im:
0.4
M bi:
MESSAGE
S ngi gii c/
lm:
143 / 208
Loi bi:
acm
T l ng:
20.8%
Thi gian chy:
1s
Bi chy tt nht:
canhteo (100 im 0.41s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Mt lp gm N hc sinh, mi hc sinh cho bit nhng bn m hc sinh c th lin lc c (ch lin

lc ny l lin lc mt chiu : u c th gi tin ti v nhng v th cha chc c th gi tin ti u).
Thy ch nhim ang c mt thng tin rt quan trng cn thng bo ti tt c cc hc sinh. tit kim thi
gian, thy ch nhn tin ti 1 s hc sinh ri sau nh cc hc sinh ny nhn li cho tt c cc bn m cc
hc sinh c th lin lc c, v c ln lt nh th lm sao cho tt c cc hc sinh trong lp u nhn
c tin .
Hy tm mt s t nht cc hc sinh m thy ch nhim cn nhn.
Input
- Dng u l N, M (N <= 800, M l s lng lin lc 1 chiu)
- Mt s dng tip theo mi dng gm 2 s u , v cho bit hc sinh u c th gi tin ti hc sinh v
Output
- Gm 1 dng ghi s hc sinh cn thy nhn tin.
Example
Input:
19

12 15
1 3
3 6
6 1
6 8
8 12
12 9
9 6
2 4
4 5
5 2
4 6
7 10
10 11
11 7
10 9
Output:
2
Chn cc hc sinh 7 v 2.
Dy s Catalan
Ngy:
09-09-2006
im:
0.4
M bi:
CATALAN
S ngi gii c/
lm:
165 / 180
Loi bi:
acm
T l ng:
50.1%
Thi gian chy:
1s
Bi chy tt nht:
tungcitytia (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho s nguyn dng N, dy Catalan cp n l dy C(1), C(2) C(2n+1) gm cc s nguyn khng m tho
mn : C(1) = C(2n+1) = 0 vi i bt k 1 i 2n th C(i), C(i+1) hn km nhau 1 n v.
Vi mi n ta sp xp cc dy Catalan theo th t t in, nh s t 1 tr i . Yu cu :
1.Cho mt dy Catalan, hy tm th t ca dy.
2.Cho s nguyn dng k hy tm dy c th t k
Input
20

- Dng u ghi n. (n <= 15)
- Dng hai ghi mt dy Catalan cp n
- Dng 3 ghi mt s nguyn dng k (k c th rt ln nhng m bo lun c nghim)
Output
- Dng 1 ghi s th t dy dng 2 INPUT
- Dng 2 ghi dy ng vi s th t
Example
Input:
4
0 1 2 3 2 1 2 1 0
12
Output:
12
0 1 2 3 2 1 2 1 0
Ch s tn cng khc 0
Ngy:
09-09-2006
im:
0.5
M bi:
TCDFZ
S ngi gii c/
lm:
122 / 190
Loi bi:
acm
T l ng:
19.7%
Thi gian chy:
1s
Bi chy tt nht:
lyxuansang91 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho s t nhin n (n <= 10^9). Hy tm ch s tn cng khc 0 ca n!
Input
- Dng duy nht ghi s N.
Output
21

- Gm 1 dng duy nht ghi kt qu tm c.
Example
Input:
5
Output:
2
Thang my v tr
Ngy:
09-09-2006
im:
0.5
M bi:
ELEVATOR
S ngi gii c/
lm:
122 / 140
Loi bi:
acm
T l ng:
30.4%
Thi gian chy:
8s
Bi chy tt nht:
pink_rose9005 (100 im
- 0.18s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
USACO 3/2005
Nhng con b mun i vo v tr! Chng mun n c qu o bng cch xy mt kiu thang my: mt
ci thp khng l lm bng cc khi chng ln nhau. Chng c K (1 K 400) loi khi c th xy thp.
Mi khi loi i c chiu cao h_i (1 h_i 100) v c s lng c_i (1 c_i 10). Do kh nng b ph hy
bi cc tia v tr, khng c phn no ca khi loi i c th vt qua cao a_i (1 a_i 40000).
Gip nhng con b xy thang my cao nht c th bng cch chng cc khi ln nhau theo lut trn.
Input
* Dng 1: Mt s nguyn: K
* Dng 2..K+1: Mi dng cha 3 s nguyn c phn cch bi khong trng: h_i, a_i, v c_i. Dng i+1
miu t loa khi i.
Output
* Dng 1: Mt s nguyn H, ch cao ln nht ca thp c th xy c.
Example
Input:
3
22

7 40 3
5 23 8
2 52 6
Output:
48
GII THCH:
T di ln: 3 khi loi 2, 3 khi loi 1, 6 khi loi 3. Chng 4 khi loi 2 & 3 loi 1 khng hp l v nh
ca khi loi 1 vt qu cao 40.
Dy ngoc
Ngy:
09-09-2006
im:
0.9
M bi:
BRACKET
S ngi gii c/
lm:
54 / 71
Loi bi:
acm
T l ng:
25.3%
Thi gian chy:
1s
Bi chy tt nht:
princeathar (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Ngi ta nh ngha qui dy ngoc v cp ca dy nh sau:

+) Xu rng c gi l dy ngoc cp 0.
+) Nu S l xu ngoc cp k th (S) l xu ngoc cp k+1.
+) Nu A, B l cc dy ngoc th S = AB l mt dy ngoc vi cp bng s ln hn trong cp ca A v B.
nh ngha ny ch p dng cho nhng xu sinh ra theo qui tc qui trn.
Cho 2 s nguyn dng N v k, gi S l tp cc dy ngoc cp k di N.
1. Cho bit S c bao nhiu phn t.
2. Cho mt dy ngoc thuc, hy cho bit th t t in ca dy ny trong tp S.
Input
- Dng u ghi 2 s N, k (N chn, N <= 60, k <= n/2 ).
- Dng hai ghi 1 xu ngoc cp k di N.
23
Output
Gm hai dng, mi dng tr li 1 yu cu theo th t trn.
Example
Input:
6 2
(())()
Output:
3
2
Quan h
Ngy:
09-09-2006
im:
0.5
M bi:
COND
S ngi gii c/
lm:
130 / 159
Loi bi:
acm
T l ng:
43.6%
Thi gian chy:
1s
Bi chy tt nht:
ffffvpi (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Xt mt tp N i tng c th so snh c (2<=n<=10). Gia 2 i tng a v b c th tn ti 1 trong 3

quan h phn loi:
a = b; a < b; a > b;
Nh vy, vi 3 i tng (a, b, c) c th tn ti 13 quan h phn loi nh sau:
a = b = c; a = b < c; c < a = b; a < b = c
b = c < a; a = c < b; b < a = c; a < b < c
a < c < b; b < a < c; b < c < a; c < a < b
c < b < a;
Cho s n, hy xc nh s lng quan h phn loi khc nhau.
Input
Gm nhiu s n. Mi s trn 1 dng. Kt thc file l -1.
Output
24

Vi mi n, a ra s lng quan h phn loi tm c, mi s trn 1 dng (khng c dng trng).
Example
Input:
2
3
-1
Output:
3
13
Hai ng i
Ngy:
09-09-2006
im:
0.5
M bi:
HIWAY
S ngi gii c/
lm:
106 / 137
Loi bi:
acm
T l ng:
24.8%
Thi gian chy:
1s
Bi chy tt nht:
conankudo (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Mt mng giao thng gm N nt giao thng, v c M ng hai chiu ni mt s cp nt, thng tin v mt
ng gm ba s nguyn dng u, v l tn hai nt u mt ca ng, v l l di on ng . Bit
rng hai nt giao thng bt k c khng qu 1 ng hai chiu nhn chng lm hai u mt.
Cho hai nt giao thng s v f, hy tm hai ng i ni gia s vi f sao cho hai trn hai ng khng c
cnh no c i qua hai ln v tng di 2 ng i l nh nht.
Input
- Dng u ghi N, M (N 100)
- Dng th 2 ghi hai s s, f.
- M dng tip theo, mi dng m t mt ng gm ba s nguyn dng u, v, l.
Output
- Dng u ghi T l tng di nh nht tm c hoc -1 nu khng tm c.
- Nu tm c, hai dng sau, mi dng m t mt ng i gm: s u l s nt trn ng i ny, tip
theo l dy cc nt trn ng i bt u t s, kt thc ti f.
Ch : Phm vi tnh ton trong vng Longint.
Example
25
Input:
5 8
1 5
1 2 1
1 4 8
2 3 5
2 4 1
3 5 1
4 3 8
4 5 1
1 3 1
Output:
5
3 1 3 5
4 1 2 4 5
Trao i thng tin

Ngy:
09-09-2006
im:
0.7
M bi:
KWAY
S ngi gii c/
lm:
68 / 76
Loi bi:
acm
T l ng:
49.0%
Thi gian chy:
2s
Bi chy tt nht:
conankudo (100 im 0.23s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt mng thng tin gm n trm v m ng ni hai chiu gia cc trm. Trm s l trm ch huy, trm f
l trm iu khin. Sau mt ln b tin tc tn cng ly mt d liu t trm ch huy chuyn n trm iu
khin, ch huy mng quyt nh chia thng tin chuyn i thnh k n v thng tin chuyn theo k ng
n trm iu khin. M hai ng truyn bt k khng c chung bt k mt ng no.
Hy tm cch truyn k n v thng tin sao cho tng chi ph l nh nht.
Input
- Dng u l n, m, k, s, f (n 100).
- m dng tip l u, v, c cho bit c ng t u -> v v v -> u vi chi ph l c.
Output
26

- Dng u ghi 1 nu khng th chuyn k n v thng tin theo cch trn, ngc li ghi chi phi chuyn.
- k dng tip ln lt ghi cch chuyn ca tng n v thng tin. S u l s lng trm trn ng truyn,
tip l dy cc trm trn ng truyn (bt u t s, kt thc f)
Ch : Phm vi tnh ton l Longint.
Example
Input:
8 11 3 1 8
1 2 1
1 4 1
1 5 1
2 3 1
2 4 1
2 7 1
3 8 1
3 6 1
3 5 1
6 8 1
7 8 1
Output:
11
4 1 2 3 8
5 1 5 3 6 8
5 1 4 2 7 8
Lung vi chi ph nh nht

Ngy:
09-09-2006
im:
0.6
M bi:
MINCOST
S ngi gii c/
lm:
91 / 95
Loi bi:
acm
T l ng:
38.2%
Thi gian chy:
7s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt mng i xng c n nh, mi cnh ca mng c mt kh nng thng qua v mt cc ph vn

chuyn nht nh (nh nhau theo c hai chiu). Cho trc mt lng hng S cn vn chuyn t nh ngun
27

(nh s l s) ti nh ch (nh s l f). Hy tm mt phng n vn chuyn, ngha l hy xc nh trn
mi cnh ca mng cn vn chuyn bao nhiu hng, theo chiu no, sao cho ph hp vi kh nng thng
qua ca mng (trn mi cnh lng hng vn chuyn khng vt qu kh nng thng qua ca cnh) v vn
chuyn c lng hng S t ngun v ch vi tng chi ph vn chuyn l nh nht.
V mt ton hc, bi ton tm lung vi chi ph nh nht c th din t nh sau:
Cc tiu ha hm chi ph cijxij vi iu kin:
1. (xij - xji) vi j = 1..n, c gi tr
o
S nu i = s
0 nu i s; i n
-S nu i = f
2. 0 xij dij vi mi cnh (i, j)

y nh ngun c nh s l s, nh ch l f, cij l chi ph vn chuyn mt n v hng trn cnh (i, j),
dij l kh nng thng qua ca cnh (i, j); cn xij l khi lng hng vn chuyn trn cnh (i, j) cn xc nh.
Input
Dng u l n, m, k, s, f : S nh, s ng, s n v hng cn vn chuyn. nh bt u, nh kt

thc
m dng tip theo mi bao gm u, v, c, d cho bit c ng t u -> v, v -> u vi chi ph l c v kh

nng thng qua l d.
Output
Dng u, nu khng vn chuyn c ghi 1, nu c ghi tng chi ph vn chuyn.
Nu c nghim th mt s dng tip ghi u, v, i cho bit vn chuyn i n v hng t trn cnh u -> v.
Kt thc bng "0 0 0".
Example
Input:
6 8 5 1 6
1 2 1 2
1 4 3 4
2 3 1 4
2 5 5 2
3 4 2 4
3 6 1 2
4 6 4 1
5 6 6 2
Output:
28

43
1 2 2
1 4 3
2 5 2
3 6 2
4 3 2
4 6 1
5 6 2
0 0 0
Gii hn:
n <= 100
dij <= 30000
cij <= 109
Phm vi tnh ton l Longint.
Phn cng hoan thanh sm nh t

Ngy:
09-09-2006
im:
0.5
M bi:
ASSIGN1
S ngi gii c/
lm:
116 / 143
Loi bi:
acm
T l ng:
37.9%
Thi gian chy:
1s
Bi chy tt nht:
chungtq (100 im 0.19s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
C n ngi, n vic (1 < n 200). Ngi th i thc hin cng vic j mt C[i,j] n v thi gian. Gi s tt c
bt u vo thi im 0, hy tm cch b tr mi cng vic cho mi ngi sao cho thi im hon thnh
cng vic l sm nht c th.
Input
- Dng u: N
- Tip theo l ma trn C[i,j]. (thuc kiu Integer)
Output
- Ghi thi im sm nht hon thnh.
Example
29
Input:
4
10 10 10 2
10 10 3 10
4 10 10 10
10 5 10 10
Output:
5
Ri si
Ngy:
09-09-2006
im:
0.7
M bi:
STONE1
S ngi gii c/
lm:
67 / 83
Loi bi:
acm
T l ng:
24.7%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
C C++ PAS gpc PAS fpc

JAVA C# PERL PYTH
Ngun bi:
PHP LISP sbcl LISP clisp
HASK CAML BF
Xt tr chi ri si vi mt ngi chi nh sau:

Cho cy T v mt ng si gm K vin. mi bc ngi ta ly 1 vin si t ng si v t vo mt nt
l tu . Nu nt p c r nt l v tt c cc nt l u c si th ngi ta gom tt c cc vin si cc nt
l li, t 1 vin nt p, xo cc nt l v tr r - 1 vin si cn li vo ng si.
Tr chi kt thc khi t c 1 vin si vo nt gc
Yu cu: cho cy T, xc nh s vin si ti thiu cn c tr chi c th kt thc. Cy c n nt (N <=
400), nt gc c nh s 1.
Input
Dng u: s n.
Mt s dng tip theo, mi dng c dng: i m i1 i2 ... im. Trong m l s nt con ca nt i; i1, i2,
..., im: cc nt con ca nt i.
Output
30

S lng vin si t nht cn c.
Example
Input:
7
1 2 2 3
2 2 5 4
3 2 6 7
Output:
3
Xu con
Ngy:
09-09-2006
im:
0.4
M bi:
SUBSTR
S ngi gii c/
lm:
180 / 240
Loi bi:
acm
T l ng:
32.6%
Thi gian chy:
3s
Bi chy tt nht:
paulmcvn (100 im 0.09s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho xu A v xu B ch gm cc ch ci thng. Xu B c gi l xut hin ti v tr i ca xu A nu: A[i]

= B[1], A[i+1] = B[2], ..., A[i+length(B)-1] = B[length(B)].
Hy tm tt c cc v tr m B xut hin trong A.
Input
Dng 1: xu A.
Dng 2: xu B.
di A, B khng qu 1000000.
Output
Ghi ra cc v tr tm c trn 1 dng (th t tng dn). Nu B khng xut hin trong A th b trng.
Example
Input:
31

aaaaa
aa
Output:
1 2 3 4
Cc hnh ch nht
Ngy:
09-09-2006
im:
1.1
M bi:
RECT1
S ngi gii c/
lm:
30 / 48
Loi bi:
acm
T l ng:
15.2%
Thi gian chy:
1s
Bi chy tt nht:
trangviet1304 (100 im 0.34s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho N hnh ch nht trn mt phng. Cc cnh hnh ch nht song song vi cc trc ta . Nhng hnh ch
nht ny c th gi ln nhau, trng hoc l bn trong nhau. nh ca chng c ta nguyn, honh x
khng vt qu xmax v tung y khng vt qu ymax.
Mt on thng c mt u l im A(0, 0) v u kia l im B. im B tha mn cc iu kin sau:
+) Cc ta ca B l nhng s nguyn.
+) im B thuc on [(0, ymax), (xmax, ymax)] hoc on [(xmax, 0), (xmax, ymax)].
Vit chng trnh tm mt im B sao cho on AB ct qua nhiu hnh ch nht nht. (AB ct 1 hnh ch
nht khi chng c t nht 1 im chung vi nhau).
Input
- Dng u cha 3 s nguyn xmax, ymax (0 < xmax, ymax < 10^9) v N (1 <= N <= 10000).
- Mi dng trong N dng tip theo cha 4 s nguyn: x1, y1, x2, y2. (x1, y1) l ta nh tri di, (x2,
y2) l ta nh phi trn ca hnh ch nht tng ng.
Output
Dng duy nht ghi s lng ln nht cc hnh ch nht ct c.
Example
Input:
22 14 8
1 8 7 11
18 10 20 12
17 1 19 7
32

12 2 16 3
16 7 19 9
8 4 12 11
7 4 9 6
10 5 11 6
Output:
5
Khi lp phng ln nht

Ngy:
09-09-2006
im:
0.6
M bi:
MAXCUB
S ngi gii c/
lm:
101 / 111
Loi bi:
acm
T l ng:
44.1%
Thi gian chy:
1s
Bi chy tt nht:
botaydotcom (100 im 0.38s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt khi lp phng kch thc n chia lm n3 khi lp phng n v. Mi khi lp phng n v
cha 1 s nguyn.
Bn hy tm mt khi lp phng con ca khi lp phng cho sao cho tng cc s trong khi lp
phng con l ln nht.
Input
- Dng u: s lng test.
- Tip theo l cc test, mi test gm: dng u l n. Sau n nhm dng th hin lp ct ca hnh lp
phng nhn t mt trc t gn ra xa, mi nhm gm n dng, mi dng gm n s lit k cc s trn lp ct
t trn xung di, tri qua phi.
Ch : n <= 30. Gi tr ca khi lp phng n v thuc kiu integer.
Output
Mi dng cha tng ca khi lp phng con ln nht ca test tng ng.
Example
Input:
2
3
0 -1 3
33

-5 7 4
-8 9 1
-1 -3 -1
2 -1 5
0 -1 3
3 1 -1
1 3 2
1 -2 1
4
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
Output:
27
64
S chnh phng
Ngy:
09-09-2006
im:
1.3
M bi:
CP
S ngi gii c/
lm:
22 / 35
Loi bi:
acm
T l ng:
19.4%
Thi gian chy:
10s
Bi chy tt nht:
gerrob (100 im - 0.03s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:

PAS fpc JAVA NICE JAR Ngun bi:
C#
34

John l mt ngi rt am m ton hc, mt ln cu vit ra mt dy s cc ch s v nhn ra rng dy s
va vit c th tch thnh mt s on con lin tip, m mi on con to thnh mt s l s chnh phng.
V d: dy s 149 c th tch thnh 3 on: 1, 4, 9 -> mi on u l s chnh phng hoc c th tch
thnh 2 on 1 v 49.
John mun bit l c bao nhiu cch tch khc nhau (hai cch tch c gi l khc nhau nu tn ti mt v
tr tch khc nhau) dy ch s mnh va vit. iu kin l cc on tch ra khng bt u bng ch s 0.
Input
- Dng u l s lng test: nTest.
- nTest dng tip theo mi dng ghi ra dy ch s m John vit ( di khng qu 100).
Output
- Vi mi test ghi ra s lng cch tm c trn 1 dng.
Example
Input:
1
169
Output:
2
169 -> 169 = 13^2

169 -> 16 = 4^2 v 9 = 3^2.
Ma thin thch
Ngy:
09-09-2006
im:
0.7
M bi:
METERAIN
S ngi gii c/
lm:
80 / 118
Loi bi:
acm
T l ng:
23.0%
Thi gian chy:
1s
Bi chy tt nht:
vhhvvh (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Ph ng nhn c thng tin v mt trn ma thin thch sp p xung tri t. Khng nhng th, Ph ng
cn bit ta ca v tr im ri ca mi mt thin thch. Ph ng nh Cui xc nh xem c bao nhiu
thin thch c th ri xung cnh ng ca ng ta. Cnh ng ca Ph ng c dng mt hnh a gic li
c xc nh bi danh sch cc nh c lit k theo th t ngc chiu kim ng h.
Yu cu: Xc nh xem trong tp cho trc cc im ri ca thin thch, c bao nhiu im nm trong cnh
ng ca Ph ng. Cc im nm trn bin ca cnh ng khng c tnh l im nm trong cnh ng.
35
Input
- Dng u tin l s nguyn n (3 <= n <= 5000) l s nh ca a gic li m t cnh ng ca Ph ng.
- Mi dng trong n dng tip theo cha cp ta ca mt nh ca a gic li.
- Dng tip theo l s nguyn m (2 <= m <= 5000) - s thin thch ri xung.
- Mi dng trong s m dng cui cng cha 2 s l ta im ri ca mt thin thch.
Cc ta l cc s nguyn c tr tuyt i khng qu 10^6.
Output
Ghi ra m dng, mi dng tng ng vi 1 im ri ca thin thch. Ghi "YES" nu im ri ca thin thch
nm trong cnh ng v ghi "NO" nu tri li.
Example
Input:
4
2 4
8 4
6 8
4 6
4
3 5
4 7
5 5
6 7
Output:
NO
NO
YES
YES
H thng n
Ngy:
09-09-2006
im:
0.7
M bi:
LIGHT
S ngi gii c/
lm:
81 / 91
Loi bi:
acm
T l ng:
36.2%
Thi gian chy:
1s
Bi chy tt nht:
zlatan (100 im - 0.04s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
36

Khu vc t cc b xng ca mt Tng Cng Ty Xng Du c dng mt hnh ch nht c chia thnh m *
n vung. Cc vung c nh ta 1 -> m t trn xung, 1 -> n t tri sang.
Ti k ca li c t cc b xng. Ngi ta cn xy dng mt h thng n pha chiu sng, mi n ch
chiu dc theo hoc l hng hoc l ct ca li vung sao cho mi b cha xng phi c chiu sng
bi t nht mt n pha chiu dc theo hng hoc ct cha n. Bit:
- ai l chi ph xy dng n chiu sng dc theo hng.
- bj l chi ph xy dng n chiu sng dc theo ct.
Yu cu: Tm cch xy dng h thng n vi tng chi ph xy dng l nh nht.
Input
- Dng u tin cha 3 s nguyn dng m, n, k (m, n <= 100).
- Dng th hai cha m s nguyn a1, a2, ..., am.
- Dng th ba cha n s nguyn b1, b2, ..., bn.
- Dng th i trong k dng tip theo cha ta ca b xng th i.
Output
Mt dng duy nht ghi tng chi ph theo cch xy dng tm c.
Example
Input:
2 3 4
15 17
2 4 6
1 1
2 2
2 3
2 1
Output:
12
on con c tng ln nht

Ngy:
09-09-2006
im:
0.7
M bi:
GSS
S ngi gii c/
lm:
75 / 106
Loi bi:
acm
T l ng:
26.8%
Thi gian chy:
1s
Bi chy tt nht:
tienpro (100 im - 1.02s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
37

Ngn ng cho php:
Tt c
Ngun bi:
Bai` nay Hieu add day nhe

^^
Cho dy s a[1], a[2], ..., a[n] (|a[i]| <= 15000, n <= 50000).
Hm q(x, y) = max { tng(a[i]+a[i+1]+...+a[j]), x <= i <= j <= y }.
Cho m cu hi dng x, y (1 <= x <= y <= n). (m <= 50000) -> hy tnh cc q(x, y).
Bi ny test kh ln nn cc bn mun download test nh kch vo Edit problem trn download vy.
Input
- Dng u l n.
- Dng th hai l dy a.
- Dng th 3 l m.
- m dng tip theo mi dng l 1 cp s x, y.
Output
-> Ln lt ghi ra cc q(x, y) tng ng. Mi kt qu ghi trn 1 dng.
Example
Input:
3
-1 2 3
1
1 2
Output:
2
Gi tr ln nht
Ngy:
09-09-2006
im:
0.4
M bi:
QMAX
S ngi gii c/
lm:
181 / 214
Loi bi:
acm
T l ng:
33.6%
Thi gian chy:
1s-5s
Bi chy tt nht:
vanbongnb (100 im 0.38s)
38

Gii hn m ngun:
50000B
Ngi gi:
Ngn ng cho php:
Tt c
Ngun bi:
dtmp
Cho mt dy gm n phn t c gi tr ban u bng 0.

Cho m php bin i, mi php c dng (u, v, k): tng mi phn t t v tr u n v tr v ln k n v.
Cho q cu hi, mi cu c dng (u, v): cho bit phn t c gi tr ln nht thuc on [u, v]
Gii hn
n, m, q <= 50000
k>0
Gi tr ca mt phn t lun khng vt qu 231-1
Input
Dng 1: n, m
m dng tip theo, mi dng cha u, v, k cho bit mt php bin i
Dng th m+2: p
p dng tip theo, mi dng cha u, v cho bit mt php bin i
Output
Gm p dng cha kt qu tng ng cho tng cu hi.
Example
Input:
6 2
1 3 2
4 6 3
1
3 4
Output:
3
Bo v
Ngy:
09-09-2006
im:
0.6
M bi:
BAOVE
S ngi gii c/
lm:
98 / 138
39

Loi bi:
acm
T l ng:
16.8%
Thi gian chy:
2s-3s
Bi chy tt nht:
cun (100 im - 0.94s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Mt mng li gm N thnh ph, v mt s ng mt chiu ni cc cp thnh ph (gia hai thnh ph c

th c nhiu ng ni mt chiu).
Qun ch ang tp trung thnh ph N, nh tin cng ta thnh ph 1, v chng s tin cng trn tt c
cc con ng cha c bo v tin vo thnh ph 1. B ch huy ta cn xc nh s qun t nht trn cc
con ng chn ch tin v thnh ph 1.
Input
Dng u ghi N (N 5000)
Cc dng tip theo cho n ht file, mi dng mt t 1 ng gm u, v, s cho bit c on ng mt chiu
t u n v, v phi cn t nht s qun chn ch trn ng ny. (s 65000)
C khng qu 10000 ng.
Output
S qun t nht cn iu ng
Example
Input:
10
10 7 25050
6 1 12564
10 4 23916
5 1 61054
10 9 50950
9 1 35558
10 2 60941
3 1 22203
8 2 2853
5 7 31422
3 7 41491
8 7 27235
4 8 55965
8 6 41980
3 6 47707
2 3 45320
3 8 11237
7 6 38734
5 6 7561
40

3 5 8844
Output:
79169
Sao a giac
Ngy:
09-09-2006
im:
1.2
M bi:
POLY4
S ngi gii c/
lm:
28 / 37
Loi bi:
acm
T l ng:
25.2%
Thi gian chy:
1s
Bi chy tt nht:
just4one (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Cho cc a gic khng t ct, mt a gic c gi l a gic hnh sao nu nh tn ti mt im nm trong

a gic m t im c th nhn thy tt c cc im nm trong a gic .
Hai im l nhn thy nhau c ngha l khi ni chng th to thnh 1 on thng khng ct bt c mt cnh
no ca a gic.
Hy kim tra xem a gic c phi l a gic hnh sao khng?.
Input
Gm mt s test, mi test dng u l n (n <= 50) (s nh ca a gic).
Tip theo l n cp s nguyn x, y (-10000 <= x, y <= 10000) m t ta ca cc nh i theo mt chiu
nht nh (ngc hoc thun chiu kim ng h).
Kt thc test l s 0
Output
Ghi ra 1 hay 0 trn mt dng tng ng nu a gic l hnh sao hoc khng l hnh sao.
Example
Input:
3
0 0
0 1
1 1
6
66 13
96 61
41

76 98
13 94
4 0
45 68
8
27 21
55 14
93 12
56 95
15 48
38 46
51 65
64 31
0
Output:
1
1
0
Gi tr ln nht ver2
Ngy:
09-09-2006
im:
0.5
M bi:
QMAX2
S ngi gii c/
lm:
133 / 152
Loi bi:
acm
T l ng:
34.9%
Thi gian chy:
1s-3s
Bi chy tt nht:
gerrob (100 im - 0.54s)
Gii hn m ngun:
50000B
Ngi gi:
dtmp
Ngn ng cho php:
Tt c
Ngun bi:
Ging bi "Gi tr ln nht" trn.
Input
- n: s phn t ca dy (n <= 50000).
- m: s lng bin i v cu hi (m <= 100000).
+) bin i c dng: 0 x y value
+) cu hi c dng : 1 x y.
Output
Ghi ra tr li cho ln lt tng cu hi.
42
Example
Input:
6 3
0 1 3 3
0 4 6 4
1 1 6
Output:
4
Bng quan h
Ngy:
09-09-2006
im:
2.0
M bi:
REL7
S ngi gii c/
lm:
1 / 32
Loi bi:
acm
T l ng:
0.5%
Thi gian chy:
1s
Bi chy tt nht:
temptation (100 im 1.83s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Mr Le Minh Hoang
Cho mt ma trn A kch thc n*n ch gm cc gi tr { -1 , -2 , 0 , 1 , 2 , 3 }

Gi thit 2 <= n <= 300.
Bng A gi l tng thch vi dy T = (t1, t2, ..., tn), hay dy T tng thch vi bng A nu:
Aij = 0 : ti = tj
Aij = 1 : ti < tj
Aij = -1 : ti > tj
Aij = 2 : ti <= tj
Aij = -2 : ti >= tj
Aij = 3 : ti khc tj
(Vi mi i, j: 1 <= i, j <= n)
Yu cu : cho trc bng quan h A, hy tm dy s nguyn dng T = (t1, t2, ..., tn) tng thch vi bng A
m max(T) l b nht c th. Bit rng lun tn ti mt dy nh vy .
Input
Dng u tin l s nguyn N .
N dng sau mi dng gm N s nguyn m t ma trn A.
Output
Dng u tin ghi ra max( T ) . Dng th 2 ghi ra dy s T1 , T2 , .. Tn . Mi s ghi cch nhau t nht mt
du cch .
43
Example
Input:
6
0
-2
-2 -1
-2 -2
-1 -2
0 -1
-1 -2 -1 -1 -1
Output:
4
1 2 3 2 3 4
S lng bc
Ngy:
09-09-2006
im:
1.0
M bi:
DEGREE
S ngi gii c/
lm:
43 / 56
Loi bi:
acm
T l ng:
21.0%
Thi gian chy:
1s
Bi chy tt nht:
tinams (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Rybinsk State Avia

Academy
Mt s nguyn dng A gi l c bc K i vi c s B nu nh :
A = B^x1 + B^x2 + + B^xk
( trong x1 , x2 , , xk l cc s nguyn khng m tho mn x1 <> x2 <> x3 <> xk )
V d :
17 c bc 2 i vi c s 2 v 17 = 2^4 + 2^0 .
151 c bc 3 i vi c s 5 v 151 = 5^3 + 5^2 + 5^0.
Yu cu : Cho trc 1 on [X,Y] . Hy xc nh xem trong on ny c bao nhiu s c bc K i vi c
s B.
Gii hn :
1 <= X <= Y <= 10^9
1 <= K <= 25, 2 <= B <= 9
Chy c vi b nh thng bo < 800 K bn mi thc s l thnh cng
Input
1 dng gm 4 s nguyn dng X , Y , K , B
44
Output
Gm 1 dng duy nht ghi ra s lng s tm c .
Example
Input:
15 20 2 2
Output:
3
( Gii thch : l cc s 17 = 2^4 + 2^0 , 18 = 2^4 + 2^1 , 20 = 2^4 + 2^2 )
Mng 3 nh
Ngy:
09-09-2006
im:
0.5
M bi:
THREE
S ngi gii c/
lm:
110 / 122
Loi bi:
acm
T l ng:
29.7%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
10000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt a th v hng N nh, M cnh, mi cnh c 1 trng s nguyn dng.

Yu cu: Hy chn ra mt s cnh sao cho th to bi N nh v cc cnh c chn ny m bo lin
thng gia 3 nh 1, 2, 3 v tng trng s ca cc cnh c chn l nh nht. D liu vo m bo c
phng n.
Gii hn
3 N 100
4 M 20000
Trng s 1 cnh 10000
Input
Dng u tin gm 2 s nguyn: N, M.
M dng tip theo: dng th i gm 3 s nguyn dng U V C tng ng l cnh ny ni lin nh U

vi nh V, trng s l C.
45
Output
Dng 1: Chi ph nh nht.
Dng 2: S nguyn K l s cnh chn ra.
Ghi ra K s l ch s cc cnh chn, cc s ghi cch nhau t nht mt du cch.
Example
Input:
3 4
1 2 1
2 3 4
1 3 2
1 2 3
Output:
3
2
1 3
Huyn thoi Lc Vn Tin

Ngy:
09-09-2006
im:
0.4
M bi:
MINK
S ngi gii c/
lm:
150 / 177
Loi bi:
acm
T l ng:
34.0%
Thi gian chy:
1s
Bi chy tt nht:
raptor724 (100 im 0.2s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Do ny tivi cng ang chiu phim Lc Vn Tin , sn tin ly lun lm tiu .

Lc Vn Tin cng ging Samurai Jack , b Quan Thi S y vo vng xoy thi gian v b chuyn ti
tng lai ca nhng nm 2777 .
thi i ny , Trng s phi l ngi thng tho my tnh , g bn phm lia la nh u s thi xa ma
kim y v phi qua mt cuc thi lp trnh mi c phong danh hiu .
vt qua vng loi , Vn Tin cn tham gia cuc thi st hch . Ban Gim Kho cuc thi st hch gm c
N ngi , h u l cc cao th trong gii IT . Cc thnh vin trong Ban Gim Kho c nh s t 1 -> N
v mi ngi li c mt ch s sc mnh gi l APM ( Actions Per Minute ) . Cc gim kho s xp hng
ln lt t 1 -> N . Mi th sinh s phi u vi K v gim kho v K v gim kho ny phi ng lin thnh
1 on ( Tc l i , i+1 , i+2 , ... i+K-1 ) , ch cn thng 1 v gim kho th s vt qua vng loi .
Tuy nhin th sinh k c chn xem nhng gim kho no s u vi mnh .
46

Vn Tin rt lo v l may ng vi nhng v gim kho no "kh nhn" th s tiu mt . Nn chin thut
ca Vn Tin l tp trung h v gim kho c ch s APM thp nht trong s K v . Bn hy lp trnh gip
Lc Vn Tin xc nh c tt c cc phng n th ch s APM ca v gim kho thp nht s l bao
nhiu ( C tt c N-k+1 phng n :
Phng n 1 : Vn Tin phi u vi v 1 -> v k
Phng n 2 : Vn Tin phi u vi v 2 -> v k+1
Phng n N-k+1 : Vn Tin phi u vi v N-k+1 -> v N ) .

( 1 <= N <= 17000 , ch s APM ca 1 gim kho >= 1 v <= 2 t , 1 <= K <= N ) .
Bi ny O(N) mi thc s coi l accept . Cn li O(NlogN) hay O(N*K) th bn ch may

mn accept thi .
Input
Dng 1 : s T l s test .
Tip theo l T b test , mi b test c format nh sau :
Dng 1 : N k
Dng 2 : N s nguyn dng A[1] , A[N] .
Output
Kt qu mi test ghi ra trn dng , dng th i gm N-k+1 s , s th j tng ng l ch s APM ca v gim
kho yu nht trong phng n j .
Example
Input:
2
4 2
3 2 4 1
3 3
1 2 3
Output:
2 2 1
1
Chin trng qua

Ngy:
09-09-2006
im:
0.4
M bi:
KAGAIN
S ngi gii c/
lm:
153 / 164
Loi bi:
acm
T l ng:
42.3%
47

Thi gian chy:
1s
Bi chy tt nht:
bt09 (100 im - 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Li ni v Lc Vn Tin , sau khi vt qua vng loi tr thnh Trng S , anh gp c rmon v
c ch mo my cho i qu giang v th k 19 . Tr li qu hng sau nhiu nm xa cch , vi tm bng
Trng S hng 1 do Lin on Type Thut cp , anh c c Vua c lm i tng thng lnh 3 qun
chng li gic Qua xm lng . on qun ca anh s gm N i i , i i i c A[i] ( > 0 ) ngi . Qun
s trong 1 i i s ng thnh 1 ct t ngi 1 -> ngi A[i] , nh vy binh s s ng thnh N ct . V
Vn Tin quyt 1 trn s nh bi qun Qua nn c ra 1 qun on hng mnh nht . Trong s c chp
rng , qun on ca Vn Tin c ra lc l mt nhm cc i i c ch s lin tip nhau ( tc l i i i
, i + 1 , j ) . V s sch th mi mt ht c nn ch bit c mi th . Ngoi ra theo giang h n i th
sc mnh ca 1 qun on = s ngi ca i i t ngi nht * s i i c chn . Nhim v ca bn l
da trn cc thng s ca cc nh kho c c c , hy cho bit qun on m Vn Tin chn ra l t
i i no n i i no . Ch nu c nhiu phng n th ghi ra phng n m ch s ca i i u
tin c chn l nh nht .
Bi ny O(N) mi thc s coi l accept . Cn li O(NlogN) , O(N^2) th l do bn may

mn accept thi.
Input
Dng 1 : S T l s b test .
T nhm dng tip theo , mi nhm dng m t 1 b test . Nhm dng th i :
Dng 1: N ( <= 30000 )
Dng 2: N s nguyn m t N s A[1] , A[2] , A[N] ( cc s nguyn dng <= 30000 ).
.
Output
Kt qu mi test ghi ra trn 1 dng , gm 3 s : sc mnh qun on mnh nht , ch s ca i i u tin
v ch s ca i i cui cng c chn .
Example
Input:
2
4
3 4 3 1
4
1 2 1 3
Output:
9 1 3
4 1 4
48
Do chi quanh nh
Ngy:
09-09-2006
im:
1.0
M bi:
WALK
S ngi gii c/
lm:
39 / 46
Loi bi:
acm
T l ng:
53.3%
Thi gian chy:
1s
Bi chy tt nht:
thanh_an (100 im 0.09s)
Gii hn m ngun:
10000B
Ngi gi:
hard7771988
Ngun bi:
VI Ural State University

Collegiate Programming
Contest (21.10.2001)
Ngn ng cho php:
Tt c
Cho N vect c di khng qu L . Xt n vect i (x,y) ta c th chn vect i (x,y) hoc vect i ( -x,-y )
. Yu cu hy xc nh 1 cch chn cc vect sao cho vect tng ca N vect th c di khng qu sqrt(2)
*L.
1 <= N <= 10000 .
1 <= L <= 1000 .
Input
Dng 1 : 2 s nguyn N , L. N dng tip theo mi dng gm 2 s nguyn xi , yi m t vect i .
Output
Gm 1 dng ghi ra N s nguyn , s th i l 1 tng ng l chn vect (xi,yi) v 2 tng ng l chn vect
(-xi,-yi) . D li m bo c phng n.
Example
Input:
4 5
5 0
0 5
0 0
-3 4
Output:
1 2 1 1
Vua Midas thch vng

49

Ngy:
09-09-2006
im:
1.4
M bi:
MIDAS
S ngi gii c/
lm:
18 / 22
Loi bi:
acm
T l ng:
31.6%
Thi gian chy:
1s
Bi chy tt nht:
letheluu (100 im 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Mr Tran Quang Khai
Trong thn thoi Hy Lp, do c cng gip ngi thy ca thn Dyonysus, nh vua Midas c v thn
thng cho bng cch a ngi n mt hn o c dng mt a gic li N cnh. Hn o c chia
thnh cc vng bi M ng ro l cc on thng ni mt s cp nh ca a gic. Bit rng cc on ro
ch c im chung ti cc u mt (cc nh).
Thn Dyonysus ni vi Midas rng, nh vua c th chn K mnh bt k trong s cc mnh c to ra
bi ng bin ca o v cc ng ro, min sao K mnh phi ghp li thnh mt min lin tc.
Yu cu: Hy gip vua Midas tham lam chn ra K mnh sao cho min thu c c din tch ln nht.
Cc bn download test ti y.
Input
Dng u tin ghi 3 s nguyn dng N, M, K (K M 100, N 1000).
N dng tip theo, dng th i ghi hai s nguyn xi, yi l ta ca nh th i ca a gic li.
Cui cng l M dng, mi dng m t mt ng ro, gm 2 s u, v cho bit ng ro ni hai nh u v v.
Output
1 Dng duy nht ghi S l din tch ln nht tm c, chnh xc n 2 ch s sau du phy.
Example
Input:
8 4 2
0 0
0 2
1 4
3 5
5 5
6 4
6 2
4 0
1 3
3 8
4 7
50

4 8
Output:
13.50
Cu chuyn ngi lnh

Ngy:
09-09-2006
im:
1.6
M bi:
MILITARY
S ngi gii c/
lm:
10 / 27
Loi bi:
acm
T l ng:
9.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c ngoi tr: PHP
Ngun bi:
Ti vn nh chin trng in Bin nm rt c lit, rt nhiu ngi lnh ng xung. Ti vng cn c

ny, ch cho xy dng l ct, hng ro dy thp gai rt nhiu , vng trong ni vng ngoi, to thnh nhiu
vng bo v l dng hi tng ca 1 ngi lnh gi tng tham gia chin dch Ty Bc lch s.
Ln theo nhng trang s c ghi chp li, ngi ta bit rng tng Ct lc u cha chn v tr t
s ch huy m tm cch thit lp cc vng bo v bng dy thp gai ni cc c im li vi nhau, sau s
chn t s ch huy ti v tr an ton nht l v tr m c nhiu vng bo v bao quanh nht. Mi 1 vng
bo v l 1 a gic khng t ct to thnh bng cch ni 1 s c im li vi nhau bng dy thp gai, 1 c
im thuc v khng qu 1 vng bo v, cc vng bo v phi c thit lp sao cho gia 2 vng bo v bt
k X v Y th phn din tch chung ca X v Y = Min( din tch X, din tch Y ) hoc = 0. Trn mt phng
to , cc c im c coi nh cc im c to nguyn. Bn hy xc nh xem, s ch huy ca tng
Ct s c bo v ti a bi my vng bo v.
Download mt s test ti y
Input
Dng 1: s nguyn N l s c im. ( 1 N 4000 ).
N dng tip theo, dng th i gm 2 s nguyn xi, yi tng ng l to ca c im i . Cc to u l s
nguyn dng 10000 .
Output
Gm 1 dng duy nht ghi ra s lng vng bo v ti a m s ch huy ca tng Ct c th c bao
bc .
Example
Input:
51

4
100 100
200 100
100 200
300 300
Output:
1
Gii thch: Ta ni c im 1, 2, 3, 4 li to thnh 1 vng bo v, t tr s ch huy bn trong th ra c p

n. Ngoi ra cn c cc phng n khc l ni c im 1, 2, 3 to thnh 1 vng bo v, ni c im 2, 3, 4
thnh 1 vng bo v, nhng tt c cc phng n ny th khi chn v tr t tr s ch huy th vn ti a =
1.
Ci ti ( Hard version )
Ngy:
09-09-2006
im:
0.8
M bi:
HUGEKNAP
S ngi gii c/
lm:
62 / 109
Loi bi:
acm
T l ng:
15.9%
Thi gian chy:
5s
Bi chy tt nht:
night_fire (100 im 0.43s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngun bi:
Folklore - Sch thy

Hong , mc bi tp t
gii , bi s 1 .
Ngn ng cho php:
C++ PAS fpc
Cho N vt , vt i c khi lng W[i] v gi tr l V[i] . Mt ci ti c th chu c khi lng ti a l

M , qu th s rch. Hy tm cch nht 1 s vt vo trong ti sao cho ti khng b rch v tng gi tr ca
cc vt nht vo l ln nht.
Cc tiu ch yu cu : Chng trnh ca bn chy ng , b nh thng bo ngoi status nh hn 850
KB ( vi Free Pascal ) v nh hn 2850 KB ( vi C++ ) th bn mi c coi l accept . Yu cu ny
n gin l v bi ny ngun gc l dnh cho Turbo Pascal nn khi add ln trn ny th nh phi gii
hn vi cc bn 1 cht .
Nng time limit t 3s ln 5s cho cc bn d lm hn vy.
Input
Dng u tin l s nguyn T l s b test . ( 1 T 40 )
Mi b test s c format nh sau :
Dng 1 : 2 s nguyn dng N , M ( 1 N 10000 , 1 M 1000 ) .
Dng 2 : Gm N s nguyn l W[i] ( 1 W[i] 1000 ) .
Dng 3 : Gm N s nguyn l V[i] ( 1 V[i] 10000 ) .
52
Output
Vi mi b test :
Dng u tin ghi ra gi tr ln nht c th t c v s K l s vt la chn .
Dng th 2 ghi ra ch s ca K vt c chn .
Example
Input:
1
3 4
1 2 3
4 5 6
Output:
10 2
1 3
Floyd hoc Dijkstra ( C bn )

Ngy:
09-09-2006
im:
0.3
M bi:
FLOYD
S ngi gii c/
lm:
240 / 274
Loi bi:
acm
T l ng:
27.4%
Thi gian chy:
1s
Bi chy tt nht:
mr_invincible (100 im
- 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Cho n th v hng N nh v M cnh, trng s cc cnh u nguyn dng. C 2 loi cu hi :

0 u v : Cho bit ng i ngn nht t u ti v c di l bao nhiu.
1 u v : Hy ch ra 1 ng i ngn nht t u => v
Bi c bn ny nhm kim tra k nng xy dng cc module chng trnh con dnh cho truy vt 1 cch hp
l, s dng nhun nhuyn chng trnh con, li gi hm .
Download test v solution ti y
Input
Dng 1 : 3 s nguyn N , M , K . ( 1 N 100 , 1 M N*(N-1)/2 , 1 K 1000 )
M dng tip theo , dng th i gm 3 s nguyn dng u , v , c cho bit cnh (u,v) c trng s l c ( 1 c
10000 )
K dng tip theo l K cu hi , dng th j s c nh dng nh nu trn .
53
Output
ng vi mi cu hi trong K cu hi th ta phi tr li trn mi dng nh sau .
Cu hi 0 u v : Ghi ra 1 s nguyn duy nht l di ng i ngn nht t u -> v.
Cu hi 1 u v : Ghi ra s u tin l s X l s nh trn ng i ngn nht ny , tip ghi ra X s l ch
s cc nh theo th t xut hin trn hnh trnh .
Example
Input:
3 3 2
1 2 3
2 3 1
1 3 5
0 1 2
1 1 3
Output:
3
3 1 2 3
Mt cht v Huffman Tree

Ngy:
09-09-2006
im:
0.5
M bi:
HEAP1
S ngi gii c/
lm:
118 / 131
Loi bi:
acm
T l ng:
37.0%
Thi gian chy:
1s
Bi chy tt nht:
tienthanh (100 im 0.04s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
USACO
Mt ngi nng dn mun ct 1 thanh g c di L ca mnh thnh N ming , mi ming c di l 1 s

nguyn dng A[i] ( A[1] + A[2] + A[N] = L ) . Tuy nhin ct mt ming g c di l X thnh 2
phn th ng ta s mt X tin . ng nng dn ny khng gii tnh ton lm , v vy bn c yu cu lp
trnh gip ng ta cho bit cn dnh t nht bao nhiu tin th mi c th ct c tm g nh mong mun
.
Lu : Kt qu c th vt longint ( trong Pascal ) v vt long ( trong C++ ) y nh .
Input
54

Dng 1 : 1 s nguyn dng T l s b test .
T nhm dng tip theo m t cc b test , mi nhm dng gm 2 dng :
Dng 1 : s nguyn dng N ( 1 N 20000 ) .
Dng 2 : N s nguyn dng A[1] ,, A[N] . ( 1 A[i] 50000 )
Output
Kt qu mi test ghi ra trn 1 dng , ghi ra 1 s nguyn dng duy nht l chi ph ti thiu cn ct tm g
.
Example
Input:
1
4
1 2 3 4
Output:
19
u tin ct ming g thnh 2 phn c di 6 v 4 . Sau ct tip ming c di 6 -> 3 v 3 . Ct 1

ming 3 thnh 2 phn c di 1 , 2 . Nh vy chi ph l 10 + 6 + 3 = 19.
Php Xor
Ngy:
09-09-2006
im:
1.5
M bi:
XOR
S ngi gii c/
lm:
15 / 16
Loi bi:
acm
T l ng:
45.6%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Cho 1 tp N s nguyn dng A[1] , A[N] . Tp s ny c gi l ph thuc tuyn tnh nu tn ti 1 s

nguyn A[i] no tho mn :
A[i] = A[j1] xor A[j2] xor A[jk] ( vi i , j1 , j2 , , jk i mt khc nhau v k l 1 s tu ) . Nu tp s
ny khng ph thuc tuyn tnh th c gi l c lp tuyn tnh .
Hy kim tra tp N s nguyn dng A[1] A[N] c phi l c lp tuyn tnh hay khng ? Nu khng
hy ch ra phi loi i t nht bao nhiu phn t tp cn li l 1 tp c lp tuyn tnh .
Download test ti y. Solution ca bi ny s khng c upload , cc bn phi t gii.
Input
55

Dng 1 : s nguyn dng T l s b test .
Tip theo l T b test , mi b test c format nh sau :
Dng 1 : s N ( 1 N 10000 ) .
Dng 2 : N s nguyn dng A[1] A[N] .( 1 A[i] 2000000000 ) .
Output
Vi mi test , nu tp N s l c lp tuyn tnh th ghi ra YES ngc li ghi ra NO X vi X l s s t
nht cn phi b i tp cn li tr thnh c lp tuyn tnh .
Example
Input:
2
2
1 2
3
1 2 3
Output:
YES
NO 1
Xy dng lu i
Ngy:
09-09-2006
im:
1.1
M bi:
CASTLE
S ngi gii c/
lm:
34 / 46
Loi bi:
acm
T l ng:
17.9%
Thi gian chy:
1s
Bi chy tt nht:
aukcwe (100 im 0.17s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
AGAMES 2004
Vua Hng Vng th 18 ang mun xy dng cho mnh mt lu i trn mt khu t Ph Th. cho
n gin, ta s ta ha khu t theo h ta Cc. Theo cc kin trc s, m bo cc yu cu m
quan, lu i nn c xy theo hnh ch nht c cc cnh song song trc to . Cn theo thut phong
thy, cc gc ca lu i khng th xy t tu m ch c th t mt s v tr. Nh vua mun xy lu i
cho mnh va p li va hp phong thu. V bn, mt chuyn gia lp trnh, c yu cu gip nh vua.
Nh vua cn mun bit c bao nhiu cch xy lu i, v trong c bao nhiu cch xy c din tch ln
nht v c din tch nh nht, cc din tch l bao nhiu?
56
Lu cc bn ci bi ny phi ci tht tinh t . Solution mu ca tc gi bi ny mnh

submit th m bo n b chy qu thi gian ( Time Limit Exceeded , kch vo link xem
All Submissions trn ) . O(N^2) l thut ton chun , O(N^2*logN) nu ci tt th cng
c th accept .
Input
Dng th nht ghi s N l s im c th t gc lu i.( 1 N 5000 )
N dng sau ghi 2*N s nguyn l ta N im c th t gc lu i. ( Cc ta ca cc im l cc s
nguyn c trong khong 2^31 )
Output
Dng th nht ghi s M l s cch xy lu i.
Nu M > 0, dng th hai ghi 2 s SMAX, CMAX l din tch ln nht ca lu i v s lng lu i c
din tch l SMAX.
Dng th 3 ghi 2 s SMIN, CMIN l din tch nh nht ca lu i v s lng lu i c din tch l SMIN.
Example
Input:
8
1 1
1 2
1 3
2 1
2 2
2 3
3 1
3 2
Output:
5
2 2
1 3
Lp lch sa cha t
Ngy:
09-09-2006
im:
0.4
M bi:
CAR
S ngi gii c/
lm:
177 / 197
Loi bi:
acm
T l ng:
36.6%
57

Thi gian chy:
1s
Bi chy tt nht:
necid (100 im - 0.15s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Mr Le Minh Hoang
Mt c s sa cha t c nhn n chic xe sa. Do cc nhn vin lm vic qu li nhc nn n hn

tr cho khch hng m vn cha tin hnh sa c chic xe no. Theo hp ng k kt t trc, nu bn
giao xe th i qu hn ngy no th s phi tr thm mt khon tin pht l A[i].
ng ch c s sa cha quyt nh sa thi ton b cng nhn v thu nhn cng mi. Vi lc lng mi
ny, ng ta d nh rng sa chic xe th i s cn B[i] ngy. Vn t ra i vi ng l phi lp lch sa
tun t cc chic xe sao cho tng s tin b pht l t nht.
Yu cu: Hy lp lch sa xe gip cho ng ch c s sa cha t.
Download test v solution ti y.
Input
Dng 1: Cha s n (n 10000)
Dng 2: Cha n s nguyn dng A[1], A[2], ..., A[n] (1 A[i] 10000)
Dng 3: Cha n s nguyn dng B[1], B[2], ..., B[n] (1 B[i] 100)
Output
Dng 1: Ghi s tin b pht ti thiu
Dng 2: Ghi s hiu cc xe s tin hnh sa cha, theo th t t xe c sa u tin n xe sa sau cng
Example
Input:
4
1 3 4 2
3 2 3 1
Output:
44
4 2 3 1
Xong cng vic 4 vo cui ngy 1 => phi tr 2 * 1 = 2 .

Xong cng vic 2 vo cui ngy 3 => phi tr 3 * 3 = 9.
Vy tng cng phi tr 44 .
Lp lch trn 2 my
58

Ngy:
09-09-2006
im:
0.5
M bi:
TWO
S ngi gii c/
lm:
134 / 154
Loi bi:
acm
T l ng:
32.9%
Thi gian chy:
1s
Bi chy tt nht:
buiminhtri (100 im 0.12s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Folklore
C N chi tit my cn c gia cng ln lt trn 2 my A v B. Thi gian gia cng chi tit i trn my A l
a[i], thi gian gia cng trn my B l b[i]. Hy tm trnh t gia cng cc chi tit trn 2 my sao cho vic hon
thnh gia cng tt c cc chi tit l sm nht c th.
Input
Dng 1: s nguyn dng N (1 N 10000).
Dng 2: N s nguyn dng a[1], , a[n]. (1 a[i] 10000)
Dng 3: N s nguyn dng b[1], , b[n]. (1 b[i] 10000)
Output
Dng 1: S nguyn dng T l thi im sm nht c th hon thnh.
Dng 2: N s nguyn l lch trnh gia cng cc chi tit my.
Example
Input:
3
2 3 1
1 2 3
Output:
7
3 2 1
Lp lch trn 3 my
Ngy:
09-09-2006
im:
0.6
M bi:
MACHINE
S ngi gii c/
lm:
86 / 92
59

Loi bi:
acm
T l ng:
36.8%
Thi gian chy:
1s
Bi chy tt nht:
naebolo (100 im 0.15s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Folklore
C N chi tit my cn c gia cng ln lt trn 3 my A , B v C. Thi gian gia cng chi tit i trn my A
l a[i] , thi gian gia cng trn my B l b[i] , thi gian gia cng trn my C l c[i] . Bit rng 1 trong 2 iu
kin sau y c tho mn : max( b[i] ) min( a[i] ) hoc max( b[i] ) min( c[i] ) ( i = 1,n ) .
Hy tm trnh t gia cng cc chi tit trn 3 my sao cho vic hon thnh gia cng tt c cc chi tit l sm
nht c th .
Input
Dng 1 : s nguyn dng N ( 1 N 10000 ) .
Dng 2 : N s nguyn dng a[1] , a[n] . ( 1 a[i] 10000 )
Dng 3 : N s nguyn dng b[1] , b[n] .( 1 b[i] 10000 )
Dng 4 : N s nguyn dng c[1] , c[n] .( 1 c[i] 10000 )
Output
Dng 1 : S nguyn dng T l thi im sm nht c th hon thnh .
Dng 2 : N s nguyn l lch trnh gia cng cc chi tit my .
Example
Input:
2
1 2
3 2
4 4
Output:
12
1 2
Dy nghch th di K
Ngy:
09-09-2006
im:
0.7
M bi:
KINV
S ngi gii c/
lm:
75 / 96
Loi bi:
acm
T l ng:
35.6%
60

Thi gian chy:
1s
Bi chy tt nht:
tikiupi (100 im - 0.17s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Dmitry Gozman Contest 1
Cho dy N s nguyn dng A[1] , A[N] l mt hon v ca 1 , 2 , 3 , N .

Mt dy nghch th di k l 1 dy A[j1] > A[j2] > A[j3] > A[jk] vi j1 < j2 < j3 < jk . Hy m
xem c tt c bao nhiu dy nghch th di k .
Input
Dng 1 : 2 s nguyn dng N v k ( 2 N 10000 , 2 k 10 ) .
Dng 2 : N s nguyn dng A[1] A[N] .
Output
Gi s T l s lng dy nghch th c di k , hy ghi ra T mod 10^9 .
Example
Input:
3 2
3 2 1
Output:
3
o giu vng
Ngy:
09-09-2006
im:
0.7
M bi:
GOLD
S ngi gii c/
lm:
71 / 73
Loi bi:
acm
T l ng:
66.4%
Thi gian chy:
1s
Bi chy tt nht:
khuc_tuan (100 im 0.96s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Polish Olympiad in
Informatics
1 nh thm him n va pht hin ra mt bn kho bu . Trn bn miu t 1 hn o nm nam Thi

Bnh Dng . Trn hn o c N v tr c kho bu l cc m vng . c php khai thc nh thm him
quyt nh dc ht tin ca ra mua 1 mnh t v khai thc cc m vng trn . Tuy nhin Nh thm him
cng khng giu c g lm nn ch c th mua c 1 ming t hnh ch nht c kch thc ti a l S * W
61

v theo yu cu ca Cha o th ming t phi song song vi 2 trc Ox v Oy khng lm mt m quan
ca hn o ( cc m vng nm trn ng bin ca ming t cng s c quyn khai thc ) . Bn hy lp
trnh gip Nh thm him tnh xem ng ta c th chim c nhiu nht l bao nhiu m vng .
Lu : Bi ny nu khng cn thn s rt d b ng nhn . V vy nn phi c bit ch . L 1 bi
kh v th nn sau mt thi gian s cho cc bn c th xem li gii v download test .
Input
Dng 1 : 2 s nguyn dng S W ( 1 S , W 10000 ). S l di cnh song song vi trc Ox . W l di
cnh song song vi trc Oy .
Dng 2 : s nguyn dng N ( 1 N 15000 ) .
N dng tip theo , dng th i m t v tr ca m vng th i l 2 s nguyn xi v yi . ( -30000 xi , yi
30000 ) .
Output
Gm 1 dng duy nht ghi ra s lng nhiu nht m vng m Nh thm him c th c c .
Example
Input:
1 2
12
0 0
1 1
2 2
3 3
4 5
5 5
4 2
1 4
0 5
5 0
2 3
3 2
Output:
4
Cy P nh ( C bn )
Ngy:
09-09-2006
im:
0.6
M bi:
PTREE
S ngi gii c/
105 / 113
62

lm:
Loi bi:
acm
T l ng:
45.5%
Thi gian chy:
1s
Bi chy tt nht:
mhung (100 im - 0.01s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Folklore
Cho mt cy gm N nh , mi nh c 1 nhn C[i] gi l trng s ca nh i . Hy tm 1 cy con gm P nh

sao cho tng trng s ca cy con ny l ln nht . Hiu 1 cch n gin l tm P nh sao cho P nh ny
lin thng v tng trng s l ln nht .
V bi ny l mc kh tuy nhin li c nhiu ng dng nn cc bn c th xem li gii, download
test. Ni chung cng c th xp bi ny vo nhm bi c bn .
Input
Dng 1 : 2 s nguyn dng N v P . ( 1 P N 200 ) .
Dng 2 : N s nguyn dng C[1] , C[N] . ( -1000 C[i] 1000 ) .
N 1 dng tip theo , mi dng gm 2 s nguyn dng u , v m t 1 cnh ca th .
Output
Gm 1 dng ghi ra P s nguyn l ch s ca P nh c chn .
Example
Input:
3 2
1 2 3
1 2
2 3
Output:
2 3
Mng in
Ngy:
09-09-2006
im:
0.9
M bi:
ENET
S ngi gii c/
lm:
53 / 63
Loi bi:
acm
T l ng:
24.0%
63

Thi gian chy:
1s
Bi chy tt nht:
mai_an (100 im - 0.02s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Mr Tran Quang Khai
Xt mt mng in gm N nt (nh s t 1 n N) v h thng gm M ng dy , mi ng dy ni trc

tip mt cp nt no ca mng . Vi mc nh kho st hiu th gia hai nt s, t no ca mng nh
hng n in p ca cc nt trong mng, ngi ta mun xc nh cc nt gi l cc nt th nng ca
mng. Mt nt ca mng c gi l nt th nng nu nh vic truyn ti in nng t nt s n nt t trn
mng c th thc hin theo tuyn ng dy c i qua nt ny ng thi mi nt ca mng xut hin trn
tuyn ng dy ny khng qu mt ln.
Yu cu: Xc nh tt c cc nt th nng ca mng in .
Download test ti y. Solution ca bi ny s khng c upload , cc bn phi t gii. Lu l y l b
test th , cn b test dng trong chng trnh check c th khc .
Input
Dng u tin cha bn s N, M, s, t (N 1000, M 15000).
Dng th i trong M dng tip theo cha hai s Di, Ci l cc s hiu hai nt tng ng hai u mt ca
ng dy th i.
Output
Dng u tin ghi s K l s lng nt th nng tm c.
Dng th i trong K dng cui cng ghi s hiu ca nt th nng th i , cc ch s c ghi theo th t tng
dn .
Example
Input:
3 2 1 3
3 1
1 2
Output:
2
1
3
64
Din tch hnh ch nht

Ngy:
09-09-2006
im:
0.6
M bi:
AREA
S ngi gii c/
lm:
101 / 122
Loi bi:
acm
T l ng:
31.0%
Thi gian chy:
1s
Bi chy tt nht:
bkama (100 im - 0.24s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
BOI 2001
Trn mt phng to ngi ta v ra N hnh ch nht . Hy tnh din tch che ph bi N hnh ch nht ny ,
bit rng N hnh ch nht ny song song vi 2 trc Ox v Oy .
Input
Dng 1 : s nguyn N ( 1 N 10000 ) .
N dng tip theo , mi dng gm 4 s nguyn x1 , y1 , x2 , y2 tng ng l to gc tri di v gc phi
trn ca hnh ch nht th i.( 0 x1 x2 30000 , 0 y1 y2 30000 ) .
Output
Gm 1 dng ghi ra din tch ph bi N hnh ch nht
Example
Input:
2
10 10 20 20
15 15 25 30
Output:
65

225
Th trng , tr gii tr tui teen

Ngy:
09-09-2006
im:
0.7
M bi:
EGG
S ngi gii c/
lm:
79 / 112
Loi bi:
acm
T l ng:
30.9%
Thi gian chy:
1s
Bi chy tt nht:
romand3 (100 im 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Folklore
Ti tr con c c N qu trng c cng nh nhau . Trong gi ra chi chng quyt nh th xem trng
cng n mc no bng cch th trng t trn tng cao xung t xem cao no th trng s v . Gi s
cng ca trng l E th th trng cc tng t tng 1 -> tng E trng s khng v , v th trng bt u
tng E + 1 tr i trng s v . Cch lm nng dn nht l ta c em th tng tng mt t thp ln cao n
tng no trng v l bit ngay nhng m nh th phi th nhiu ln qu , gi ra chi ca bn tr con khng
c lu n th , hn na ti n c ti N qu trng nn c v 1 s qu cng chng sao , min l t c
mc ch ca mnh .
Bn l mt lp trnh vin siu hng , sau khi nghe ni nim ca bn tr , bn c th gip g c bn tr
khng ? Hay l s chu thua ? Nu gii c bi ton hc ba ny th bn hy th submit xem no . Bit rng
to nh trng hc ca bn tr c tt c M tng ( nu trng khng v tng M th c th coi nh n c
cng l M ) .
Ch nu khng cn thn s rt d b ng nhn . D lm cch no i na th vn mun thu vn l
phi chng minh c tnh ng n ca thut ton .
Input
Dng 1 : s test T ( 1 T 10000 ) .
T dng tip theo mi dng gm 2 s nguyn N M ( 1 N , M 1000 ) .
Output
Vi mi test ghi ra s lng ln th t nht ( X ) c th xc nh c r rng cng ca qu trng ( k
c trong trng hp xu nht th vi X ln th cng c th xc nh c cng ca qu trng ) .
Example
Input:
2
66

1 10
2 5
Output:
10
3
Gii thch test 1 ( N=1, M=10 ) : Gi s ta bt u th trng tng 5 . Nu trng v -> ta khng cn trng
th na ( v ta c mi mt qu trng ) -> khng th xc nh c cng ca trng l 0 hay 1, 2, 3, 4 .
Nu ta th trng t tng 1 , trng v -> cng ca trng l 0 , nu khng v ta li th tip tng th 2 ,
c lm nh vy th trng hp t nht l trng c cng l 10 th ta phi mt ti 10 ln th .
Cp ghp khng trng s

Ngy:
09-09-2006
im:
0.4
M bi:
MATCH1
S ngi gii c/
lm:
177 / 188
Loi bi:
acm
T l ng:
40.6%
Thi gian chy:
1s
Bi chy tt nht:
ktun (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngun bi:
Cun DSAP ca thy L

Minh Hong, gio vin
khi chuyn S Phm
Ngn ng cho php:
Tt c
Cho th hai pha G = (X U Y, E); Cc nh ca X k hiu l x1, x2, ..., xm, cc nh ca Y k hiu l y1,
y2, ..., yn.
Mt b ghp trn G l mt tp cc cnh thuc E i mt khng c nh chung.
Yu cu: Hy tm b ghp cc i (c nhiu cnh nht) trn G.
Ch : Dng Eof ch khng dng SeekEof.
Input
Dng 1: Cha hai s m, n (1 m, n 100)
Cc dng tip, mi dng cha hai s nguyn dng i, j cho bit thng tin v mt cnh (xi, yj) thuc E.
Output
Dng 1: Ghi s cnh trong b ghp cc i tm c (K).
K dng tip theo, mi dng ghi thng tin v mt cnh c chn vo b ghp cc i: Gm 2 s u, v th
hin cho cnh ni (xu, yv).
67
Example
Input:
4 5
1 1
1 4
2 1
2 2
2 4
3 2
3 3
4 2
4 3
Output:
4
1 1
2 4
3 3
4 2
B ghp y trng s cc tiu

Ngy:
09-09-2006
im:
0.5
M bi:
MATCH2
S ngi gii c/
lm:
126 / 147
Loi bi:
acm
T l ng:
33.3%
Thi gian chy:
1s
Bi chy tt nht:
- 0.09s)
68

Gii hn m ngun:
Ngn ng cho php:
50000B
Tt c
Ngi gi:
hard7771988
Ngun bi:
Sch DSAP ca thy L

Minh Hong , gio vin
khi chuyn S Phm
Cho th hai pha G = (X U Y, E); Cc nh ca X k hiu l x1, x2, ..., xn, cc nh ca Y k hiu l y1,
y2, ..., yn. Mi cnh ca G c gn mt trng s khng m. Mt b ghp y trn G l mt tp n cnh
thuc E i mt khng c nh chung. Trng s ca b ghp l tng trng s cc cnh nm trong b ghp.
Rng buc: Lun tn ti t nht mt b ghp y trn G.
Ch dng Eof ch khng dng SeekEof
Input
Dng 1: Cha s n (1 n 200)
Cc dng tip theo, mi dng cha 3 s nguyn i, j, c cho bit c mt cnh (xi, yj) v trng s cnh l c
(0 c 200).
Output
Dng 1: Ghi trng s b ghp tm c
n dng tip, mi dng ghi hai s (u, v) tng trng cho mt cnh (xu, yv) c chn vo b ghp.
Example
Input:
4
1 1 0
1 2 0
2 1 0
2 4 2
3 2 1
3 3 0
4 3 0
4 4 9
Output:
3
1 1
2 4
3 2
4 3
69
Giao lu
Ngy:
09-09-2006
im:
0.8
M bi:
FLOW1
S ngi gii c/
lm:
62 / 72
Loi bi:
acm
T l ng:
31.3%
Thi gian chy:
1s
Bi chy tt nht:
letheluu (100 im 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Tuyn tp 150 bi ca
thy L Minh Hong
Cuc thi giao lu "Tt Ta Tin (TTT)" gia hai i S Phm (SP) v Tng Hp (TH) c m bi ton tin hc,
mi i c n hc sinh tham d. Cc bi ton c nh s t 1 n m v cc hc sinh ca mi i c
nh s t 1 ti n.
Hc sinh ca hai i u l nhng lp trnh vin xut sc, tuy nhin mi hc sinh c th gii quyt nhng bi
ton thuc s trng ca mnh hiu qu hn nhng bi khc.
Hy gip thy My t chc cuc thi theo th thc sau:
Chn ng n cp u, mi cp gm 01 hc sinh SP v 01 hc sinh TH lm 01 bi ton trong s nhng bi
ton ny.
C ng n bi ton c mang ra thi
Hc sinh no cng c tham gia
Bi ton cho cp u bt k phi thuc s trng ca c hai th sinh trong cp
Bit rng lun tn ti phng n thc hin yu cu trn.
Input
Dng 1: Cha hai s n, m (1 n m 255)
n dng tip theo, dng th i ghi danh sch cc bi ton thuc s trng ca hc sinh SP th i.
n dng tip theo, dng th j ghi danh sch cc bi ton thuc s trng ca hc sinh TH th j.
Ch dng Eoln ch khng dng SeekEoln
Output
Gm m dng, dng th k ghi s hiu th sinh SP v s hiu th sinh TH trong cp u bng bi ton k, nu
bi ton k khng c mang ra thi th ghi vo dng ny hai s 0 .
Example
Input:
4 6
3 6
1 2
70

2 4
5
6
3 5 6
4
1 2 6
Output:
2 4
0 0
0 0
3 3
4 2
1 1
T mu nh nht
Ngy:
09-09-2006
im:
0.7
M bi:
CTREE
S ngi gii c/
lm:
73 / 81
Loi bi:
acm
T l ng:
46.8%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Mr Tran Quang Khai
Cho mt cy gm N nt, hy tm cch gn mi nh mt nhn nguyn dng sao cho:

+ Hai nt c cnh ni c gn bi hai nhn khc nhau.
+ Tng gi tr cc nhn l nh nht.
Input
Dng u tin ghi N ( 1 N 10000).
N-1 dng tip theo, mi dng ghi hai nt l hai u mt ca mt cnh thuc cy.
Output
Dng u tin ghi S l tng gi tr nhn tm c.
N dng tip theo, dng th i ghi nhn gn cho nh i trong php gn ti u tm c.
Example
71
Input:
8
1 2
1 3
1 4
1 5
5 6
5 7
5 8
Output:
11
3
1
1
1
2
1
1
1
Du lch
Ngy:
09-09-2006
im:
1.4
M bi:
TWOSAT
S ngi gii c/
lm:
18 / 30
Loi bi:
acm
T l ng:
11.4%
Thi gian chy:
1s
Bi chy tt nht:
nt_d2 (100 im - 0.24s)
Gii hn m ngun:
30000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Da theo BOI 2001
Mt cng ty du lch t chc cho 1 on du khch nc ngoi i du lch M thnh ph Vit Nam . Tuy nhin
mi du khch li c 2 yu cu . Mi yu cu c dng Khng mun i thnh ph A hoc Mun i thnh
ph A ( A l ch s thnh ph m ngi yu cu ) . ( C th c trng hp 2 yu cu ca khch l
Mun i thnh ph A v V cc du khch ny l ngi nc ngoi nn rt kh tnh , h mun t nht 1
trong 2 yu cu ca h phi c p ng . Bn cng ty du lch au u tm cch chn ra cc thnh ph
a on du khch i m vn cha tm c cch no c . Bn c yu cu gip cng ty du lch ny
chn ra 1 s thnh ph a on du khch ny i m li va tho mn c cc du khch ny .
Input
72

Dng 1 : 2 s nguyn N v M ( 1 N 20000 , 1 M 8000 ) tng ng l s khch du lch v s thnh
ph .
M dng tip theo gm 2 s nguyn u , v , -M u ,v M ( u <> 0 , v <> 0 ) m t yu cu ca khch th i (
s dng nu yu cu du khch i mun i thnh ph v s m nu khng mun i thnh ph ).
Output
Dng 1 : Ghi YES nu c phng n tho mn yu cu cc du khch v ghi NO trong trng hp ngc li .
Nu YES th ghi tip theo nh sau :
Dng 2 : s nguyn dng K l s thnh ph c chn .
Dng 3 : Gm K s nguyn l ch s ca cc thnh ph c chn .
Example
Input:
2 3
-1 -2
1 2
Output:
YES
2
2 3
Dch chuyn tc thi

Ngy:
09-09-2006
im:
1.1
M bi:
TELEPORT
S ngi gii c/
lm:
30 / 38
Loi bi:
acm
T l ng:
31.8%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Da theo BOI 2001
Php s v i Byter ph php to nn 2 hn o trn bin Baltic : oBornholm v o Gotland . mi

o th ng cng to nn mt vi cng dch chuyn tc thi ( CDCTT ) . Mi CDCTT s l 1 trong 2 loi
hnh sau :
1 ) Cng n : Ngi ta s c di chuyn ti cng ny .
2 ) Cng i : Khi bc vo cng ny ngi ta s c a ti 1 Cng n duy nht xc nh nm hn o
kia .
Mt ln Byter giao cho cc hc tr ca mnh bi ton nh sau : Cho bit s lng CDCTT mi hn o
. Cc hc tr phi xc nh xem cng no s l Cng n , cng no s l Cng i sao cho tho mn yu
cu sau : Gi s cng i c t l Cng n th c t nht 1 Cng i s a ngi c dch chuyn ti
73

cng i ny v ngc li , cng i c t l Cng i th cng m n gi ngi n phi c t l Cng
n .
Input
Dng 1 : 2 s nguyn N v M ( 1 N , M 50000 ) tng ng l s CDCTT trn o Bornhom v
Gotland .
Dng th 2 gm N s nguyn A[1] A[N] m t cc CDCTT o Bornhom : s A[i] cho bit nu nh
Cng th i trn o Bornhom c t l Cng i th n s gi ngi n Cng A[i] trn o Gotland . ( 1
A[i] M ) .
Dng th 3 gm M s nguyn B[1] B[M] m t cc CDCTT o Gotland : s B[i] cho bit nu nh
Cng th i trn o Gotland c t l Cng i th n s gi ngi n Cng B[i] trn o Bornhom . ( 1
B[i] N ) .
Output
Dng 1 : N s nguyn C[1] C[N] ghi cch nhau 1 du khong trng , C[i] = 1 nu cng i trn o
Bornhom l Cng i v = 0 nu cng i l Cng n .
Dng 2 : M s nguyn D[1] D[M] ghi cch nhau 1 khong trng, D[i] = 1 nu cng i trn o Gotland l
Cng i v = 0 nu cng i l Cng n .
Example
Input:
4 5
3 5 2 5
4 4 4 1 3
Output:
0 1 1 0
1 0 1 1 0
74
Thng nht t nc
Ngy:
09-09-2006
im:
1.6
M bi:
ELECT
S ngi gii c/
lm:
10 / 16
Loi bi:
acm
T l ng:
8.8%
Thi gian chy:
1s
Bi chy tt nht:
overtherainbow (100
im - 0.18s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Base on problem of
Wojciech Rytter
Sau nhiu nm chin tranh lin min gia cc ng phi , nc X ri vo tnh trng i ngho , ngi dn
kh cc trm b . Nhn thc c tip tc ko di chin tranh s cng bt li cho t nc , cc ng trong
nc X quyt nh hp bn nhau li , b qua him khch chung xy dng li t nc. Vic lm u
tin s l hp chn ra cc v i biu lp nn Quc Hi . Mi ng chn ra 2 gng mt tiu biu
nht cho ng ca mnh ng c vo Quc Hi . Tuy nhin trong s cc v i biu ca cc ng ny th
c mt s v v l do c nhn trong chin tranh nn rt cm th nhau ( v d nh l ng A ca ng P ght
ng B ca ng Q ) . V l do chnh tr m trong Quc Hi mi ng ch c php c mt ngi m
thi . Ngoi ra m bo Quc Hi lm vic 1 cch cng minh th cc v i biu Quc Hi phi c
chn ra sao cho m bo khng c ai th ght ai c nu khng rt c th chin tranh s li n ra . Bn l mt
ngi yu chung ho bnh ng thi l 1 lp trnh vin siu hng . Bn hy xem xt xem liu c 1 cch t
chc Quc Hi sao cho tho mn c cc yu cu ra hay khng ?
Input
Dng 1 : 2 s nguyn N v M ( 1 N 8000 , 1 M 20000 ) tng ng l s ng v s mi quan h th
ght nhau gia cc thnh vin ca cc ng . ( Cc thnh vin ca ng 1 c s hiu l 1 , 2 ; cc thnh vin
ca ng 2 c s hiu l 3 , 4 Thnh vin ca ng i s c s hiu l i*2-1 v i*2 ) .
M dng tip theo mi dng gm 2 s nguyn u , v cho bit ngi u v ngi v ght nhau . ( 1 u < v N*2
).
Output
75

Dng 1 : Ghi 0 nu khng c phng n tho mn v 1 nu c phng n tho mn.
Nu dng 1 l 1 th dng th 2 ghi ra N s nguyn l s hiu ca cc thnh vin c chn vo Quc Hi .
Example
Input:
3 2
1 3
2 4
Output:
1
1 4 5
Tri thm
Ngy:
09-09-2006
im:
1.5
M bi:
CARPET
S ngi gii c/
lm:
15 / 19
Loi bi:
acm
T l ng:
23.3%
Thi gian chy:
1s
Bi chy tt nht:
botaydotcom (100 im 0s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Base on a problem of
Alexander Mironenko
Snh ng ln ca khi chuyn S Phm c xy dng dnh cho l k nim 40 nm thnh lp

trng . Nn nh ca snh ng c kch thc l 2000*2000 mt vung . V lt nn cho snh ng
ngi ta cn lt cc tm gch c kch thc l 1 mt vung . Tht khng may l gn n ngy k nim
trng ri th do s ca 1 s cng nhn lm sn ra nn , lm hng mt v p ca snh ng . Tuy
nhin tht may mn l vn c th mua thm cng mu v che i nhng ch b dnh sn .
C mt iu rt k th l vt sn li c hnh l mt cung ca hnh trn ( c tm nm trong phm vi
nn nh ) . Bn thi cng mun sa cha li lm bng cch mua mt tm thm c dng l mt hnh ch nht
v sau tri ln sn nh che i vt sn sao cho cnh ca tm thm sau khi tri s trng vi cc cnh ca cc
vin gch ( tc l cc gc ca tm thm s phi c to nguyn ) . iu au u ca bn thi cng gi l
khng bit mua tm thm vi kch thc bao nhiu th l c th lp c ht vt sn m din tch ming
thm li l nh nht . Bn hy lp trnh gip bn thi cng gii bi ton kh ny . V bn l lp trnh vin
rt gii nn bn thi cng ch cho bn bit to ca 2 im u mt ca cung v ca 1 im nm trn cung
trn m thi .
Ch bi ny nn lm cn thn , suy xt ht cc trng hp c th xy ra .
76
Input
Dng 1 : S nguyn dng T l s b test ( 1 T 45 ) . T nhm dng tip theo , mi nhm dng m t 1
b test , c format nh sau :
2 dng u , mi dng gm 2 s nguyn l to ca 2 im u mt ca vt sn .
Dng th 3 gm 2 s nguyn l to ca 1 im nm trn vt sn . Bit rng cc to u l s
nguyn c tr tuyt i 1000 v cung trn nm trong hnh vung [-1000,1000] * [-1000,1000] .
Output
Vi mi test ghi ra 1 s nguyn X l din tch nh nht ca ming thm .
Example
Input:
1
476 612
487 615
478 616
Output:
66
S hc 1
Ngy:
09-09-2006
im:
1.3
M bi:
JACOBI
S ngi gii c/
lm:
22 / 55
Loi bi:
acm
T l ng:
13.9%
Thi gian chy:
3s
Bi chy tt nht:
gerrob (100 im - 0.49s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Michael Medvedev
Tm tt c s cc nguyn x tho mn (x*x) mod n = a mod n . Trong n l s nguyn t v c chung ln

nht ca a v n = 1 , 0 x n 1 .
Input
Dng 1 : s nguyn K l s b test ( 1 K 100000 ) . K dng tip theo mi dng gm 2 s nguyn a , n ( 1
a , n 32767 ) .
Output
77

Vi mi test ghi ra tt c cc s nguyn x tho mn theo th t tng dn trn 1 dng . Nu khng c s
nguyn x no tho mn th ghi ra Khong co .
Example
Input:
5
4 17
3 7
2 7
14 31
10007 20011
Output:
2 15
Khong co
3 4
13 18
5382 14629
Chu vi cc hnh ch nht

Ngy:
09-09-2006
im:
1.2
M bi:
RECTP
S ngi gii c/
lm:
25 / 41
Loi bi:
acm
T l ng:
15.1%
Thi gian chy:
1s
Bi chy tt nht:
cun (100 im - 0.3s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
IOI
Cho N hnh ch nht c cc cnh song song vi cc trc Ox v Oy .

Hy tnh chu vi ca hnh to bi N hnh ch nht ny . Vi nh ngha chu vi ca N HCN l tng di cc
ng bin gip phn bit u l min nm trong cc HCN v min nm ngoi cc HCN .
Ch : N hnh ch nht ny c th tch ri nhau , khng nht thit l ln nhau .
Input
Dng 1 : s nguyn N ( 1 N 10000 ) .
N dng tip theo , mi dng gm 4 s nguyn x1 , y1 , x2 , y2 tng ng l to gc tri di v gc phi
trn ca hnh ch nht th i .( 0 x1 x2 30000 , 0 y1 y2 30000 ) .
Output
78

Gm 1 dng ghi ra chu vi ca N hnh ch nht .
Example
Input:
2
10 10 20 20
15 15 25 30
Output:
70
Gii thch test v d : l tng di cc on t m trong hnh v .
Din tch cc tam gic vung cn

Ngy:
09-09-2006
im:
1.2
M bi:
TRIANGLE
S ngi gii c/
lm:
27 / 29
Loi bi:
acm
T l ng:
52.9%
Thi gian chy:
1s
Bi chy tt nht:
just4one (100 im 0.15s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
BOI 2002
Cho N tam gic vung cn . Hy tnh din tch min b ph bi N tam gic ny .
Input
79

Dng 1 : s nguyn N ( 1 N 2000 ) .
N dng tip theo , mi dng gm 3 s nguyn xi , yi , mi ( -10^7 xi , yi 10^7 , 1 mi 1000 ) m t to
tam gic th i , 3 nh tam gic i s c to (xi,yi) , (xi+mi,yi) , (xi,yi+mi) .
Output
Gm 1 dng duy nht ghi ra din tch min b ph .
Example
Input:
5
-5 -3 6
-1 -2 3
0 0 2
-2 2 1
-4 -1 2
Output:
24.5
Khong cch mong manh

Ngy:
09-09-2006
im:
1.5
M bi:
POINT
S ngi gii c/
lm:
12 / 29
Loi bi:
acm
T l ng:
29.7%
Thi gian chy:
7s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Da theo 1 bi d hn ca
USACO
80

Cho N im phn bit trn mt phng to . To ca im i l ( Xi , Yi ) trong Xi , Yi l cc s
nguyn ( -10000 Xi , Yi 10000 ) .
Ta nh ngha khong cch gia 2 im (X1,Y1) , (X2,Y2) l khong cch Manhattan c tnh = | X1 X2
| + | Y1 Y2 | .
Hm Q(X,Y) := | X X1 | + | X X2 | + + | X Xn | + | Y Y1 | + |Y Yn | .
( Trong X , Y l 2 s nguyn tho mn -10000 X , Y 10000 v Xi X hoc Yi Y vi mi i = 1 .. n )
.
Hy tm tp tt c cc im nguyn (X,Y) hm Q(X,Y) c gi tr nh nht .
Input
Dng 1 : s nguyn dng T l s b test ( T 20 ) .
Cc nhm dng sau m t 1 b test . 1 b test s c format nh sau :
Dng 1 : s nguyn dng N ( N 10000 ) .
N dng tip theo , dng th i gm 2 s nguyn l to ca im th i .
Output
Vi mi b test ghi 1 dng gm 2 s nguyn dng S , K tng ng l gi tr nh nht ca hm Q(X,Y) v
s lng im tho mn yu cu .
Example
Input:
1
2
0 1
1 0
Output:
2 2
Bo ng
Ngy:
09-09-2006
im:
1.4
M bi:
ALERT
S ngi gii c/
lm:
17 / 21
Loi bi:
acm
T l ng:
28.4%
Thi gian chy:
1s
Bi chy tt nht:
taek (100 im - 0.1s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Th gii nhng nm 2077 hnh thnh nn 2 thi cc r rng , cc nc hoc l i theo con ng Ch Ngha
X Hi hoc l theo T Bn Ch Ngha. Khi xng nn cc lung t tng ny l 2 nc Lo v
81

Campuchia . Lo v 1 s nc thn Lo theo ng li X Hi Ch Ngha cn Campuchia v 1 s nc
thn Campuchia theo T Bn Ch Ngha. Nh ta bit nn kinh t cc nm trong tng lai l nn kinh t
tri thc v ca cc mi quan h. Nu trc y 2 nc X v Y c quan h kinh t l Z t la vi nhau v gi
X theo CNXH cn Y theo TBCN th 2 nc ny s ct t mi quan h kinh t vi nhau , i vi nn kinh
t th gii th thc s l 1 tn tht ln , cn nu 2 nc cng i theo cng 1 con ng chnh tr th mi quan
h vn c duy tr . Tuy nhin nm nay mi l nm 2007 v th mi ch c Lo , cc nc thn Lo l
theo CNXH v Campuchia v cc nc thn Campuchia theo TBCN , cn li cc nc vn theo con ng
trung lp v ti nm 2077 h mi chn TBCN hay l XHCN.
Bit bn rt gii lp trnh , cc chuyn gia thuc Lin Hp Quc mun nh bn hy lp trnh tnh xem ti
nm 2077 th trong tnh hung tt nht th Tng Gi Tr Kinh T Ton Cu l bao nhiu ? Bit rng Tng
Gi Tr Kinh T Ton Cu c tnh bng tng gi tr cc mi quan h kinh t gia cc nc trn th gii .
Input
Dng 1 : S nguyn dng N ( 1 N 200 ) l s lng cc quc gia trn th gii , cc quc gia c nh
s th t t 1 -> N .
Dng 2 : S nguyn dng L l cc nc tnh ti thi im hin ti ang theo CNXH .
Dng 3 : Gm L s nguyn dng l ch s ca cc nc ang theo CNXH .
Dng 4 : S nguyn dng C l cc nc tnh ti thi im hin ti ang theo TBCN.
Dng 5 : Gm C s nguyn dng l ch s ca cc nc ang theo TBCN .
Dng 6 : S nguyn dng M ( 1 M N*(N-1)/2 ) l s quan h kinh t gia cc nc trn th gii .
M dng tip theo , dng th i gm 3 s nguyn dng Xi Yi Zi ( 1 Xi Yi N , 1 Zi 1000 ) m t 1
mi quan h kinh t .
Output
Dng 1 : S nguyn dng K l Tng Gi Tr Kinh T Ton Cu trong tnh hung tt nht v s nguyn
dng T l s nc theo XHCN trong tnh hung .
Dng 2 : Ghi ra ch s ca T nc theo CNXH trong tnh hung tt nht . Nu c nhiu phng n th ch
ra phng n m c s lng nc theo CNXH l nhiu nht .
Example
Input:
3
1
1
1
3
1
1 2 10
Output:
10 2
1 2
82
Chui ht
Ngy:
09-09-2006
im:
0.8
M bi:
CHUOIHAT
S ngi gii c/
lm:
57 / 66
Loi bi:
acm
T l ng:
41.7%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Thy Nguyn Thanh Hng

- PTNK
Khi tin hnh khai qut kho c mt vng quc xa xa n, cc nh khoa hc khai qut c rt nhiu
chui ht l. Sau khi quan st, cc nh khoa hc thy rng cc chui ht c mt s c im chung.
Mi chui ht l mt si dy c nh cc ht ngc lm bng mt cht liu c xa. Cc chui ht u c s
lng ht ngc bng nhau. Hn na, mi ht ngc l mt hnh cu c ng knh l mt s nguyn dng,
v nu ln t tri sang phi trn chui ht, ngi ta thy cc ht ngc c ng knh tng dn. Nu nh s
v tr cc ht ngc bt u t 1, theo th t t tri sang phi, ngi ta nhn thy rng ht ngc th i c ng
knh khng vt qa 2i. Cc nh khoa hc cho rng, dn tc c xa ny hn lm ra tt c cc chui ht c
cng nhng c im ny, d chng hin cn ang ri rc u trn tri t.
Sau khng lu, cc nh khoa hc tm ra mt mnh da, trn c ghi mt con s theo loi ch s c xa.
H cho rng mnh da ny c lin quan n cc chui ht k l n. Sau nhiu c gng, cc nh khoa hc
a c con s trn mnh da v h ch s thp phn, v k hiu l X.
Manh mi n y th dng li, v cc nh khoa hc khng tm thy c vt tch no khc na, v cng
khng tm ra c mi quan h gia X v cc chui ht.
n y, mt nh khoa hc ngi Vit ngh, hy th xc nh chui ht c th t t in l X, bit u
y s l manh mi?
Yu cu
Bn hy vit chng trnh gip nh khoa hc xc nh chui ht c th t t in l X.
D liu
Dng 1: cha s nguyn dng N, l s ht ngc trong mi chui ht
Dng 2: cha s nguyn dng X
Kt qa
Gm 1 dng duy nht, cha N s nguyn, cch nhau mt khong trng, xc nh chui ht c th t t in
l X.
83

( biu din mt chui ht, cn in ra N s nguyn tng ng l ng knh ca cc ht ngc trong chui
ht, theo th t t tri sang phi)
Gii hn
N l s nguyn dng trong phm vi [1, 250]
X l s nguyn dng trong phm vi t 1 n s lng ti a cc chui ht.
V d
D liu
2
4
Kt qa
2 3
Gii thch
Cc chui ht sp theo th t t in:
1 2, 1 3, 1 4, 2 3, 2 4
Chui ht th 4 l 2 3
Lch thi u bng

Ngy:
09-09-2006
im:
1.2
M bi:
BONGDA
S ngi gii c/
lm:
28 / 52
Loi bi:
acm
T l ng:
23.0%
Thi gian chy:
1s
Bi chy tt nht:
vanbongnb (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Thy Nguyn Thanh Hng

- PTNK
Mt gii thi u bng c t chc theo th thc thi u vng trn, hai i bng bt k s c thi
u vi nhau ng mt trn.
Trong mi trn u, i thng c 3 im, cn i thua c 0 im. Khng c kt qa ha (nu ha trong
hai hip chnh th hai i s phi thi u lun lu phn nh thng thua).
84

Kt thc ma gii, i v ch l i c s im cao nht. Trong trng hp c nhiu hn mt i c
im cao nht th cc i ny ng ot chc v ch.
Gii din ra c mt thi gian. Lc ny mt bi ton ny sinh: ngi ta cn bit mi i bng cn c
kh nng ot chc v ch na hay khng?
Yu cu
Bit kt qa cc trn u din ra, bn hy cho bit mi i bng cn c kh nng ot chc v ch ma
gii na hay khng?
D liu
Dng 1: cha s nguyn dng N l s i bng tham gia gii u. Cc i bng c nh s th

t t 1 n N.
N dng tip theo, dng i cha N s nguyn dng ai1, ai2, ... , aiN, trong aij cho bit trng thi ca
trn u gia i i v i j:
o
aij = 0, nu i j thng.
aij = 1 nu i i thng
aij = 2 nu trn u cha din ra.

Nu i khc j, d liu vo m bo aij= aji = 2 hoc aij + aji = 1. D liu vo m bo aii = 0 vi
mi i
Kt qa
Gm 1 dng duy nht, l mt dy nh phn di N, bit th i bng 1 nu i bng i cn kh nng v
ch ma gii, v bng 0 nu i bng i khng cn kh nng v ch ma gii.
Gii hn
V d
D liu
5
0 2 0 2 1
2 0 0 1 0
1 1 0 2 1
2 0 2 0 2
0 1 0 2 0
Kt qa
10110
85
Nhn ca cy
Ngy:
27-04-2007
im:
1.0
M bi:
ITREE
S ngi gii c/
lm:
37 / 41
Loi bi:
acm
T l ng:
53.3%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Cho th cy c trng s gm N nh , cc nh c nh s t 1 -> N . Gc ca cy l nh 1 . Cha ca

nh u l 1 nh c s hiu nh hn u . Mi nh c mt nhn l 1 s thc A[i] . Trong nhn ca nh 1
bng 1 v nhn ca nh l bng 0 . Bit rng A[v] A[u] nu v l con ca u .
Gi tr ca 1 cy = Tng ( ( A[u] A[v] ) * Trng s cnh (u,v) , vi u l cha ca v )
By gi ngi ta cho bit cc cnh ca th v trng s ca cc cnh ny nhng khng cho bit cc A[i].
Hy tnh xem gi tr ca cy thp nht l bao nhiu.
Input
Dng 1 l s nguyn T l s b test . ( 1 T 50 ) . T nhm dng tip theo m t tng b test . Mi b test
s c cu trc nh sau :
Dng 1 : s nguyn dng N ( 1 N 1000 ) .
T dng 2 -> dng N : dng th i gm 2 s nguyn dng u v c ( 1 u < i , 0 c 1000 ) cho bit cha ca
nt i l nt u v cnh ni (u,i) c trng s l c .
Output
Vi mi test ghi ra gi tr thp nht c th t c ca cy trn 1 dng vi chnh xc l 2 ch s sau du
chm.
Example
Input:
1
4
1 1
1 2
2 1
Output:
3.00
86

Gii thch : Phng n ti u l A[1] = 1 , A[2] = 0.5 , A[3] = 0 , A[4] = 0 .

Ngy:
27-04-2007
im:
0.5
M bi:
THEME
S ngi gii c/
lm:
120 / 135
Loi bi:
acm
T l ng:
33.5%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
USACO , thanks Hoanh

Tien
Trong mt bn nhc thng c nhng on nhc m tc gi s dng n nhiu ln ( t nht 2 ln ). Nhng

on gi l "on cao tro". Do c th s dng nhiu ging khc nhau ( son, la, si...) nn nt u tin ca
cc ln xut hin c th khc nhau, nhng chnh lnh cao gia hai nt lin tip th chc chn ging.
VD: hai on sau
1 2 5 4 10
v
4 5 8 7 13
c coi l mt on cao tro, v chng cng s chnh lch cao : +1,+3,-1,+6
Cho mt bn nhc, yu cu tm di on cao tro di nht.
+ on cao tro phi c t 5 nt nhc tr ln.
+ Nhng ln xut hin ca on khng c chng ln nhau ( khng c nt nhc chung ).
Input
Dng 1 : n = s nt nhc <= 5000
Mt s dng sau l n nt nhc, mi nt c quy ra s t nhin trong phm vi 1..88.
Output
1 dng cha 1 s duy nht l di on cao tro di nht. Nu khng tm c on nhc no, in ra 0.
Example
Input:
30
25 27 30 34 39 45 52 60 69 79 69 60 52 45 39 34 30 26 22 18
82 78 74 70 66 67 64 60 65 80
87

Output:
5
(5 nt cui dng 1 v 5 nt u dng hai cng l mt on)
Chi bi-a 1 l
Ngy:
08-07-2007
im:
0.3
M bi:
CHEAT
S ngi gii c/
lm:
194 / 234
Loi bi:
acm
T l ng:
31.0%
Thi gian chy:
1s
Bi chy tt nht:
funnnny (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Alex Samsonov
Mike chi bi-a 1 l rt gii nn kim c rt nhiu tin banh . Nh Ci mt nhiu tin v Mike lm nn
c lm nn h quyt phi kim tra xem liu Mike c chi gian hay khng ?
Th thc chi bi-a 1 l l nh ny : C N vin bi c nh s t 1 -> N , t trn bn , ngi chi phi
nh sao cho cc vin bi ny lt l theo ng th t t 1 -> N . Vin i s phi vo l trc vin i+1 .
kim tra Mike , nh Ci thu 1 tay thm t . Tay thm t ny s kim tra bng cch l thnh thong li tin
li ci l v bc ln vin trn cng trong l . Sau khi Mike nh ht cc bi vo l ri th thm t s bc
ht cc vin trong l ra t vin trn cng ti vin di cng . Hy gip thm t xc nh xem liu Mike c
chi gian khng ? ( Xem test v d hiu r hn ) .
Download test v solution ti y
Input
Dng 1 : s nguyn dng N ( N 100000 ) . N dng tip theo mi dng gm 1 s nguyn ghi ra s ch trn
tri bi m thm t ln lt bc ln c .
Output
Nu xc nh c Mike chi gian th ghi ra YES , ngc li ghi NO .
Example
Input:
3
3
1
2
Output:
88

YES
Gii thch : Khi thm t bc c bi s 3 ln th c ngha l bi s 1 , 2 vo l ri . V nh vy bi trn

cng sau khi bc bi s 3 ra phi l bi s 2 nhng thm t li bc ra c bi s 1 -> v l -> Mike n gian .
Input:
6
1
3
5
6
4
2
Output:
NO
C th xy ra trng hp thm t bc vin bi 1, 3, 5 ngay khi Mike va nh chng vo l. Sau thm t

bc nhng vin bi cn li. Do khng khng nh c Mike n gian!
C gi chn b
Ngy:
22-07-2007
im:
0.7
M bi:
COWGIRL
S ngi gii c/
lm:
73 / 80
Loi bi:
acm
T l ng:
56.8%
Thi gian chy:
1s
Bi chy tt nht:
letheluu (100 im - 0s)
Gii hn m ngun:
10000B
Ngi gi:
hard7771988
Ngun bi:
Thank to Nguyn Trn

Nam Khnh and Nguyn
Hong Ngha
Ngn ng cho php:
Tt c
Trn mt tho nguyn nh b c 1 gia nh gm 3 anh em: 2 ngi anh trai l Nvutri v Andorea cn ngi
em gi l Lola. Cuc sng gia nh kh gi nhng gia nh c truyn thng chn nui v mun cc con t
lp nn cha m 3 ngi quyt nh cc con hng ngy s i chn 1 s b no (ty 3 ngi con).
Tho nguyn l 1 cnh ng chia lm M*N vung, mi con b ch ng trong 1 v mi ch cha 1 con
b.Ch c 1 quy tc duy nht l khng bao gi c 4 con b to thnh 1 hnh vung 2*2 hoc trng 1
khu t 2*2.
Hai ngi anh mi chi nn hi l kem Lola chn b 1 mnh. Lola mun bit tt c c bao nhiu cch
xp b tha mn quy tc trn phng mi trng hp. V con s ny rt ln nn hy gip Lola tnh ton
con s ny.
89
Input
Dng u gm 1 s T duy nht l s test (T 111)
T dng tip theo gm 2 s M, N cho bit kch thc ca tho nguyn (M*N 30)
Output
Gm T dng, mi dng ng vi 1 test l s cch xp b ca test .
Example
Input:
1
1 1
Output:
2
Cn thng bng
Ngy:
10-08-2007
im:
1.1
M bi:
RTF
S ngi gii c/
lm:
34 / 39
Loi bi:
acm
T l ng:
28.1%
Thi gian chy:
1s
Bi chy tt nht:
mrbomb (100 im - 0s)
Gii hn m ngun:
5000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
C 1 b N loi qu cn , loi qu i nng A[i] kg . Mt b con ca b N qu cn gm k loi qu cn l A[i1] ,

A[i2] , A[ik] gi l thay th c b N loi qu cn trn nu nh tn ti h ng thc sau :
A[1] = A[i1] * H[1][1] + + A[ik] * H[1][k]
A[2] = A[i1] * H[2][1] + + A[ik] * H[2][k]
A[N] = A[i1] * H[N][1] + + A[ik]* H[N][k]

Trong H[i][j] l cc s nguyn .
Hy tm b qu cn thay th c cho b N qu cn vi s phn t l nh nht .
Input
Dng 1 l s nguyn T l s b test ( 1 T 100 ) . Cc dng tip theo m t T b test , mi b test gm 2
dng :
Dng 1 : S nguyn dng N ( N 100 ) .
Dng 2 : N s nguyn dng A[1] , , A[N] ( A[i] 60000 )
90
Output
Vi mi b test ghi ra 1 s nguyn dng l s lng qu cn ca nhm tm c .
Example
Input:
1
3
2 3 4
Output:
2
S hc 2
Ngy:
02-09-2007
im:
1.5
M bi:
NEWJ
S ngi gii c/
lm:
13 / 27
Loi bi:
acm
T l ng:
25.5%
Thi gian chy:
3s
Bi chy tt nht:
just4one (100 im - 1.2s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Michael Medvedev
Tm tt c s cc nguyn x tho mn (x*x) mod n = a mod n. Trong n l s nguyn t v c chung ln

nht ca a v n = 1, 0 x n 1 .
Input
Dng 1: s nguyn K l s b test ( 1 K 120000 ). K dng tip theo mi dng gm 2 s nguyn a , n ( 1
a, n 1000000 ).
Output
Vi mi test ghi ra tt c cc s nguyn x tho mn theo th t tng dn trn 1 dng . Nu khng c s
nguyn x no tho mn th ghi ra Khong co.
Example
Input:
5
4 17
91

3 7
2 7
14 31
10007 20011
Output:
2 15
Khong co
3 4
13 18
5382 14629
HAOI 5000
Ngy:
10-09-2007
im:
1.1
M bi:
HAOI5000
S ngi gii c/
lm:
36 / 48
Loi bi:
acm
T l ng:
22.6%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
duonghanguyen
Ngun bi:
Based on problem
HAOI5000 (author Pham
Hai Minh - used in HAOI
2007). Thank to Ly Xuan
Sang and Nguyen Thanh
An.
Ngn ng cho php:
Tt c
Th thc ca cuc thi tin hc HAOI mi nm li c thay i khng lm th sinh cm thy nhm chn.
Chc hn cc bn vn nh nhng cuc thi HAOI 3000, 4000 c m t nhng ln trc. n ln th
5000, cuc thi li c xy dng theo mt phong cch khc hn. Phng thi l mt khu c dng hnh trn vi
N my tnh t cch u nhau. My th 1 c t gia my th N v my th 2, my th 2 c t gia
my th 1 v my th 3, c nh vy n my th N th c t gia my N 1 v my th 1. Phng thi c
kch thc rt ln nhng li ch c mt s th sinh tham gia cuc thi ny thm ch vn cn tr nn phc
tp hn khi c th c nhiu th sinh cng thi trn mt my (kiu nh thi ng i). Khong cch gia 2 my
tnh c nh ngha l khong cch i t my ny n my kia (tnh theo ng ngn hn). Ni cch
khc, khong cch gia hai my u v v l min(|u v|, N |u v|).
Gim th MSN ang cn tm mt v tr c th bao qut phng thi tt nht. V tr quan st tt nht l ti
my tnh m tng khong cch ca n n cc my ang thi l nh nht (nu c mt my tnh c nhiu th
sinh cng d thi th khong cch n my phi c tnh nhiu ln).
Input
92
Dng u tin l hai s nguyn dng N v K ln lt l tng s my tnh c trong phng thi v s
th sinh ang d thi.
Dng tip theo ghi K s nguyn trong khong [1, n]. S th u th hin s hiu my tnh ca th sinh
th u.
Output
Dng u tin gm mt s l khong cch nh nht tm c.
Dng th hai gm mt s l s lng cc my tnh c th chn
Dng th ba gm mt s s l danh sch s hiu cc my tnh c tng khong cch ti cc my ang

thi l nh nht
Gii hn
1 N 106
1 < K 105
V d
Input:
20 10
1 1 18 5 6 14 7 4 8 9
Output:
35
2
5 6
Yugi-Oh
Ngy:
14-09-2007
im:
0.9
M bi:
YUGI
S ngi gii c/
lm:
48 / 54
Loi bi:
acm
T l ng:
39.8%
Thi gian chy:
1s
Bi chy tt nht:
topwin (100 im - 0.09s)
Gii hn m ngun:
50000B
Ngi gi:
nghia
Ngn ng cho php:
Tt c
Ngun bi:
Khng r ngun gc
Cc bn c b truyn tranh Nht Bn Yugi-oh chc hn ai cng cc k yu thch tr chi bi Magic. B

bi v chin thut chi quyt nh n s thng thua ca i th(m s thng thua th cn lin quan n c
tnh mng >_
93

Tnh c Kaiba tm c 1 qun bi ma thut m chc nng ca n l chia b bi hin c ca i th ra
lm K phn, mi phn c t nht 1 qun bi (iu ny lm gim sc mnh ca i th). Kaiba quyt nh p
dng chin thut ny vi Yugi. Hin ti Yugi c trong tay N qun bi, 2 qun bi i, j c sc mnh tng tc
a(i,j) (a(i,j) = a(j,i)). Kaiba mun chia cc qun bi thnh K phn theo quy tc sau:
Gi s K phn l P1, P2, ..., Pk th gim sc mnh gia 2 phn u,v l b(u,v) = min(a(i,j) vi i
thuc Pu, j thuc Pv).
gim sc mnh ca b bi l S = min(b(u,v) vi 1 u, v K).
Kaiba mun chia K phn sao cho S ln nht
Input
Dng u l 2 s N,K(2 K N 200)
N dng tip theo mi dng l N s a(i,j) (a(i,j) 32767; nu i = j th a(i,j) = 0)
Output
Gm 1 dng duy nht l S ln nht
Example
Input:
4 3
0 1 2 3
1 0 2 3
2 2 0 3
3 3 3 0
Output:
2
A cng B
Ngy:
15-09-2007
im:
0.2
M bi:
POST
S ngi gii c/
lm:
452 / 480
Loi bi:
acm
T l ng:
52.3%
Thi gian chy:
1s
Bi chy tt nht:
tuyen_pro_vip (100 im
- 0s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Just to test
94

Cho 2 s nguyn A v B . Hy tnh A + B .
Input
Gm 1 dng cha 2 s nguyn A v B , cch bi 1 du cch.
Output
Ghi ra tng A+B .
V d
Input:
3 4
Output:
7
Gi :
S dng ton t "+" .
Phng trnh Pythagore nghim nguyn

Ngy:
15-09-2007
im:
0.9
M bi:
PYTHAEQ
S ngi gii c/
lm:
52 / 82
Loi bi:
acm
T l ng:
31.0%
Thi gian chy:
2s
Bi chy tt nht:
np_complete (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
duonghanguyen
Ngn ng cho php:
Tt c
Ngun bi:
Mt bi c in
Cho phng trnh c dng:
vi
Hy tm s lng nghim ca phng trnh
95
Input
Gm mt s r duy nht
Output
Gm mt s duy nht l p s ca bi ton.
Example
Input 1:
1
Output 1:
4
Input 2:
3
Output 2:
4
Input 3:
10
Output 3:
12
Dy con tng di nht ( bn d )

Ngy:
15-09-2007
im:
0.2
M bi:
LIQ
S ngi gii c/
lm:
324 / 359
Loi bi:
acm
T l ng:
46.9%
Thi gian chy:
5s
Bi chy tt nht:
dinhductho90 (100 im 0s)
Gii hn m ngun:
20000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
Dn gian
Cho mt dy s nguyn gm N phn t A[1], A[2], ... A[N].

Bit rng dy con tng n iu l 1 dy A[i1],... A[ik] tha mn
i1 < i2 < ... < ik v A[i1] < A[i2] < .. < A[ik]. Hy cho bit dy con tng n iu di nht ca dy ny c bao
96

nhiu phn t?
Download test v solution (C/C++, Pascal) ti y.
Input
Dng 1 gm 1 s nguyn l s N (1 N 1000).
Dng th 2 ghi N s nguyn A[1], A[2], .. A[N] (1 A[i] 10000).
Output
Ghi ra di ca dy con tng n iu di nht.
V d
Input:
6
1 2 5 4 6 2
Output:
4
Gii thch test v d: Dy con di nht l dy A[1] = 1 < A[2] = 2 < A[4] = 4 < A[5] = 6, di dy ny l
4.
Gi : S dng phng php Quy Hoch ng. F[i]: di dy con n iu tng di nht m phn t cui
cng l s A[i] ny.
Dy con tng di nht (bn kh)

Ngy:
16-09-2007
im:
0.3
M bi:
LIS
S ngi gii c/
lm:
202 / 257
Loi bi:
acm
T l ng:
30.5%
Thi gian chy:
1s
Bi chy tt nht:
raptor724 (100 im 0.08s)
Gii hn m ngun:
50000B
Ngi gi:
duonghanguyen
Ngn ng cho php:
Tt c
Ngun bi:
Bi c in
(Ging bi LIQ) Cho mt dy gm N s nguyn (1 N 30000). Hy tm dy con tng di nht trong dy

. In ra s lng phn t ca dy con. Cc s trong phm vi longint.
Input
97
Dng u tin gm s nguyn N.
Dng th hai gm N s m t dy.
Output
Gm mt s nguyn duy nht l p s ca bi ton
Example
Input:
5
2 1 4 3 5
Output:
3
Xy cu
Ngy:
17-09-2007
im:
0.7
M bi:
BRIDGES
S ngi gii c/
lm:
73 / 87
Loi bi:
acm
T l ng:
24.4%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
duonghanguyen
Ngun bi:
L n Khu - mt bi
vng 4 chn T
HKHTN - HQG H
Ni
Ngn ng cho php:
Tt c
t nc Delta l quc o ln trn th gii. t nc gm N o nh c nh s t 1 n N. Vic i li

gia cc o l rt kh khn. V kinh t cn rt km pht trin, nh nc phi kh khn lm mi m c N
1 tuyn ph bin ngi dn ngi dn c th i li c gia hai o bt k. Cch y khng lu, t
nc mi nhn c s u t ln ca cc nc t bn. Nh vua quyt nh xy mi K cy cu thay cho
K tuyn ph. Cc cy cu mi c xy dng s ni lin hai o m trc y c tuyn ph ni trc tip.
Nh vua mun tnh ton chn K tuyn ph no xy thnh cu sau cho tng thi gian i li gia mi
cp nh l nh nht. Tc l:
t gi tr nh nht. Trong o TA B l thi gian i t o A n o B. Bn
hy gip nh Vua tnh ton chn ra K trong s N - 1 tuyn ph thay th bng cu.
Input
98
Dng th nht ghi 4 s nguyn N, K, VP, VC trong VP l vn tc nu i bng ph v VC l vn tc

nu i bng cu. VP v VC c n v l m/s
N 1 dng tip theo, mi dng ghi 3 s U V L th hin gia o U v o V c mt tuyn ph, v

khong cch gia U v V l L mt.
Output
In ra K s l s hiu ca tuyn ph cn c thay th bng cu.
Gii hn
1 K < N 10 000
1 VP, VC 100 000
1 LU V 106
Thi gian: 1s/test
Example
Input:
6 2 1 2
1 2 5
3 2 6
1 4 4
4 6 4
4 5 5
Output:
1 3
Tm s nguyn t
Ngy:
17-09-2007
im:
0.2
M bi:
PNUMBER
S ngi gii c/
lm:
332 / 375
Loi bi:
acm
T l ng:
39.0%
Thi gian chy:
5s
Bi chy tt nht:
vdmedragon (100 im 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
99

Ngn ng cho php:
Tt c
Ngun bi:
Dn gian
Hy tm tt c cc s nguyn t trong on [A,B] .
Input
Gm 2 s nguyn A v B cch nhau bi 1 du cch ( 1 A B 200000 ) .
Output
Ghi ra tt c cc s nguyn t trong khong [A,B]. Mi s trn 1 dng .
V d
Input:
1 10
Output:
2
3
5
7

Ngy:
19-09-2007
im:
0.9
M bi:
DISNEY1
S ngi gii c/
lm:
49 / 57
Loi bi:
acm
T l ng:
35.0%
Thi gian chy:
0.029s-0.050s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
nghia
Ngun bi:
Thi vng 2 nm 2006 v

cm n Mr.Nguyn Trn
Nam Khnh
Ngn ng cho php:
Tt c
Cng vin Disneyland khai trng N im vui chi mi. Mt hm Bm v Cui n chi Cng vin. Qua
vic hi thm ngi hng dn Bm v Cui bit thi gian c th i t im vui chi i n a im
vui chi j. Bm v Cui mun i thm ht tt c cc a im theo nguyn tc sau:
-Mi ngi i t im s 1, qua 1 s im v quay tr v im s 1.
-Cc im n trn ng i ca Bm v Cui l 1 dy s tng dn( tr im s 1 khi quay v).
-Mi im vui chi phi thuc t nht 1 trong 2 ng i ca Bm v Cui.
-Thi gian i l nh nht (tnh c thi gian quay v 1).
100
Input
-Dng u l s N (N<201)
-Tip theo l ma trn N dng N ct: 1 s nguyn khng m(
(A[i][j] = A[j][i] , A[i][i] = 0 vi mi i, j).
Output
Gm 1 s duy nht l thi gian nh nht Bm v Cui thm quan Cng Vin theo nguyn tc trn.
Example
Input:
4
0 1 4 3
1 0 2 4
4 2 0 4
3 4 4 0
Output:
10
(Gii thch : cch i tt nht l Bm i 1->2->3->4->1 v Cui ng yn)

Ngy:
19-09-2007
im:
0.9
M bi:
DISNEY2
S ngi gii c/
lm:
47 / 49
Loi bi:
acm
T l ng:
30.0%
Thi gian chy:
0.029s-0.050s
Bi chy tt nht:
bkhnjkt (100 im 0.04s)
Gii hn m ngun:
50000B
Ngi gi:
nghia
Ngn ng cho php:
Tt c
Ngun bi:
T vic hiu nhm bi

DISNEY1
Ging nh bi DISNEY1, ch khc l mi im trong N im vui chi ch thuc 1 trong 2 ng i ca

Bm hoc Cui(tt nhin l tr im s 1).
Input
Ging nh bi DISNEY1
101
Output
Ging nh bi DISNEY1
Example
Input:
4
0 1 4 3
1 0 2 4
4 2 0 4
3 4 4 0
Output:
10
S khng (I)
Ngy:
20-09-2007
im:
1.1
M bi:
VN_ZR_I
S ngi gii c/
lm:
35 / 42
Loi bi:
acm
T l ng:
30.5%
Thi gian chy:
1s
Bi chy tt nht:
funny (100 im - 0.42s)
Gii hn m ngun:
50000B
Ngi gi:
duonghanguyen
Ngn ng cho php:
Tt c
Ngun bi:
Thy Nguyn Thanh Tng
Ln u tin c tip xc vi cc vn v c s tin hc, cc hc sinh u ng ngng v th v khi c

lm quan vi h m c s 2.
Bi tp v nh l mi ngi t chn cho mnh mt s nguyn N v vit cc s 1, 2, 3, , N di dng nh
phn. Qua bi tp ny, thy gio mun bit:
Hc sinh nm c cch biu din nh phn hay cha.
nh gi c mc ham m tin hc sinh trong lp qua s N c chn v cch trnh by bi lm.

1
1000
1111
10110
11101
100100
101011
110010
10
1001
10000
10111
11110
100101
101100
110011
11
1010
10001
11000
11111
100110
101101
110100
100
1011
10010
11001
100000
100111
101110
110101
101
1100
10011
11010
100001
101000
101111
110110
110
1101
10100
11011
100010
101001
110000
110111
102

111
1110
10101
11100
100011
101010
110001
111000
Mt bn rt c gng thc hin bi tp, chn s N kh ln, ghi cc s t 1 ti N di dng nh phn, mi

s trn mt dng. Sau cho bi lm c dng hp dn hn, bn hc sinh chn mt s nguyn K ln
hn 0 v mi dng t cc 0 th nht, th K + 1, 2K + 1, hnh trn, N = 56 v K = 2. Cc s 0
mu c gch di.
Cc bn trong lp rt thch th khi thy bi lm ny v nh in np. Nhng c mt bn lo lng: My in
mu ca mnh sp ht mc . Vi N v K chn, s c bao nhiu s 0 c vit bng mu ?. Hy gip
cc bn ang lm bi tp tr li cu hi trn.
Input
Gm nhiu dng, mi dng cha 2 s nguyn N v K cch nhau t nht mt du cch. (1 < N 2147483647;
K > 0)
Output
Gm nhiu dng, mi dng gm 1 s l kt qu tm c ca tng test.
Example
Input:
4 1
56 2
Output:
3
74
Li 1 bi phn vic
Ngy:
20-09-2007
im:
1.4
M bi:
COST
S ngi gii c/
lm:
16 / 21
Loi bi:
acm
T l ng:
29.8%
Thi gian chy:
1s
Bi chy tt nht:
jook (100 im - 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:
Tt c
Ngun bi:
C N chuyn vin lp trnh v M cng vic. Nu chuyn vin th i m lm j cng vic th s tn chi ph l
C[i] * j * j .
Ngi ta cho bn N xu k t , k t th j ca xu i l 'Y' tc l chuyn vin th i c th lm c cng vic
103

th j v 'N' trong trng hp ngc li. Bn hy lp trnh tnh xem tng chi ph phi tr nh nht l bao
nhiu ?
Input
Dng 1 : s nguyn dng N ( 0 < N < 51 ) .
Dng 2 : N s nguyn dng l C[1] , ... , C[N] ( 0 < C[i] < 50000 ) . N dng tip theo , mi dng gm 1
xu M k t m t nh trn. ( 0 < M < 41 ) .
Output
Gm 1 s nguyn duy nht l chi ph nh nht. Trong trng hp khng th hon thnh M cng vic ny
c th ghi ra -1 .
V d
Input:
3
2 3 4
YYN
YNY
NNN
Output:
11
Gii thch test v d : Ngi th 1 lm 2 cng vic l 1 v 2 mt chi ph l 2 * 2 * 2 = 8 , ngi th 2 lm

cng vic 3 mt chi ph l 3 . Tng chi ph s l 11 .
Truy vn trn cy
Ngy:
21-09-2007
im:
1.8
M bi:
QTREEX
S ngi gii c/
lm:
5 / 10
Loi bi:
acm
T l ng:
23.1%
Thi gian chy:
6s
Bi chy tt nht:
john_jones (100 im 1.77s)
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi Khc
Anh Tun
Cho mt cy gm N nt nh s t 1->N. Cc cnh ca cy nh s t 1->N-1, mi cnh c trng s l mt

s nguyn. Bn cn vit chng trnh thc hin dy cc lnh sau:
CHANGE i v => Thay i trng s ca cnh th i thnh v
104

NEGATE a b => o du trng s ca tt c cc cnh nm trn ng i t a n b
QUERY a b => Tm trng s ln nht ca cc cnh nm trn ng i t a n b
Input
Input l mt b gm nhiu test. Dng u ca input l s test t ( t<=20 ). Tip sau l cc test.
Mi test bt u bng mt dng trng. Dng tip theo ghi mt s N ( N<=10000 ). N-1 dng tip theo, mi
dng ghi 3 s a, b v c m t mt cnh ca cy ni a vi b v c trng s l c. Th t ca cc cnh chnh l
th t xut hin trong input. Tip theo l dy cc lnh nh m t trn(s lnh khng qu 50000). Cui mi
test ghi mt t "DONE".
D liu vo lun m bo trng s ca cc cnh mi thi im c gi tr tuyt i khng vt qu
10000000.
Output
Vi mi lnh "QUERY", in ra kt qu tm c. Nu a = b th ghi ra 0.
Example
Input:
1
3
1 2 1
2 3 2
QUERY 1 2
CHANGE 1 3
QUERY 1 2
DONE
Output:
1
3
Xu i xng
Ngy:
21-09-2007
im:
1.7
M bi:
PALINX
S ngi gii c/
lm:
8 / 30
Loi bi:
acm
T l ng:
6.6%
Thi gian chy:
5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
105

Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi Khc
Anh Tun
Mt xu c gi l i xng nu c t tri qua phi v c t phi qua tri u ging nhau.

V d xu "aba", "abba" l xu i xng; cn xu "abc", "abca" th khng.
Bn c cho N xu, nh vy s c NxN cp xu. Bn hy m xem trong NxN cp xu ny, c bao nhiu
cp m khi ni xu th hai vo sau xu th nht s cho ra mt xu i xng.
Input
Dng u ghi mt s N. N dng sau mi dng m t mt xu, bt u l di ca xu, sau l mt du
cch v tip theo l ni dung ca xu.(Xu ch gm cc ch ci latin thng v c di nguyn dng)
D liu vo lun m bo tng di cc xu khng qu 1000000.
Output
Ghi ra mt s duy nht l s cp xu tm c.
Example
Input:
3
1 a
2 ab
2 ba
Output:
5
Chnh ng h
Ngy:
21-09-2007
im:
0.5
M bi:
CLOCK
S ngi gii c/
lm:
115 / 119
Loi bi:
acm
T l ng:
43.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:

PAS fpc JAVA C# D
Ngun bi:
PERL PYTH LISP sbcl
LISP clisp HASK CAML
IOI 1994
106
9 ch s trong hnh 1 l v tr ca 9 ng h, trong mi ng h c 1 trong 4 v tr: Bc (12 gi) , ng (

3 gi ) , Nam ( 6 gi ) v Ty ( 9 gi) . ( Cc hng c nh s tng ng t 0 -> 3 ):
C 9 cch khc nhau quay cc ng h, mi cch c gi l mt dch chuyn (Move). Mi dch chuyn
c chn bng mt s t 1 n 9. S s quay cc ng h c nh s 1 mt gc 90 theo chiu kim
ng h. Cc ng h c nh s 0 s khng b tc ng g. 9 di chuyn c minh ha trong hnh 2.
Hy vit chng trnh tnh xem cn t nht bao nhiu ln di chuyn tt c cc ng h u ch 12h .
Input
Gm 3 dng , mi dng gm 3 ch s cho bit hng m ng h ang ch.
Output
S ln dch chuyn t nht.
V d
Input:
107

330
222
212
Output:
4
Gii thch test v d : Thc hin cc php bin i 5, 8, 4 v 9 .
S khng (II)
Ngy:
21-09-2007
im:
1.6
M bi:
VN_ZR_II
S ngi gii c/
lm:
9 / 12
Loi bi:
acm
T l ng:
16.5%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
duonghanguyen
Ngn ng cho php:
Tt c
Ngun bi:
T vic hiu nhm bi

S khng (I)
bi ging vi bi S khng (I) nhng c mt im hi khc:

Hc sinh nm c cch biu din nh phn hay cha.
nh gi c mc ham m tin hc sinh trong lp qua s N c chn v cch trnh by bi lm.

hn 0 v mi dng, xt tng nhm c to bi dy di nht cc ch s 0 lin tip mi nhm t
cc 0 th nht, th K + 1, 2K + 1,
Input
108

K > 0)
Output
Example
Input:
4 1
56 2
Output:
3
86
Vng s nguyn t
Ngy:
22-09-2007
im:
0.3
M bi:
PCIRCLE
S ngi gii c/
lm:
191 / 231
Loi bi:
acm
T l ng:
28.4%
Thi gian chy:
10s
Bi chy tt nht:
ldt (100 im - 0.19s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngn ng cho php:

PAS fpc JAVA C# PERL
Ngun bi:
PYTH RUBY HASK
CAML
Mr L Minh Hong
Mt vng trn cha 2*n vng trn nh (Xem hnh v). 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 2*n mi s vo mt vng trn nh sao cho tng ca
hai s trn hai vng trn nh lin tip l s nguyn t. S in vng trn nh 1 lun l s 1.
109
Input
S nguyn dng n ( 1 < n < 10 ) .
Output
Dng u tin ghi ra s k l s cch tm c.
K dng tip theo mi dng ghi ra 1 cch in cc s vo cc vng trn nh. Cch in no c th t t in
nh hn th xp trc. Nu K > 10000 th ch cn ghi ra 10000 cch u tin.
V d
Input:
4
Output:
4
1 2 3 8 5 6 7 4
1 2 5 8 3 4 7 6
1 4 7 6 5 8 3 2
1 6 7 4 3 8 5 2
Tr chi en trng
Ngy:
27-09-2007
im:
1.6
M bi:
BWGAME
S ngi gii c/
lm:
10 / 14
Loi bi:
acm
T l ng:
18.8%
Thi gian chy:
1s
Bi chy tt nht:
110

Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi Khc
Anh Tun
C N vung xp cnh nhau thnh mt dy di(N<=100000). Mt s vung c t mu trng, mt s

vung c t mu en, cn li l nhng cha c t mu. Khng c 2 k nhau no cng mu.
Hai ngi cng chi mt tr chi, lt chi ca 2 ngi xen k nhau. Mi ngi chi khi n lt mnh s
t mu vo cha c t vi iu kin 2 k nhau khng cng mu. Ai n lt mnh m khng chi
c na th thua. Bit c 2 ngi u chi ti u nht c th, hi ai l ngi thng cuc.
Input
Input gm khng qu 20 test, dng u l s test. Sau l m t ca cc test.
Mi test gm 2 dng, dng u l s nguyn N, dng sau ghi N k t vi ngha : 0 - cha c t; 1 -
t mu trng; 2 - t mu en.
Output
ng vi mi test ghi mt dng duy nht l 1 nu ngi chi u thng, 2 nu ngi chi sau thng.
Example
Input:
2
5
00100
4
1020
Output:
2
1
Tam gic en trng

Ngy:
27-09-2007
im:
1.8
M bi:
BWTRI
S ngi gii c/
lm:
4/7
Loi bi:
acm
T l ng:
33.3%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
8000B
Ngi gi:
beo_map
111

Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi Khc
Anh Tun
Mt tam gic u c cnh di N c th chia thnh N^2 tam gic u n v nh hnh (a).
Mi tam gic u n v c th c t mu en trng bng 1 trong 4 cch nh hnh (b).
Mt tam gic u c th c lt kn bng cc tam gic u n v. Mt cch lt c gi l p nu nh
phn k nhau ca 2 tam gic n v ging mu nhau(xem hnh (c)).
Bn c cho trc di N ca cnh tam gic, 4 s n1, n2, n3, n4 tng ng l s lng cc tam gic n
v loi 1, 2, 3, 4. Hy m s cch lt p.
Input
Input ghi ln lt 5 s l N, n1, n2, n3, n4(1<=N<=5). D liu vo lun m bo n1+n2+n3+n4 = N^2.
Output
Mt dng duy nht ghi s cch lt p tm c.
Example
Input:
2
0 1 0 3
Output:
3
Phn tch s
Ngy:
31-10-2007
im:
0.9
M bi:
KTUAN
S ngi gii c/
lm:
48 / 131
112

Loi bi:
acm
T l ng:
12.6%
Thi gian chy:
3s
Bi chy tt nht:
bt09 (100 im - 0.73s)
Gii hn m ngun:
10000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi Khc
Anh Tun
Hy m s cch phn tch s N ( N<=100000 ) thnh tng cc s nguyn dng.

Lu 2 cch ch khc nhau v th t cc s hng c coi l ging nhau. V d 4 c 5 cch phn tch sau:
4=1+1+1+1
4=1+1+2
4=1+3
4=2+2
4=4
Hai cch phn tch 4 = 1 + 3 = 3 + 1 ch c tnh mt ln.
V kt qu s rt ln nn cc bn ch cn a ra phn d ca php chia s cch tm c cho 1000000000 (
10^9 ).
Input
Mt s t nhin N duy nht.
Output
In ra phn d ca ca s cch tm c cho 10^9.
Example
Input:
4
Output:
5
Vng ua xe p
Ngy:
16-11-2007
im:
0.9
M bi:
BIC
S ngi gii c/
lm:
47 / 64
Loi bi:
acm
T l ng:
20.2%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
113

Ngn ng cho php:
Tt c
Ngun bi:
Croatian Open 2006
Mt vng ua xe p c t chc trn N thnh ph, nh s t 1 n N. C M ng ni (mt chiu) gia

cc thnh ph. Vng ua bt u t thnh ph 1 v kt thc ti thnh ph 2.
Yu cu
Hi c bao nhiu cch t chc cc vng ua? (Bit hai vng ua l khc nhau nu chng khng s dng cc
tuyn ng nh nhau)
D liu
Dng 1: N, M
M dng tip theo: mi dng cha hai s nguyn A, B, cho bit c mt ng ni gia thnh ph A v thnh
ph B
Cc thnh ph c th ni vi nhau bi nhiu hn mt con ng
Kt qa
Gm 1 dng duy nht: s cch t chc cc vng ua. Nu kt qa c nhiu hn 9 ch s, ch cn in ra 9 ch
s cui cng. Nu c v s cch t chc cc ng ua, in ra inf.
Gii hn
1 N 104
1 M 105
V d
D liu:
8 14
6 7
6 8
7 5
5 2
5 3
4 8
1 6
5 2
7 5
6 4
1 4
5 2
7 4
114

8 3
Kt qa
6
D liu:
2 2
1 2
2 1
Kt qa
inf
i ch
Ngy:
16-11-2007
im:
1.8
M bi:
NK05EOPR
S ngi gii c/
lm:
4 / 13
Loi bi:
acm
T l ng:
20.0%
Thi gian chy:
18s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
T acm.uva.es
Cho mt dy s l mt hon v ca 12 s t nhin u tin (t 0 n 11). Gi s s 0 v tr th i trong dy

s (v tr c nh s t 0 n 11, t tri sang phi) th bn c th i ch s 0 vi s v tr th j nu tha
mn c hai iu kin sau:
| i j | = dk , vi k=1..3 v (d1,d2,d3,d4)=(1;3;6;12)
[i/dk+1]=[j/dk+1], vi [] l hm phn nguyn
Bn hy tm s php i ch t nht c th sp xp dy s theo th t tng dn
D liu vo
Dng u tin l mt s nguyn t cho bit s lng test (t<=20)
Mi b test bao gm mt dng l dy bao gm cc s t 0 n 11, mi s ngn cch bi mt khong trng.
Bit rng mi dy s cho trc lun lun c th sp xp tng dn bng php i ch quy nh
Kt qa
115

Vi mi b test, in ra s php i ch t nht sp xp dy s cho theo th t tng dn
V d
D liu mu
2
1 10 2 3 0 5 7 4 8 6 9 11
6 4 1 0 3 5 9 7 2 10 11 8
Kt qa
8
9
Trt t
Ngy:
16-11-2007
im:
1.0
M bi:
NK05ORDR
S ngi gii c/
lm:
41 / 65
Loi bi:
acm
T l ng:
20.4%
Thi gian chy:
3s
Bi chy tt nht:
trangviet1304 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
NEERC 2002
Xt cc s nguyn t 1 N. Cc s ny c sp xp theo th t t in. V d vi N=11, ta c dy s sau

khi sp xp l 1, 10, 11, 2, 3, 4, 5, 6, 7, 8, 9.
K hiu QN,K l v tr ca s K trong dy c sp xp theo cch ni trn. V d Q11,2=4 Cho cc s nguyn
K v M. Hy tm s nguyn N nh nht tha mn QN,K=M
D liu vo
Dng u tin cha s nguyn t cho bit s b test.
Mi b test bao gm 1 dng duy nht cha 2 s nguyn K v M (1<=K,M<=109)
Kt qa
Vi mi b test xut ra s N, hoc 0 nu khng tn ti N
V d
D liu mu
116

1
2 4
Kt qa
11
Bc si
Ngy:
16-11-2007
im:
0.9
M bi:
NK05MNIM
S ngi gii c/
lm:
53 / 80
Loi bi:
acm
T l ng:
35.1%
Thi gian chy:
3s
Bi chy tt nht:
lyxuansang91 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Khng r
Hai bn Nam v Mai cng chi mt tr chi vi n ng si. Lut chi nh sau:
Hai bn s ln lt i. Bn Mai l ngi i trc
Trong mi lt i, bn i s c quyn bc mt s si bt k t mt ng nht nh v phi bc ti

thiu l 1 vin si.
Bn no bc phi vin si cui cng l ngi thua cuc
Bn hy gip Mai xc nh xem bn y c th thng c trong tr chi hay khng
D liu vo
Dng u tin cha mt nguyn t l s b test. Cc dng sau l t b test.
Mi b test bao gm:
Dng u tin cha mt s nguyn n (n<=100) l s ng si
Dng th hai gm n s nguyn a1, a2, a3,... , an, ngn cch nhau bi mt khong trng. S nguyn ai
cho bit s lng vin si c trong ng th i (1<=ai<=100)
Kt qa
Vi mi b test, in ra 1 nu bn Mai thng, -1 nu bn Mai thua
V d
D liu mu
117

2
4
30 4 19 75
3
1 4 5
Kt qa
1
-1
Sa mc
Ngy:
16-11-2007
im:
1.0
M bi:
NK05DSRT
S ngi gii c/
lm:
44 / 65
Loi bi:
acm
T l ng:
19.6%
Thi gian chy:
3s
Bi chy tt nht:
taek (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
L Thnh Trung - 3rd

VNOPSC
Bm v tnh b lc vo trong 1 c o c 1 b tc th dn sinh sng trong 1 ln i qua sa mc. Bm mun

thot khi sa mc v nh. Ngi th dn cho anh mt bn vng sa mc ny.
Sa mc gm N c o, M ng i an ton ni vi nhau v ti mi c o li c 1 h cha nc rt ln v
nc cha trong cc h ny khng bao gi cn. Tuy nhin hin ti, khng c nc trong cc h.
Gi s: Bm ang c o 1, v v n nh th Bm phi i n c o N. Ngi th dn cho bit rng
ti vng sa mc ny, nu Bm i on ng c di l L, th Bm phi mang ung lng nc l L,
bng khng Bm s cht. T , ngi th dn ch cho Bm cch c th v nh: Bm phi vn chuyn
nc t c o 1 n tch tr trong cc h ti nhng c o khc bng cc con ng an ton c, t
anh c th v nh. Tuy nhin, li c 1 kh khn khc l: trong bt c thi gian no, Bm khng th mang
lng nc qu C (do th lc c hn ^_^).
Yu cu: Hy tm cch gip Bm v nh nhng ng thi s dng t nc nht (do trong sa mc, nc rt
qu !!!!)
D liu vo
Dng u tin gm mt s nguyn t cho bit s lng test, mi test c dng nh sau:
Dng u tin l 3 s nguyn N M C ngn cch nhau bi khong trng
118
M dng tip theo mi dng gm 3 s nguyn I J L vi y ngha c ng i t c o I n c o J

v ngc li l an ton v c di L.
Kt qa
Vi mi b test xut ra ng 1 s nguyn ch lng nc t nht cn dng.
Gii hn
1 <= N, M, C <= 100
1 <= L <= 30,000
V d
D liu mu
1
9 10 25
1 2 3
2 3 12
3 4 4
3 5 9
4 9 13
5 9 5
2 6 10
6 7 10
7 8 10
8 9 10
Kt qa
65
Gii thch
Mang 25 nc t 1 n 2 sau li quay v 1. Do , ti 2 c 19 nc. (Bm ung ht (3 + 3) nc trong
ln i v v, (19 = 25 3 3)).
Lp li nh th 1 ln na, Bm mang n 2 thm 19 nc. Sau li t 1, Bm mang theo 15 nc n
2. Vy khi n 2, Bm c ti y (19+19+12 = 50) nc.
Tip theo, Bm li mang 25 nc i t 2 n 3, ri quay v 2, nh vy, ti 3 c (25 12 12 = 1) nc. T
2, Bm mang 25 nc cn li i n 3. Ti 3, Bm c c (1+(25-12) = 14) nc.
Cui cng, Bm mang 14 nc i n 5 ri n 9. Vy l Bm thot khi sa mc.
119
S khng (III)
Ngy:
17-11-2007
im:
2.0
M bi:
VNZR_III
S ngi gii c/
lm:
1/2
Loi bi:
acm
T l ng:
20.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
700B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
c gi ln bi Khc
Anh Tun
bi ging vi bi S khng (II) nhng c mt im hi khc:

*** Hc sinh nm c cch biu din nh phn hay cha.
*** nh gi c mc ham m tin hc sinh trong lp qua s N c chn v cch trnh by bi lm.
hn 0 v mi dng, xt cc nhm c to bi dy di nht cc ch s 0 lin tip t tt c cc s
0 ca nhm th nht, th K + 1, 2K + 1,
Tuy nhin v y l mt bi khng kh, nn thm phn th thch, m ngun chng trnh ca bn
khng c qu 700 Byte
Input
K > 0)
Output
Example
120

Input:
4 1
56 2
Output:
3
92
Tr chi vng s
Ngy:
21-11-2007
im:
1.2
M bi:
IVANA
S ngi gii c/
lm:
28 / 29
Loi bi:
acm
T l ng:
66.7%
Thi gian chy:
1s
Bi chy tt nht:
pink_rose9005 (100 im
- 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Croatian Open 2006
Zvonko v Ivana cng chi tr chi sau:
Ban u, Zvonko t N s nguyn dng ln mt vng trn.
Mi ngi chi chn mt s bn cnh mt s c chn trc .
Ivana i trc, trong lt u ny Ivana c quyn chn bt k s no.
Tr chi kt thc khi tt c cc s c chn. Ai chn c nhiu s l hn s thng!
Bn hy gip Ivana tm nhng nc i u tin sau c c c hi thng (bit rng Zvonko lun s dng
chin thut ti u).
Input
Dng 1: n, s s trn vng trn. (1<=n<=100)
Dng 2: n s nguyn dng cch nhau bi khong trng. Cc s trong phm vi t 1 n 1000 v
khng c hai s no bng nhau.
Output
Gm mt s nguyn duy nht, l s nc i u tin Ivana c c hi thng
Example
121

Input:
3
3 1 5
Output:
3
Input:
4
1 2 3 4
Output:
2
Input:
8
4 10 5 2 9 8 1 7
Output:
5
Tam gic vung

Ngy:
26-11-2007
im:
1.1
M bi:
PRAVO
S ngi gii c/
lm:
31 / 60
Loi bi:
acm
T l ng:
12.1%
Thi gian chy:
4s
Bi chy tt nht:
- 5.7s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Croatian Open 2007
Cho n im trn mt phng. Hi c bao nhiu tam gic vung c to thnh.
Input
Dng u tin cha s nguyn dng n (3<=n<=1500), s im trn mt phng
Dng th i trong n dng tip theo, mi dng cha 2 s nguyn xi, yi, ta ca mt im (-109<=xi,
yi <= 109). Khng c hai im no c cng ta .
Output
122

Gm mt dng duy nht l s lng tam gic vung tm c.
Example
Input:
3
4 2
2 1
1 3
Output:
1
Input:
4
5 0
2 6
8 6
5 7
Output:
0
Input:
5
-1 1
-1 0
0 0
1 0
1 1
Output:
7
Lt gch
Ngy:
17-01-2008
im:
0.4
M bi:
LATGACH
S ngi gii c/
lm:
183 / 210
Loi bi:
acm
T l ng:
38.8%
Thi gian chy:
3s
Bi chy tt nht:
second_half (100 im -
123

0s)
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
Basic problem
Cho mt hnh ch nht kch thc 2xN (1<=N<=100). Hy m s cch lt cc vin gch nh kch thc
1x2 v 2x1 vo hnh trn sao cho khng c phn no ca cc vin gch nh tha ra ngoi, cng khng c
vng din tch no ca hnh ch nht khng c lt.
Input
Gm nhiu test, dng u ghi s lng test T ( T<=100 ).
T dng sau mi dng ghi mt s N.
Output
Ghi ra T dng l s cch lt tng ng.
Example
Input:
3
1
2
3
Output:
1
2
3
Lt gch 2
Ngy:
17-01-2008
im:
1.2
M bi:
LATGACH2
S ngi gii c/
lm:
27 / 28
Loi bi:
acm
T l ng:
45.7%
Thi gian chy:
5s
Bi chy tt nht:
Gii hn m ngun:
7000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
M rng ca bi lt gch
124

Trc tin cc bn cn xem bi LATGACH ( level 1 ).
Xt mt hnh vung kch thc (n+2)x(n+2) (3<=n<=1000). Hnh vung ny b khuyt mt mt din tch l
hnh vung kch thc (n-2)x(n-2) trung tm ( Nh vy ch cn 4 ng bin vi rng l 2 ). Bn vn
c quyn s dng cc vin gch kch thc 1x2 v 2x1 lt va kn hnh trn. Hy m s cch lt.
Input
Gm nhiu dng, mi dng ghi 1 s n ca test tng ng.
Output
Vi mi s n trong input, bn cn a ra mt s tng ng output th hin s cch lt.
Example
Input:
3
50
Output:
196
401520777816387690468975409805843797460004
C vua
Ngy:
17-01-2008
im:
1.6
M bi:
CHESS_
S ngi gii c/
lm:
11 / 33
Loi bi:
acm
T l ng:
14.5%
Thi gian chy:
5s
Bi chy tt nht:
Gii hn m ngun:
7000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
Mt bi c bn v l
thuyt tr chi
Cho 1 bn c kch thc 3 dng, N ct (N<=10^9). Cc thuc dng trn cng c mt qun tt en mi ,
cc dng di cng c mt qun tt trng mi .
Hai ngi chi 1 tr chi, qun trng i trc. Hai ngi thc hin nc i ca mnh lun phin, ai n lt
mnh m khng th i c na ( do khng cn nc i hp l ) s thua. Ti mi nc i, mt ngi s i
cc qun tt theo lut c vua, 2 lut quan trng nht l :
** Qun tt ch c th i 1 dc mi nc, v khng c li.
** Qun tt c th n qun tt khc mu theo 1 cho.
Tuy nhin c 2 lut sau khc vi lut c vua :
** Qun tt khng th phong cp ( thnh hu, m, ...).
125

** Ti mt nc i, vic n tt khc l bt buc ( nu tn ti nc n th ngi chi bt buc phi n tt i
phng, nu c nhiu la chn n th s la chn thuc v ngi chi).
Bit c 2 ngi chi u c gng chi tt nht c th. Hy xc nh ai l ngi chin thng.
Input
Gm nhiu dng, mi dng ghi mt s N.
Output
Vi mi s N tng ng input, in ra "White" nu ngi chi qun trng thng, in ra "Black" nu ngi
chi qun en thng. ( Khng in ra du nhy kp " )
Example
Input:
3
4
5
Output:
White
Black
White
Rt gn on
Ngy:
17-01-2008
im:
1.6
M bi:
CUTSEG
S ngi gii c/
lm:
11 / 21
Loi bi:
acm
T l ng:
14.2%
Thi gian chy:
5s
Bi chy tt nht:
whiterose (100 im 0.18s)
Gii hn m ngun:
7000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
Mt bi ca i tuyn
Nng
Cho mt dy gm N ch s thuc on 0..9 (N<=200). mi bc, ta c th ly ra t dy ny mt on lin

tip cc ch s ging nhau v nhn c mt s tin bng bnh phng di ca on c ly ra. Nu
sau khi ly, dy cho b tch lm 2 dy con, 2 dy con ny lp tc c st nhp li thnh 1 ( gi nguyn
th t ).
Hy tnh s lng tin ln nht c th thu c.
126
Input
Dng u ghi s N. Dng th hai ghi N ch s th hin dy.
Output
Ghi ra s lng tin ln nht c th thu c.
Example
Input:
6
100011
Output:
18
Hi trng
Ngy:
18-01-2008
im:
0.5
M bi:
NKREZ
S ngi gii c/
lm:
127 / 179
Loi bi:
oi
T l ng:
23.6%
Thi gian chy:
1s
Bi chy tt nht:
mrbomb (100 im 0.13s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Nh trng c mt phng hi trng. C nhng yu cu mun s dng phng hi trng ny, mi yu cu

cho bit thi im bt u v thi im kt thc. Nh trng c th chp nhn hoc t chi i vi mt yu
cu.
Yu cu: hy gip nh trng chn cc yu cu s dng hi trng sao cho tng thi gian hi trng c
s dng l ln nht.
D liu
Dng u tin cha mt s nguyn dng n (n 10000), s yu cu.
Mi dng trong s n dng tip theo cha 2 s nguyn dng p v k (0 p < k 30000), m t mt yu cu
bt u ti thi im p v kt thc ti thi im k.
Kt qa
127

Gm mt dng duy nht l tng thi gian ln nht m hi trng c s dng
V d
D liu:
12
1 2
3 5
0 4
6 8
7 13
4 6
9 10
9 12
11 14
15 19
14 16
18 20
Kt qa
16

Ngy:
18-01-2008
im:
0.5
M bi:
NKTHEME
S ngi gii c/
lm:
113 / 154
Loi bi:
oi
T l ng:
16.7%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
SPOJVN
Trong mt bn nhc thng c nhng on nhc c s dng nhiu ln (t nht 2 ln). Nhng on gi
l "on cao tro". Do c th s dng nhiu ging khc nhau (son, la, si...) nn nt u tin ca cc ln xut
hin c th khc nhau, nhng chnh lch cao gia hai nt lin tip th nh nhau.
Chng hn 1 2 5 4 10 v 4 5 8 7 13 c coi l th hin mt on cao tro, v chng cng chnh lch cao
: +1,+3,-1,+6.
Trong mt bn nhc, on cao tro cn phi tha mn nhng iu kin:
128
on cao tro phi c t 5 nt nhc tr ln.
Nhng ln xut hin ca on khng c chng ln nhau (khng c nt nhc chung).
Yu cu: Cho mt bn nhc, tm on cao tro di nht.
D liu vo
Dng 1: cha s nguyn n, s nt nhc (n 5000).
Mt s dng sau cha n s nguyn trong phm vi 1..88, th hin n nt nhc.
Kt qa
In ra 1 dng duy nht cha 1 s nguyn l di on cao tro di nht. Nu khng tm c on cao tro,
in ra 0.
V d
D liu mu
30
25 27 30 34 39 45 52 60 69 79 69 60 52 45 39 34 30 26 22 18
82 78 74 70 66 67 64 60 65 80
Kt qa
5
5 nt cui dng 1 v 5 nt u dng 2 th hin on cao tro di nht.
Leaves
Ngy:
18-01-2008
im:
1.6
M bi:
NKLEAVES
S ngi gii c/
lm:
9 / 22
Loi bi:
oi
T l ng:
10.4%
Thi gian chy:
1s
Bi chy tt nht:
ardiankp (100 im 2.27s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Campion 2005
Mt ngy thu p tri, Radu v Mars nhn ra rng khu vn ca h cha y l rng. H quyt nh gom l
thnh ng K ng l.
129

Bit rng khu vn c dng mt ng thng. 2 ngi thit lp mt h ta vi gc im u ca
khu vn.
C N chic l nm thng hng vi trng lng khc nhau, khong cch gia 2 chic l lin tip l 1. Ngha
l, chic l u tin c ta 1, chic l th 2 c ta 2,..., chic l th N c ta N. Ban u, 2 ngi
ang ng ta N.
Radu v Mars thc hin vic gom l trong khi ri khi khu vn, do nhng chic l ch c th di chuyn
v bn tri. Chi ph di chuyn mt chic l bng tch ca trng lng chc l v khong cch di chuyn.
Hin nhin, mt trong K ng l s nm ta 1, tuy nhin nhng ng cn li c th nm bt k v tr
no.
Yu cu: tm chi ph nh nht gom N chic l thnh ng K ng l.
D liu
Dng u tin cha 2 s nguyn dng N v K, cch nhau bi 1 khong trng.
Dng th i trong s N dng tip theo cha 1 s nguyn dng cho bit trng lng ca chic l th i.
Kt qa
In ra 1 s nguyn l chi ph nh nht gom N chic l li thnh ng K ng l.
Gii hn
0 < N 100000
0 < K 10, K < N
Trng lng ca mi chic l khng vt qu 1000.
V d
D liu:
5 2
1
2
3
4
5
Kt qa
13
Gii thch: Cch tt nht l t 2 ng l v tr 1 v 4.
Mars Map
130

Ngy:
18-01-2008
im:
0.7
M bi:
NKMARS
S ngi gii c/
lm:
75 / 94
Loi bi:
oi
T l ng:
39.2%
Thi gian chy:
1s
Bi chy tt nht:
daohenry (100 im 0.22s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Baltic OI 2001
Nm 2051, nhiu chuyn thm him khm ph v v c bn nhng vng t trn sao Ha. C quan
khng gian Baltic (BaSA) mun v bn ca c hnh tinh. tnh ton n lc cn b ra, cn phi bit
tng din tch c v bn .
Bn hy vit chng trnh tnh tng din tch ny.
D liu
Dng u tin cha 1 s nguyn duy nht N (1 N 10000) l s bn c v.
Mi dng trong N dng tip theo m t mt bn , bao gm 4 s nguyn x1, y1, x2, y2 (0 x1< x2
30000, 0 y1< y2 30000), tng ng l ta ca nh di tri v nh trn phi ca bn . Mi
bn c dng hnh ch nht cnh song song vi trc ta .
Kt qa
Gm 1 s nguyn duy nht cho bit tng din tch c v bn .
V d
D liu:
2
10 10 20 20
15 15 25 30
Kt qa
225
IOI01 Mobiles
Ngy:
18-01-2008
im:
0.7
M bi:
NKMOBILE
S ngi gii c/
lm:
70 / 89
131

Loi bi:
oi
T l ng:
29.2%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOI 2001 - Finland
Cc trm di ng th h 4 Tampere hot ng nh sau. C khu vc c chia thnh cc vung. Cc

vung to thnh mt bng SxS vi cc dng v ct nh s t 0 n S-1. Mi vung cha mt trm di
ng. S in thoi di ng hot ng trong mt vung c th thay i v in thoi c th chuyn sang
vung khc hoc thay i trng thi bt/tt. Khi c thay i, mi trm di ng s thng bo cho trung tm.
Ti mt s thi im, trung tm cn truy vn tng s in thoi ang hot ng trong mt vng din tch
hnh ch nht no .
Hy gip trung tm nhn cc thng bo t trm v tr li cc truy vn.
D liu
Gm nhiu dng, mi dng cha cc ch th cho chng trnh. C 3 loi ch th 0, 1, 2, 3 nhn cc tham s
v thc hin cc nhim v tng ng nh sau:
Ch
th
Tham
s
ngha
Khi to bng SxS cha ton b s 0. Ch th ny ch c cho mt ln duy nht u

chng trnh.
XYA
Cng A v s in thoi hot ng vung (X, Y). A c th m hoc dng.
L B R T Truy vn tng s in thoi hot ng cc vung (X, Y) vi L X R, B Y T
Kt thc chng trnh. Ch th ny ch c cho mt ln duy nht cui chng trnh.
Gi tr ca mt lun khng m ti mi thi im. Cc ch s bt u t 0, ngha l vi mt bng 4x4, ta c

0 X 3, 0 Y 3.
Kt qa
Vi mi ch th loi 2, in ra mt dng gm mt s nguyn dng tr li cho truy vn tng ng.
Gii hn
1 S 1024
Gi tr ca mt ti mi thi im lun thuc phm vi [0, 32767].
-32768 A 32767
S ch th thuc phm vi [3, 60002].
Tng s in thoi trn ton b bng khng vt qu 230.
132
V d
D liu
0 4
1 1 2 3
2 0 0 2 2
1 1 1 2
1 1 2 -1
2 1 1 2 3
3
Kt qa
3
4
IOI05 Mountains
Ngy:
18-01-2008
im:
1.5
M bi:
NKMOU
S ngi gii c/
lm:
12 / 17
Loi bi:
oi
T l ng:
41.4%
Thi gian chy:
3s
Bi chy tt nht:
khanhptnk (100 im 7.11s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOI 2005 - Poland
Mt cng vin gii tr va m tr chi tu ln siu tc th h mi. ng ray tu ln bao gm n thanh

ray gn vi nhau. on u ca thanh ray th nht c c nh ti cao 0. Byteman, ngi iu hnh, c
th iu chnh li ng ray tu ln theo mun bng cch iu chnh thay i cao ca mt dy cc
thanh ray lin tip. thay i cao ca cc thanh ray khc khng b thay i. Mi khi cc thanh ray c
iu chnh, ng ray c nng ln hoc h xung ni cc thanh ray trong khi vn gi im u cao
0. Hnh v di y minh ha 2 v d v iu chnh ng ray.
Mi chuyn tu c thc hin bng cch khi ng xe vi nng lng t n cao h. Ngha l xe
s tip tc di chuyn n khi no cao ca ng ray khng vt qu h v cha i ht ng ray.
Cho bit thng tin v cc chuyn tu v cc iu chnh ng ray trong ngy, vi mi chuyn tu hy tnh
s thanh ray xe di chuyn trc khi dng li.
ng ray c m t di dng mt dy gm n thay i cao , mi gi tr tng ng vi mt thanh
ray. S th i di m t thay i cao (tnh theo cm) ca thanh ray th i. Gi s sau khi di chuyn trn i-1
thanh ray xe t n cao h th sau khi di chuyn trn i thanh ray, xe s t n cao h+di cm.
133

Ban u tt c cc thanh ray u nm ngang, ngha l di =0 vi mi i. Cc chuyn tu v iu chnh ng
ray din ra xen k nhau trong ngy. Mi iu chnh c c trng bi 3 s: a, b v D. on ray c iu
chnh bao gm cc thanh ray t a n b. thay i cao ca mi thanh ray trong on c t bng D.
Ngha l di=D vi mi a i b. Mi chuyn tu c c trng bi 1 s nguyn h cho bit cao ln nht
m xe t c.
D liu
Dng u tin cha s nguyn n - s thanh ray (1 n 1000000000). Cc dng tip theo cha thng tin v
cc iu chnh ng ray xen k vi cc chuyn tu. Mi dng c 1 trong cc dng:
iu chnh - mt ch ci 'I' v 3 s nguyn a, b, D, cch nhau bi khong trng (1 a b n, 1000000000 D 1000000000).
Chuyn tu - mt ch ci 'Q' v s nguyn h (0 h 1000000000) cch nhau bi khong trng.
Mt ch ci 'E' - nh du kt thc chng trnh.
Ti mi thi im, cao ca bt k im no trn ng ray c m bo thuc on [0, 1000000000].

D liu vo cha khng qu 100000 dng.
50% s test c n tha mn 1 n 20000 v d liu vo c khng qu 1000 dng.
Kt qa
Dng th i cha 1 s nguyn - l s thanh ray xe di chuyn trong chuyn tu th i.
V d
D liu:
4
Q 1
I 1 4 2
Q 3
Q 1
I 2 2 -1
Q 3
E
Kt qa
4
1
0
3
134
ng ray trc v sau mi iu chnh. Trc x biu din cc thanh ray. Trc y v s trn cc im biu din
cao . S trn cc on biu din thay i cao .
IOI07 Pairs
Ngy:
18-01-2008
im:
1.6
M bi:
NKPAIRS
S ngi gii c/
lm:
10 / 17
Loi bi:
oi
T l ng:
17.6%
Thi gian chy:
4s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOI 2007 - Croatia
135

Mirko v Slavko chi tr cc con th chi. u tin, Mirko v Slavko chn mt trong 3 bn c nh hnh
di y. Mi bn c bao gm cc (di dng hnh trn trong hnh v) sp xp trn mt li 1, 2 hoc 3
chiu.
Sau Mirko s t N con th chi ln cc .

Khong cch gia 2 l s bc i nh nht mt con th i t ny n kia. Trong mi bc i. con
th c th bc n 1 trong 4 k vi n (ni vi nhau bng on thng trong hnh v).
Hai con th c th nghe thy nhau nu khong cch gia 2 chng ng khng vt qu D. Nhim v ca
Slavko l tnh s cp con th c th nghe thy nhau.
D liu
Dng u tin cha 4 s nguyn dng theo th t:
Loi bn c B (1 B 3).
S con th N (1 N 100000).
Khong cch ln nht D m hai con th c th nghe thy nhau (1 D 100000000).
Kch thc bn c M (ta ln nht xut hin trong d liu).

o
Khi B=1, M khng vt qu 75000000.
Mi dng trong s N dng sau cha B s nguyn cch nhau bi khong trng, cho bit cc ta ca mt
con th chi. Mi ta s thuc phm vi [1, M]. C th c nhiu con th nm trn cng 1 .
Kt qa
Gm 1 s nguyn duy nht l s lng con th c th nghe thy nhau.
Lu : s dng s nguyn 64-bit tnh kt qu (long long trong C/C++, int64 trong Pascal).
Hn ch
136
V d
D liu:
1 6 5 100
25
50
50
10
20
23
Kt qa
4
D liu:
2 5 4 10
5 2
7 2
8 4
6 5
4 4
Kt qa
8
D liu:
3 8 10 20
10 10 10
10 10 20
10 20 10
10 20 20
20 10 10
20 10 20
20 20 10
20 20 20
Kt qa
12
Truyn tin
Ngy:
18-01-2008
im:
0.6
137

M bi:
NKMSG
S ngi gii c/
lm:
105 / 155
Loi bi:
oi
T l ng:
18.6%
Thi gian chy:
1s
Bi chy tt nht:
vhhvvh (100 im - 0.22s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
SPOJVN
Mt lp gm n hc sinh, mi hc sinh c th lin lc vi mt s hc sinh khc. Mt hc sinh a c th lin

lc vi hc sinh b, nhng hc sinh b c th khng lin lc c vi hc sinh a.
Thy ch nhim cn thng bo mt thng tin quan trng cho lp. Thy ch nhn tin cho mt s hc sinh, sau
mi bn s nhn cho nhng bn mnh c th lin lc c.
Hy gip thy gio xc nh s hc sinh t nht cn nhn sao cho c lp u nhn c tin.
D liu
Dng u tin ghi 2 s nguyn n, s hc sinh trong lp. Cc hc sinh c nh s t 1 n n.
Dng th i trong n dng tip theo ghi 1 dy gm n k t 0 hoc 1. K t th j bng 1 nu v ch nu

hc sinh i lin lc c vi hc sinh j.
Kt qa
In ra mt s nguyn duy nht l s hc sinh t nht thy gio cn nhn tin.
Gii hn
1 N 1500.
C 50% s test c 1 N 500.
V d
D liu:
4
0100
1000
0001
0000
Kt qa
2
138
Police
Ngy:
18-01-2008
im:
1.3
M bi:
NKPOLICE
S ngi gii c/
lm:
20 / 29
Loi bi:
oi
T l ng:
23.5%
Thi gian chy:
1s-3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Croatian Open 2006
truy bt ti phm, cnh st xy dng mt h thng my tnh mi. Bn khu vc bao gm N thnh ph
v E ng ni 2 chiu. Cc thnh ph c nh s t 1 n N.
Cnh st mun bt cc ti phm di chuyn t thnh ph ny n thnh ph khc. Cc iu tra vin, theo di
bn , phi xc nh v tr thit lp trm gc. H thng my tnh mi phi tr li c 2 loi truy vn sau:
1. i vi hai thnh ph A, B v mt ng ni gia hai thnh ph G1, G2, hi ti phm c th di

chuyn t A n B nu ng ni ny b chn (ngha l tn ti phm khng th s dng con ng
ny) khng?
2. i vi 3 thnh ph A, B, C, hi ti phm c th di chuyn t A n B nu nh ton b thnh ph

C b kim sot (ngha l tn ti phm khng th i vo thnh ph ny) khng?
D liu vo
Dng u tin cha 2 s nguyn N v E ( 2 N 100 000, 1 E 500 000), s thnh ph v s

ng ni.
Mi dng trong s E dng tip theo cha 2 s nguyn phn bit thuc phm vi [1, N] - cho bit nhn
ca hai thnh ph ni vi nhau bi mt con ng. Gia hai thnh ph c nhiu nht mt ng ni.
Dng tip theo cha s nguyn Q (1 Q 300 000), s truy vn c th nghim trn h thng.
Mi dng trong Q dng tip theo cha 4 hoc 5 s nguyn. S u tin cho bit loi truy vn - 1 hoc
2.
o
Nu loi truy vn l 1, tip theo trn cng dng l 4 s nguyn A, B, G1, G2 vi ngha nh
m t. A khc B; G1, G2 m t mt con ng c sn.
Nu loi truy vn l 2, tip theo trn cng dng l 3 s nguyn A, B, C vi ngha nh m

t. A, B, C i mt khc nhau.
D liu c cho sao cho ban u lun c cch di chuyn gia hai thnh ph bt k.
Kt qa
139

Gm Q dng, mi dng cha cu tr li cho mt truy vn. Nu cu tr li l khng nh, in ra "yes". Nu
cu tr li l ph nh, in ra "no".
V d
D liu mu
13 15
1 2
2 3
3 5
2 4
4 6
2 6
1 4
1 7
7 8
7 9
7 10
8 11
8 12
9 12
12 13
5
1 5 13 1 2
1 6 2 1 4
1 13 6 7 8
2 13 6 7
2 13 6 8
Kt qa
yes
yes
yes
no
yes
IOI07 Miners
Ngy:
18-01-2008
im:
1.1
M bi:
NKMINERS
S ngi gii c/
lm:
35 / 46
Loi bi:
oi
T l ng:
41.3%
140

Thi gian chy:
2s
Bi chy tt nht:
vhhvvh (100 im - 0.65s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOI 2007 - Croatia
C hai m than, mi m c mt nhm th m lm vic. Khai thc than l cng vic vt v, do cc th m

cn thc phm hot ng. Mi khi mt t vn chuyn thc phm n m, cc th m s khai thc c
mt lng than no . C 3 loi thc phm c vn chuyn: tht, c v bnh m.
Cc th m mun thc n a dng. H s lm vic vi nng sut cao hn nu c cung cp ngun thc
phm a dng. Chnh xc hn, mi khi mt t vn chuyn n m, h s so snh t vn chuyn ny vi
hai t vn chuyn lin trc (hoc t hn nu cha ):
Nu cc t vn chuyn cng mt loi thc phm, h s sn xut c 1 n v than.
Nu c 2 loi thc phm khc nhau trong cc t vn chuyn, h s sn xut c 2 n v than.
Nu c 3 loi thc phm khc nhau trong cc t vn chuyn, h s sn xut c 3 n v than.
Bit trc cc loi thc phm v th t chng c vn chuyn, ta c th tc ng ln lng than sn xut
c bng cch ch nh t vn chuyn no s n m than no.
Cc t vn chuyn khng th c chia nh, lng thc phm ca mi t phi c gi ton b n mt
trong hai m.
Hai m than khng nht thit phi nhn s t vn chuyn nh nhau (thm ch c th gi tt c cc t vn
chuyn n mt m).
Bit cc loi thc phm theo th t chng c vn chuyn, hy tm tng lng than ln nht c th sn
xut (trong c hai m) bng cch quyt nh t vn chuyn no s c gi n m 1, t vn chuyn no
s c gi n m 2.
D liu
Dng u tin cha 1 s nguyn dng N (1 N 100000), s t vn chuyn thc phm.
Dng th hai cha mt chui gm N k t, cho bit cc loi thc phm theo th t chng c phn
phi. Mi k t s c dng mt trong 3 ch ci in hoa: 'M' (tht), 'F' (c) hoc 'B' (bnh m).
Kt qa
In ra mt s nguyn duy nht, l tng lng than ln nht c th sn xut c.
V d
D liu:
6
MBMFFB
Kt qa
141

12
D liu:
16
MMBMBBBBMMMMMBMB
Kt qa
29
Trong v d u tin, bng cch phn phi cc chuyn hng theo th t: m 1, m 1, m 2, m 2, m 1, m

2, lng than sn xut c s ln lt l 1, 2, 1, 2, 3, 3. Tng lng than l 12 n v. C th phn phi
theo cch khc t c tng lng than ny.
Hon v di nht
Ngy:
18-01-2008
im:
1.2
M bi:
NKLP
S ngi gii c/
lm:
29 / 115
Loi bi:
oi
T l ng:
7.5%
Thi gian chy:
1s
Bi chy tt nht:
raptor724 (100 im 0.26s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOIcamp Marathon 20052006
Cho dy A gm N phn t A1, A2, ..., AN l cc s nguyn. Mt dy con ca dy A l dy gm cc phn t

lin tip AU, AU+1, ..., AV trong 1 U V N. Mt dy con B c di K ca A c coi l ng quan
tm nu dy B l mt hon v ca K s 1, 2, ..., K.
Nhim v ca bn l tm mt dy con ng quan tm di nht ca A.
D liu
Dng th nht ghi s N l s phn t ca dy A.
Dng th hai ghi N s A1, A2, ..., AN.
Kt qa
Mt s duy nht l di ln nht tm c.
Gii hn
1 N 100 000.
142
1 AU N.
V d
D liu:
5
4 1 2 1 3
Kt qa
3
Monkey island
Ngy:
18-01-2008
im:
1.7
M bi:
NKTRAFIC
S ngi gii c/
lm:
7 / 14
Loi bi:
oi
T l ng:
19.6%
Thi gian chy:
1s
Bi chy tt nht:
nghia (100 im - 0.75s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Campion 2005
Sau khi phn chia t nc thnh cc thnh ph, o kh li ny sinh vn mi: phi ngn chn vic vn
chuyn chui! o kh c N thnh ph nh s t 1 n N ni vi nhau bi M ng ni hai chiu. Gia hai
thnh ph c nhiu nht mt con ng. Gia hai thnh ph bt k c t nht mt ng i (to bi mt
hoc nhiu con ng). o kh c hai th l thnh ph 1 v thnh ph N.
Gn y, vic vn chuyn chui gia hai th tng vt. tn cng vic vn chuyn, tng thng huy ng
G binh lnh, mi binh lnh c th t ti v tr bt k trn mt con ng, c th gn thnh ph ty , nhng
khng c nm trong thnh ph. Trong trng hp c lnh tn cng vo mt trong hai th , tt c binh
lnh phi di chuyn n th . Cc binh lnh di chuyn vi vn tc khng i. Thi gian cn thit huy
ng mt cuc tn cng nh vy bng khong cch ln nht t cc binh lnh n mt trong hai th .
Yu cu: xc nh mt cch b tr cc binh lnh sao cho mi ng i t th ny n th kia u i
qua t nht mt con ng c binh lnh gc v thi gian huy ng tn cng trong trng hp xu nht l nh
nht.
D liu
Dng u tin cha 3 s nguyn N, M, G cch nhau bi khong trng.
Mi dng trong s M dng sau cha 3 s nguyn a, b, c cch nhau bi khong trng, cho bit c mt
ng ni hai chiu gia thnh ph a v b vi di c.
Kt qa
143

In ra mt s nguyn duy nht l thi gian nh nht tt c cc binh lnh c th di chuyn n mt th ,
vi ng mt ch s thp phn. Nu khng c li gii, in ra -1.
Gii hn
2 < N < 155
2 < M < 5055
0 < di ca mt con ng < 1024
2 < G < 4096
V d
D liu:
6 6 2
1 2 1
2 3 2
3 6 1
1 4 1
4 5 3
5 6 1
Kt qa
2.5
H thng n
Ngy:
18-01-2008
im:
0.9
M bi:
NKLIGHT
S ngi gii c/
lm:
53 / 68
Loi bi:
oi
T l ng:
25.8%
Thi gian chy:
1s
Bi chy tt nht:
it_knight (100 im 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Khu vc t cc b xng c dng mt hnh ch nht m x n vung. Cc hng c nh s t 1 n m t

trn xung di, cc ct c nh s t 1 n n t tri sang phi.
Ti k ca li c t cc b xng. Ngi ta cn xy dng mt h thng n pha chiu sng, mi n ch
chiu dc theo hoc l hng hoc l ct ca li vung sao cho mi b cha phi c chiu sng bi t
nht mt n pha.
144

Bit:
ai l chi ph xy dng n chiu sng dc theo hng i.
bj l chi ph xy dng n chiu sng dc theo ct j.
Yu cu: Tm cch xy dng h thng n vi tng chi ph b nht.
D liu
Dng u tin cha 3 s nguyn dng m, n, k.
Dng th hai cha m s a1, a2 ... , am.
Dng th ba cha n s b1, b2 ... , bn.
Dng th i trong s k dng tip theo cha ta ca b xng th i.
Kt qa
Dng u ghi tng chi ph theo cch xy dng tm c.
Dng th hai ghi P v Q theo th t l s lng n chiu dc theo hng v ct (ghi s 0 nu khng
c).
P+Q dng tip theo cha ln lt cc ta ca cc hng, ri n ta ca cc ct c t n chiu

sng, mi ta ghi trn mt dng.
Gii hn
1 m , n 100.
k mn.
1 ai 100.
1 bi 100.
V d
D liu:
2 3 4
10 5
12 4 2
1 2
1 3
2 1
2 3
Kt qa
11
1 2
145

2
2
3
D liu:
2 3 4
15 17
2 4 6
1 1
2 2
2 3
2 1
Kt qa
12
0 3
1
2
3
Ma thin thch
Ngy:
18-01-2008
im:
1.0
M bi:
NKRAIN
S ngi gii c/
lm:
40 / 118
Loi bi:
oi
T l ng:
9.0%
Thi gian chy:
1s
Bi chy tt nht:
romand3 (100 im 0.08s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Ph ng nhn c thng tin v mt cn ma thin thch sp p xung tri t.

Ph ng nh Cui xc nh xem c bao nhiu thin thch c th ri xung cnh ng ca ng ta. Cnh ng
ca Ph ng c dng mt hnh a gic li c xc nh bi danh sch cc nh c lit k theo chiu
ngc kim ng h.
Yu cu: Xc nh xem trong tp cho trc cc im ri ca thin thch c bao nhiu im nm trn cnh
ng ca ph ng. Cc im nm trn bin ca cnh ng khng c tnh l im nm trn cnh ng.
D liu
146
Dng u tin cha s nguyn n (3 n 5000) l s nh ca a gic li m t cnh ng ca Ph

ng.
Mi dng trong s n dng tip theo cha cp ta ca mt nh ca a gic li, hai s c ghi
cch nhau bi du cch.
Dng tip theo l s nguyn m (2 m 5000) - s im ri ca thin thch.
Mi dng trong s m dng cui cng cha hai s c phn cch nhau bi du cch l ta im
ri ca mt thin thch.
Cc ta ri l cc s nguyn c gi tr tuyt i khng vt qa 106.
Kt qa
Ghi ra m dng, mi dng tng ng vi mt im ri ca thin thch. Ghi 'YES' nu im ri ca thin
thch nm trong cnh ng v ghi 'NO' nu tri li.
V d
D liu:
4
2 4
8 4
6 8
4 6
4
3 5
4 7
5 5
6 7
Kt qa
NO
NO
YES
YES
Distance
Ngy:
18-01-2008
im:
1.9
M bi:
NKDIST
S ngi gii c/
lm:
3 / 22
Loi bi:
oi
T l ng:
6.1%
147

Thi gian chy:
1s
Bi chy tt nht:
buihaduong (100 im 0.06s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Vietnamese Olympiad in
Informatics 2003
Xt D l dy v hn cc ch s trong h m c s 16 (Hexa) bng cch vit lin tip cc s tng dn t 1

tr i: 1, 2, 3, 4, . . ., N, ... Phn u ca dy D l
123456789ABCDEF101112131415161718191A1B1C1D1E1F202122...
C th coi dy D l mt xu v hn cc k t s h 16. Gi S l xu bt k ch bao gm cc k t s ca h
16. S ln xu S xut hin trong D nh mt xu con l v hn. Khong cch gia hai ln xut hin lin tip
khng giao nhau ca S l s k t ca D nm gia hai ln xut hin ny. V d, nu S = 21 th khong cch
gia ln xut hin th nht v th hai l 27 (nh minh ha trn).
Yu cu: Cho xu S di khng qu 30 k t, hy xc nh khong cch gia hai ln xut hin th nht v
th hai ca S trong D.
D liu
Gm mt dng duy nht cha xu S.
Kt qu
Cha mt s nguyn l khong cch tm c tng ng vi xu S.
V d
D liu:
21
Kt qa
27
D liu:
A
Kt qa
26
Bus
Ngy:
18-01-2008
im:
1.0
M bi:
NKBUS
S ngi gii c/
lm:
42 / 61
148

Loi bi:
oi
T l ng:
27.3%
Thi gian chy:
2s
Bi chy tt nht:
akita (100 im - 1.26s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Adapted from Ukrainian

OI 2000
Mt xe but ca cng ty c nhim v n nhn vin n tr s lm vic. Trn hnh trnh, xe but s tip
nhn nhn vin ng ch cc im hn nu nh xe cn ch trng. Xe but c th li ch nhng
cng nhn cha kp n im hn.
Cho bit thi im m mi nhn vin n im hn ca mnh v thi im qua mi im hn ca xe but.
Gi thit rng xe but n im hn u tin ti thi im 0 v thi gian xp khch ln xe c bng 0.
Xe but cn phi ch mt s lng nhiu nht cc nhn vin c th c n tr s. Hy xc nh khong
thi gian ngn nht xe but thc hin cng vic.
D liu vo
Dng u tin cha 2 s nguyn dng n, m theo th t l s im hn v s ch ngi ca xe but
Dng th i trong s n dng tip theo cha s nguyn ti l thi gian cn thit xe but di chuyn t im
hn th i n im hn th i+1 (im hn th n+1 s l tr s lm vic ca cng ty) v s nguyn k l s
lng nhn vin n im hn i, tip theo k s nguyn l cc thi im n im hn ca k nhn vin.
Kt qa
Gm mt dng duy nht, l thi gian ngn nht tm c.
Gii hn
1 n 200000, 1 m 20000
Tng s nhn vin khng vt qu 200000.
Kt qu khng vt qu 231-1.
V d
D liu mu
3 2
3 2 4 3
1 3 6 3 7
5 1 5
Kt qa
10
149

Gii thch: Trn ng n cng ty c 3 trm xe but. T trm 1 n trm 2, trm 2 n trm 3, v t trm 3
n cng ty ln lt mt 3, 1 v 5 n v thi gian. Xe but c th i nh sau: n thng trm 2, n ngi
th 2, n trm 3, ch 1 n v thi gian n ngi duy nht trm ny, v cui cng n cng ty. Tng
cng xe but i mt 3 + 1 + 1 + 5 = 10 n v thi gian.
Kim tra chng trnh

Ngy:
18-01-2008
im:
1.4
M bi:
NKTEST
S ngi gii c/
lm:
18 / 48
Loi bi:
oi
T l ng:
18.7%
Thi gian chy:
1s
Bi chy tt nht:
haqduong (100 im 0.16s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
UVA
Test tuy khng phi l phng php chng minh tnh ng n ca chng trnh, nhng vn c s
dng rng ri pht hin li sai v tng tin cy. C nhiu phng php hiu chnh chng trnh, nhng
ni dung ch yu vn da trn c s chn cc b tests i vo cc nhnh khc nhau ca chng trnh.
Cho m t chng trnh di dng cc dng lnh. Cc lnh tuyn tnh c k hiu l S, lnh r nhnh
khng y c xc nh bi 2 cu lnh IF v END_IF, lnh r nhnh y c xc nh bi 3 cu
lnh IF, ELSE, v END_IF. iu kin sau IF c b qua trong m t. Chng trnh kt thc bng lnh
ENDPROGRAM.
Yu cu: xc nh s lng tests cn thit kim tra tt c cc nhnh ca chng trnh.
D liu
Gm nhiu dng, m t mt chng trnh theo nh dng nu.
Kt qa
Gm 1 dng duy nht, cha s lng tests cn thit kim tra tt c cc nhnh ca chng trnh.
Gii hn
Kt qu khng vt qu 231-1
V d
D liu:
S
IF
150

S
S
ELSE
IF
IF
S
ELSE
S
END_IF
S
ELSE
S
END_IF
END_IF
S
ENDPROGRAM
Kt qa
4
D liu:
S
IF
END_IF
ENDPROGRAM
Kt qa
2
D liu:
S
S
ENDPROGRAM
Kt qa
1
Lubenica
Ngy:
18-01-2008
im:
1.1
M bi:
LUBENICA
S ngi gii c/
lm:
30 / 47
151

Loi bi:
oi
T l ng:
22.2%
Thi gian chy:
3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Croatian OI 2006
Mng li giao thng 1 nc bao gm N thnh ph (nh s t 1 n N) v N-1 ng ni cc thnh ph

vi nhau. C mt ng i duy nht gia mi cp thnh ph. Mi con ng c mt di xc nh.
Vit chng trnh, vi mi K cp thnh ph cho trc, tm di ca con ng ngn nht v di nht trn
ng i gia 2 thnh ph ny.
D liu
Dng u tin cha s nguyn N, 2 N 100 000.
Mi dng trong s N-1 dng tip theo cha 3 s nguyn A, B, C cho bit c mt con ng di C gia
thnh ph A v thnh ph B. di ca mi con ng l s nguyn dng khng vt qu 1000000.
Dng tip theo cha s nguyn K, 1 K 100 000.
Mi dng trong s K dng tip theo cha 2 s nguyn D v E - ch s ca 2 thnh ph cn truy vn.
Kt qa
Mi dng trong s K dng cha 2 s nguyn - di ca con ng ngn nht v di nht trn ng ni
gia 2 thnh ph tng ng.
V d
D liu:
5
2 3 100
4 3 200
1 5 150
1 3 50
3
2 4
3 5
1 2
Kt qa
100 200
50 150
50 100
152

D liu:
7
3 6 4
1 7 1
1 3 2
1 2 6
2 5 4
2 4 4
5
6 4
7 6
1 2
1 3
3 5
Kt qa
2 6
1 4
6 6
2 2
2 6
D liu:
9
1 2 2
2 3 1
3 4 5
2 7 4
1 5 3
5 6 1
5 9 2
1 8 3
5
6 9
7 8
9 4
1 2
7 3
Kt qa
1 2
2 4
1 5
2 2
153

1 4
Team Selection
Ngy:
18-01-2008
im:
0.9
M bi:
NKTEAM
S ngi gii c/
lm:
45 / 80
Loi bi:
oi
T l ng:
26.9%
Thi gian chy:
1s
Bi chy tt nht:
mocthulan (100 im 0.37s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Balkan OI 2004
Cc trng on i tuyn tin hc vng Balkan mun chn ra nhng th sinh mnh nht trong khu vc t N
th sinh (3 N 100000). Cc trng on t chc 3 k thi, mi th sinh s tham d c 3. Bit rng khng
c 2 th sinh no c cng im s trong mi k thi. Ta ni th sinh A gii hn th sinh B nu A c xp
hng trc B trong c 3 k thi. Mt th sinh A c gi l xut sc nu nh khng c th sinh no gii hn
A.
Yu cu: Hy gip cc trng on m s th sinh xut sc.
D liu vo
Dng th nht cha 1 s nguyn dng N.
3 dng sau, mi dng cha N s nguyn dng cch nhau bi khong trng, l ch s ca cc th sinh
theo th t xp hng t cao n thp ca k thi tng ng.
Kt qa
Gm 1 s nguyn duy nht cho bit s th sinh xut sc.
V d
D liu mu
3
2 3 1
3 1 2
1 2 3
Kt qa
3
Khng c th sinh no gii hn th sinh khc nn c 3 th sinh u xut sc.

154
D liu mu
10
2 5 3 8 10 7 1 6 9 4
1 2 3 4 5 6 7 8 9 10
3 8 7 10 5 4 1 2 6 9
Kt qa
4
Th sinh 1, 2, 3, 5 l nhng th sinh xut sc.
Dy nghch th
Ngy:
18-01-2008
im:
0.4
M bi:
NKINV
S ngi gii c/
lm:
144 / 218
Loi bi:
oi
T l ng:
24.1%
Thi gian chy:
1s
Bi chy tt nht:
company_1 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOICamp Marathon 20052006
Cho mt dy s a1.. aN. Mt nghch th l mt cp s u, v sao cho u < v v au > av. Nhim v ca bn l m
s nghch th.
D liu
Dng u ghi s nguyn dng N.
N dng sau mi dng ghi mt s ai ( 1 i N ).
Kt qa
Ghi trn mt dng s M duy nht l s nghch th.
Gii hn
1 N 60000
1 ai 60000
V d
155
D liu:
3
3
1
2
Kt qa
2
Chia a gic
Ngy:
20-01-2008
im:
1.3
M bi:
NKPOLY
S ngi gii c/
lm:
22 / 31
Loi bi:
oi
T l ng:
20.4%
Thi gian chy:
1s
Bi chy tt nht:
aukcwe (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
c vua vng quc XYZ t chc kn r cho c cng cha duy nht ca mnh. V vy, ng t ra nhng
yu cu rt cao cho con r tng lai. c th tr thnh con r ca ngi, cc chng trai thi nhau th hin
mnh. Sau khi vt qua nhng phn thi i hi sc kho, lng dng cm, h s gp phi mt th thch v
cng kh khn, l phn thi v s nhanh nhy v thng minh. c vua s cho mi ngi mt ming ba
hnh a gic li N nh. c vua yu cu cc chng trai v N-3 ng cho bt k sao cho 2 ng cho bt
k khng c im chung khc cc u mt. Vi cch v nh vy, chng ta s thu c N-2 hnh tam gic.
c vua yu cu h hy tm 2 cch chia:
Mt cch chia sao cho tam gic c din tch ln nht trong N-2 tam gic l ln nht.
Mt cch chia sao cho tam gic c din tch ln nht trong N-2 tam gic l nh nht.
Sau khi nh vua a ra hnh dng ca a gic li, h s ch c 1 giy a ra p n ca mnh. Ngi a
ra p n ng nht v nhanh nht s c chn lm ph m. Bn cng l mt ngi lt vo vng thi
ny. Hy chng t kh nng ca mnh i!
D liu
Dng u tin ghi s nguyn N l s nh ca a gic.
Trong n dng sau, mi dng ghi mt cp s nguyn l ta cc nh ca a gic. Cc nh c lit

k theo chiu kim ng h.
Kt qa
156
Dng th nht ghi din tch ca tam gic ln nht trong trng hp 1.
Dng th hai ghi din tch ca tam gic ln nht trong trng hp 2.
Cc gi tr din tch c chnh xc 1 ch s thp phn.
Gii hn
4 N 200.
Cc ta l cc s nguyn c tr tuyt i khng qu 106.
V d
D liu:
5
0 0
0 2
1 4
2 2
2 0
Kt qa
4.0
2.0
Dy con di nht
Ngy:
20-01-2008
im:
0.6
M bi:
NKMAXSEQ
S ngi gii c/
lm:
100 / 177
Loi bi:
oi
T l ng:
15.4%
Thi gian chy:
1s
Bi chy tt nht:
nhocjok (100 im 0.16s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
thi quc gia 2006
Cho dy s nguyn a1, a2, , an.

Dy s ai, ai+1, , aj vi 1 i j n c gi l dy con ca dy s cho v khi , j-i+1 c gi l
di, cn ai+ai+1...+aj c gi l trng lng ca dy con ny.
Yu cu: cho s nguyn p, trong s cc dy con ca dy s cho c trng lng khng nh hn p hy tm
dy con c di ln nht.
157
D liu vo
Dng u tin ghi hai s nguyn n v p cch nhau bi du cch.
Dng th i trong s n dng tip theo cha s nguyn ai l s hng th i ca dy s cho, i = 1, 2,

, n.
Kt qa
Ghi ra s nguyn k l di ca dy con tm c (qui c: nu khng c dy con no tha mn iu kin
t ra th k = -1).
Hn ch
Trong tt c cc test: 1 n 50000; |ai| 20000; |p| 109. C 50% s lng test vi n 2000.
V d
D liu mu
5 6
-2
3
2
-2
3
Kt qa
4
D liu mu
4 9
2
3
2
-2
Kt qa
-1
ng i trn li
Ngy:
20-01-2008
im:
0.6
M bi:
NKPATH
S ngi gii c/
lm:
98 / 122
158

Loi bi:
oi
T l ng:
28.8%
Thi gian chy:
20s
Bi chy tt nht:
company_1 (100 im 20.78s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
thi quc gia 2006
Cho mt li vung gm m dng v n ct. Cc dng c nh s t 1 n m t trn xung di, cc ct

c nh s t 1 n n t tri qua phi. nm v tr dng i v ct j ca li c gi l (i, j) v khi ,
i c gi l ta dng cn j c gi l ta ct ca ny. Trn (i, j) ca li ghi s nguyn dng
aij, i = 1, 2, , m; j = 1, 2, , n. Trn li cho, t (i, j) ta c th di chuyn n (p, q) nu cc iu
kin sau y c tha mn:
j < n; i p; j q v i + j < p + q;
aij v apq c c s chung ln hn 1.
Ta gi mt cch di chuyn t mp tri sang mp phi ca li l cch di chuyn bt u t mt c ta

ct bng 1 qua cc ca li theo qui tc di chuyn nu v kt thc mt c ta ct bng n.
Yu cu: Tnh s cch di chuyn t mp tri li sang mp phi li.
D liu vo
Dng u tin ghi 2 s nguyn dng m, n.
Dng th i trong s m dng tip theo ghi n s nguyn dng ai1, ai2, , ain l cc s trn dng th i
ca li, i = 1, 2, , m.
Hai s lin tip trn cng mt dng c ghi cch bi t nht mt du cch.
Kt qa
Ghi ra 1 s nguyn l phn d ca s lng cch di chuyn tm c cho 109.
Hn ch
Trong tt c cc test: 1 < m, n 100; aij 30000, i=1,2,,m;j=1,2,,n. C 50% s lng test vi m, n
50.
V d
D liu mu
2 2
2 4
6 8
Kt qa
159

4
D liu mu
2 2
2 5
6 7
Kt qa
0
Mng truyn tin

Ngy:
20-01-2008
im:
0.9
M bi:
NKNET
S ngi gii c/
lm:
54 / 62
Loi bi:
oi
T l ng:
28.7%
Thi gian chy:
1s
Bi chy tt nht:
tokucha (100 im - 0.1s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Trong mt chin dch, ngi ta thu thp c thng tin v mt mng truyn tin ca i phng, bao gm n
trm v m ng ni gia nhng trm ny. Cc trm c nh s t 1 n n. Hai trm lin lc c vi
nhau nu c mt ng ni trc tip gia chng hoc c mt dy nhng ng ni i qua mt s trm trung
gian no y.
Yu cu t ra l tm cch ph hy mt s ng ni hai trm cho trc khng lin lc c vi nhau.
Gi thit ban ch huy nhn lc c mi i ph trch vic ph hu mt ng ni v lnh ph hu c
pht ng thi. Do a hnh khc nhau nn vic ph hu mi ng ni cn mt khong thi gian tng ng
khc nhau. Hy tm mt phng n thi im hon thnh nhim v l sm nht. Nu c nhiu phng n
nh th, hy tm phng n phi c t i nht.
D liu
Dng u ghi gi tr n l s trm ca mng (khng qu 100).
Dng tip ghi gi tr m l s ng ni ca mng (khng qu n(n-1)/2).
m dng tip theo, mi dng ghi thng tin ca mt ng ni gm 3 gi tr nguyn dng: hai gi tr
u l s hiu ca ha trm xc nh ng ni, gi tr sau (khng qu 100) l thi gian cn thit cho
vic ph hy ng ni ny.
Dng cui cng ghi hai gi tr l s hiu ca hai trm cn ct t lin lc.
Kt qu
160
Dng u ghi gi tr m l s ng ni cn ph hy.
m dng tip theo, mi dng m t mt ng ni cn ph hy gm hai gi tr l s hiu ca hai trm

xc nh ng ni ny.
Cc gi tr s ghi trn cng mt dng cch nhau t nht mt du trng. D liu vo lun m bo c ng
truyn tin ni hai trm cn ct lin lc.
V d
D liu:
5
6
1 2 3
1 5 1
2 3 1
2 5 1
3 4 4
3 5 3
1 4
Kt qa
3
1 5
2 3
2 5
Gii thch: thi gian hon thnh nhim v l 1.
n trng
Ngy:
22-01-2008
im:
1.6
M bi:
LQDBUS
S ngi gii c/
lm:
10 / 17
Loi bi:
oi
T l ng:
11.2%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Bn Taek
Trng THPT chuyn L Qu n, TP Nng c mt h thng xe but ring. Hng ngy xe but s chy
dc theo b sng Hn th mng n cc hc sinh n trng. Trn hnh trnh, xe but s tip nhn cc
hc sinh ng ch cc in hn nu nh xe cn ch trng. Xe but c th li ch nhng hc sinh
161

cha kp n im hn. Tuy nhin v hc sinh trng L Qu n l nhng hc sinh rt coi trng vic gi
gic nn h c th xe but ch ch khng bao gi chu ch xe but. iu c ngha l nu h n im
hn m xe cha n th h s t i b n trng.
Cho bit thi im m mi hc sinh n im hn ca mnh v thi im qua mi im hn ca xe but. Gi
thit rng xe but n im hn u tin ti thi im 0 v thi gian xp khch ln xe c bng 0.
Xe but cn phi ch mt s lng nhiu nht cc hc sinh c th c n trng. Hy xc nh khong
thi gian ngn nht xe but thc hin cng vic.
D liu vo
Dng u tin cha 2 s nguyn dng n, m theo th t l s im hn v s ch ngi ca xe but.
Dng th i trong s n dng tip theo cha s nguyn ti l thi gian cn thit xe but di chuyn t
im hn th i n im hn th i+1 (im hn th n+1 s l trng L Qu n) v s nguyn k l
s lng hc sinh n im hn i, tip theo k s nguyn l cc thi im n im hn ca k hc
sinh.
Kt qa
Gm mt dng duy nht, l thi gian ngn nht tm c.
Gii hn
1 n 200000, 1 m 20000
Tng s hc sinh khng vt qu 200000.
Kt qu khng vt qu 231-1.
V d
D liu:
3 5
1 2 0 1
1 1 2
1 4 0 2 3 4
Kt qa
5
Mng my tnh
Ngy:
25-01-2008
im:
0.8
M bi:
NKONEARC
S ngi gii c/
lm:
66 / 81
162

Loi bi:
oi
T l ng:
31.1%
Thi gian chy:
1s
Bi chy tt nht:
- 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
thi quc gia 2006
Mt h thng n my tnh (cc my tnh c nh s t 1 n n) c ni li thnh mt mng bi m knh

ni, mi knh ni hai my no v cho php ta truyn tin mt chiu t my ny n my kia. Gi s s v t
l 2 my tnh trong mng. Ta gi ng truyn t my s n my t l mt dy cc my tnh v cc knh ni
chng c dng:
s = u1, e1, u2, ..., ui, ei, ui+1, ..., uk-1, ek-1, uk = t
trong u1, u2, ..., uk l cc my tnh trong mng, ei - knh truyn tin t my ui n my ui+1. (i = 1, 2,... , k1).
Mng my tnh c gi l thng sut nu nh i vi hai my u, v bt k ta lun c ng truyn tin t u
n v v ng truyn tin t v n u. Mng my tnh c gi l hu nh thng sut nu i vi hai my u,
v bt k, hoc l c ng truyn t u n v, hoc l c ng truyn t v n u.
Bit rng mng my tnh cho l hu nh thng sut nhng khng thng sut.
Yu cu: hy xc nh xem c th b sung ng mt knh truyn tin bin mng cho tr thnh thng
sut c khng?
D liu
Dng u tin ghi 2 s nguyn n v m.
Dng th i trong s m dng tip theo m t knh ni th i bao gm 2 s nguyn dng ui v vi cho
bit knh ni th i cho php truyn tin t my ui n my vi, i=1,2,...,m.
Cc s trn cng mt dng c ghi cch nhau bi du cch.
Kt qa
Dng u tin ghi 'YES' nu cu tr li l khng nh, ghi 'NO' nu cu tr li l ph nh.
Nu cu tr li l khng nh th dng th hai ghi hai s nguyn dng u, v cch nhau bi du cch
cho bit cn b sung knh truyn tin t my u n my v bin mng thnh thng sut.
Hn ch
Trong tt c cc test, n 2000, m 30000.
V d
D liu:
163

3 2
1 2
2 3
Kt qa
YES
3 1
Trang tr dn n
Ngy:
25-01-2008
im:
1.3
M bi:
NKDEC
S ngi gii c/
lm:
23 / 42
Loi bi:
oi
T l ng:
18.6%
Thi gian chy:
1s
Bi chy tt nht:
ykirinsl (100 im 0.04s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Nhn dp Ging sinh v nm mi, mt ca hng lp t mt dn n c dng bng hnh ch nht m x n. Trn
dn n c mt s v tr cn lp t bng n. Ca hng mun trang tr dn n bng cc bng n mu.
tht p mt, ca hng mun cc bng n nm trn cng hng hoc cng ct u khc mu nhau! Nhng
m bo s hi ha, dn n khng nn c qu nhiu mu.
Bn hy gip ca hng trang tr dn n, sao cho s loi bng n mu cn s dng l t nht!
D liu
Dng u tin cha 2 s nguyn m, n (1 m, n 100)
m dng tip theo, mi dng cha n k t '0' hoc '1' th hin dn n, k t '1' cho bit v tr cn lp
t bng n.
Kt qa
Dng u tin: cha s nguyn p l s loi bng n mu t nht cn s dng.
Dng th i trong s m dng tip theo cha n s nguyn, s th j l ch s mu ca bng n v tr

tng ng, hoc l 0 nu v tr tng ng khng cn lp t bng n. Cc mu c nh s t 1
n p.
V d
D liu:
164

5 10
1100111010
0011000101
0001011000
0110001010
1111010100
Kt qa
6
3 2 0 0 4 5 6 0 1 0
0 0 2 3 0 0 0 4 0 1
0 0 0 2 0 3 1 0 0 0
0 3 1 0 0 0 4 0 2 0
2 4 3 5 0 6 0 1 0 0
Khun thp
Ngy:
27-01-2008
im:
1.0
M bi:
STEEL
S ngi gii c/
lm:
40 / 43
Loi bi:
oi
T l ng:
42.9%
Thi gian chy:
2s
Bi chy tt nht:
funny (100 im - 0.85s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
thi quc gia 2005
chun b cho L hi k nim 30 nm ngy Chin dch H Ch Minh ton thng, gii phng min Nam,
thng nht t nc, ngi ta cn gia cng cc loi khun thp c hnh dng l cc hnh a gic li M nh.
Mi khun thp c thit k trn mt tm thp cng c hnh dng l mt hnh a gic li N nh, khng c
cnh no ca khun thp nm gn trn mt cnh ca tm thp. tin cho vic gia cng, khun thp c
v sao cho hai ng thng cha hai cnh khng k nhau ca n khng ct nhau bn trong tm thp.
Cng vic chnh cn lm trong qu trnh gia cng l s dng my ct ct c khun thp t tm thp ra.
R rng l cn phi thc hin M nht ct. Mi nht ct c thc hin bng cch chn mt cnh no ca
khun thp v ct theo ng thng cha cnh y chia tm thp thnh hai phn, mt phn cha khun thp
cn gia cng. Chi ph ct khun thp l tng chiu di ca cc ng ct.
165
Trn hnh 1 v 2, tm thp l t gic c t nht, khun thp l hnh vung c t bng cc gch m.
Cc nt gch t l cc ng ct vi tng chi ph bng 6.5 n v.
Yu cu: Cho bit hnh dng tm thp v khun thp cn gia cng. Hy tm phng n ct khun thp c chi
ph nh nht.
D liu
Dng u ghi s N l s nh ca tm thp; dng tip theo, mi dng ghi 2 s thc x v y, l to N nh
ca tm thp c lit k theo chiu kim ng h bt u t mt nh no ; dng tip theo ghi s M l s
nh ca khun thp; cui cng l M dng, mi dng ghi 2 s thc x v y l to M nh ca khun thp
c lit k theo chiu kim ng h bt u t mt nh no . Cc s trn mt dng cch nhau t nht mt
du cch.
Kt qa
Gm mt dng duy nht l chi ph nh nht tm c vi chnh xc ti 4 ch s sau du chm thp phn.
Gii hn
3 N 2000
3 M 2000
-104 < x, y < 104
V d
D liu:
4
2 1
2 5
5 3.5
5 2
4
3 3
166

3 4
4 4
4 3
Kt qa
6.5000
Sn golf
Ngy:
27-01-2008
im:
1.1
M bi:
NKGOLF
S ngi gii c/
lm:
32 / 69
Loi bi:
oi
T l ng:
15.5%
Thi gian chy:
2s
Bi chy tt nht:
tinams (100 im - 0.93s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Khc Anh Tun - ICAMP

4
Sau nhiu ln tham gia k thi Icamp v ginh c nhiu gii thng, KAT quyt nh u t s tin ny
xy dng mt sn golf mang tn mnh.
Sn golf m KAT nh xy nm trong khun vin mt khu t hnh ch nht kch thc M x N c chia
thnh li M hng v N ct, cc hng c nh s t 1 n M t trn xung di, cc ct c nh s t
1 n N t tri sang phi. t ti hng i, ct j c cao l Hij.
KAT s chn mt hnh ch nht con gm cc t thuc li xy sn golf sao cho vi hnh ch nht con
ny th cc s trn 1 hng bt k tnh t tri sang phi, cc s trn 1 ct bt k tnh t trn xung di u c
cao khng gim. Sau , KAT s t l golf ti gc tri trn v v tr bt u nh ti gc phi di ca
hnh ch nht khi nh, qu bng lun ln xung l.
Bn hy gip KAT chn c sn golf c din tch ln nht tha mn yu cu trn.
D liu
Dng u tin ghi 2 s nguyn dng M v N l s hng v s ct ca khu t.
Dng th i trong s M dng tip theo ghi N s nguyn Hi1, Hi2, .., HiN m Hij l cao t ti hng
i, ct j.
Kt qa
Ghi ra 1 s nguyn duy nht l din tch ln nht ca khu t chn c.
Gii hn
1 M, N 1000
167
|Hij| 109
V d
D liu:
3 4
9 2 4 8
3 5 7 8
6 8 1 3
Kt qa
6
Gii thch: khu t chn c c ta (1,2), (2,4).
Tr chi d mn
Ngy:
27-01-2008
im:
0.9
M bi:
NKMINES
S ngi gii c/
lm:
48 / 87
Loi bi:
oi
T l ng:
22.5%
Thi gian chy:
1s
Bi chy tt nht:
mr_luu91 (100 im 0.12s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOIcamp Marathon 20052006
Mt bi mn hnh ch nht c cnh M N nguyn dng. Bi mn c chia thnh M N vung n v

bng cc ng song song vi cc cnh, cc dng vung nh s t 1 n M t trn xung di, cc ct
vung nh s t 1 n N t tri sang phi, hai vung khc nhau c gi l k nhau nu chng c t nht
mt nh chung. Mi vung c khng qu mt qu mn. ghi nhn tnh trng mn ti cc ng thi c
th gi b mt phn no, ngi ta lp mt mng hai chiu M dng N ct m A[U, V] bng s mn c im
chung vi [U, V] ca bi mn (c nhiu nht 8 c im chung vi mt cho trc).
Cho mng A, hy tm cch xc nh cc c mn.
D liu
Dng u gm hai s nguyn M, N l kch thc hnh ch nht.
M dng sau, mi dng ghi N s th hin mng A.
Kt qa
168

Gm M dng, mi dng ghi N s 0 hoc 1 tng ng vi khng c mn hoc c mn. Nu c nhiu kt
qu tha mn, ch cn a ra mt kt qu duy nht. Bit rng d liu vo lun m bo c t nht mt kt
qu.
Gii hn
1 M, N 200
V d
D liu:
4 4
1 3 3 1
2 3 4 4
3 6 5 3
1 3 3 3
Kt qa
1 0 0 1
0 1 1 0
0 0 1 1
1 1 1 0
VOI08 Tr chi vi dy s
Ngy:
29-01-2008
im:
0.4
M bi:
NKSGAME
S ngi gii c/
lm:
169 / 277
Loi bi:
oi
T l ng:
17.6%
Thi gian chy:
1s
Bi chy tt nht:
overtherainbow (100
im - 0.35s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VOI 2008
Hai bn hc sinh trong lc nhn ri ngh ra tr chi sau y. Mi bn chn trc mt dy s gm n s

nguyn. Gi s dy s m bn th nht chn l:
b1, b2, ..., bn
cn dy s m bn th hai chn l
c1, c2, ..., cn
169

Mi lt chi mi bn a ra mt s hng trong dy s ca mnh. Nu bn th nht a ra s hng bi (1 i
n), cn bn th hai a ra s hng cj (1 j n) th gi ca lt chi s l |bi+cj|.
V d: Gi s dy s bn th nht chn l 1, -2; cn dy s m bn th hai chn l 2, 3. Khi cc kh nng
c th ca mt lt chi l (1, 2), (1, 3), (-2, 2), (-2, 3). Nh vy, gi nh nht ca mt lt chi trong s cc
lt chi c th l 0 tng ng vi gi ca lt chi (-2, 2).
Yu cu
Hy xc nh gi nh nht ca mt lt chi trong s cc lt chi c th.
D liu
Dng u tin cha s nguyn dng n (n 105)
Dng th hai cha dy s nguyn b1, b2, ..., bn (|bi| 109, i=1, 2, ..., n)
Dng th hai cha dy s nguyn c1, c2, ..., cn (|ci| 109, i=1, 2, ..., n)
Hai s lin tip trn mt dng c ghi cch nhau bi du cch.
Kt qu
Ghi ra gi nh nht tm c.
Rng buc
60% s tests ng vi 60% s im ca bi c 1 n 1000.
V d
D liu:
2
1 -2
2 3
Kt qa
0
VOI08 L c
Ngy:
29-01-2008
im:
0.4
M bi:
NKJUMP
S ngi gii c/
lm:
149 / 186
Loi bi:
oi
T l ng:
36.1%
170

Thi gian chy:
1s
Bi chy tt nht:
technolt (100 im 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VOI 2008
Nhy l c l tr chi dn gian ca Vit Nam. Ngi trn hnh tinh X cng rt thch tr chi ny v h
ci bin tr chi ny nh sau: Trn mt phng v n vng trn c nh s t 1 n n. Ti vng trn i ngi
ta in s nguyn dng ai. Hai s trn hai vng trn ty khng nht thit phi khc nhau. Tip n ngi
ta v cc mi tn, mi mi tn hng t mt vng trn n mt vng trn khc. Quy tc v mi tn l: Nu
c ba s ai, aj, ak tha mn ak = ai + aj th v mi tn hng t vng trn i n vng trn k v mi tn hng
t vng trn j n vng trn k. Ngi chi ch c di chuyn t mt vng trn n mt vng trn khc nu
c mi tn xut pht t mt trong s cc vng trn, di chyn theo cch mi tn v i n cc vng trn
khc. Ngi thng cuc s l ngi tm c cch di chuyn qua nhiu vng trn nht.
V d: Vi 5 vng trn v cc s trong vng trn l 1, 2, 8, 3, 5, tr chi c trnh by trong hnh di y:
Khi c th di chuyn c nhiu nht qua 4 vng trn (tng ng vi ng di chuyn c t m trn
hnh v).
Yu cu
Hy xc nh xem trong tr chi m t trn, nhiu nht c th di chuyn c qua bao nhiu vng trn.
D liu
Dng u cha s nguyn n (3 n 1000);
Dng th hai cha dy s nguyn dng a1, a2, ..., an (ai 109, i=1, 2,..., n).
Hai s lin tip trn mt dng c ghi cch nhau bi du cch.
Kt qu
Ghi ra s lng vng trn trn ng di chuyn tm c.
Rng buc
60% s tests ng vi 60% s im ca bi c 3 n 100.
V d
D liu:
5
1 2 8 3 5
171

Kt qa
4
VOI08 Qu tt
Ngy:
29-01-2008
im:
0.6
M bi:
NKGIFTS
S ngi gii c/
lm:
94 / 134
Loi bi:
oi
T l ng:
22.8%
Thi gian chy:
1s
Bi chy tt nht:
jangnara (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VOI 2008
Chun b n nm mi. Cng ty bnh ko Hng Da lm mt tm scla cc ln vi mc ch ghi tn

mnh vo sch k lc Ghi-nt ng thi qung b thng hiu trc cng chng. Tm scla c hnh vung
kch thc 2kx2k, to thnh li vung 2k hng v 2k ct. Cc hng c nh s t 0 n 2k-1 t trn
xung di, cc ct c nh s t 0 n 2k-1 t tri sang phi. nm hng i v ct j c gi l (i, j).
Sau bui trng by gii thiu sn phm, tm scla c ct nh, chia cho mi ngi, mi ngi c mt
ca chic bnh k lc. B phn tip th n vo hai khc nhau (p, q) v (u, v) mi mt ng xu. V
khch no may mn nhn c scla c ng xu s c tng rt nhiu sn phm c o ca cng ty.
V chic bnh rt ln nn cng ty thit k mt my ct bnh. My thc hin dy cc thao tc ct, bt u

t chng bnh ch gm 1 tm scla ban u, mi thao tc gm hai bc sau:
Bc 1: Ct ngang song song vi cnh chng bnh chia chng scla thnh hai phn bng nhau, p
chng bnh bn di ln chng bnh bn trn sao cho mp di ln mp trn.
Bc 2: Ct dc song song vi cnh chng bnh chia chng scla thnh hai phn bng nhau, p
chng bnh bn tri ln chng bnh bn phi sao cho mp tri ln mp phi.
Nh vy sau mi ln thc hin thao tc ct, chiu di v chiu rng ca cc tm scla gim i mt na. Sau
k ln thc hin thao tc ct, cc ca tm scla s c xp thnh mt ct. Khch nhn bnh xp hng mt
v c nh s t 1 tr i, ngi th m s nhn c ming scla th m t trn xung di. (1 m 2k x
2k).
V d, vi k=1 v ng xu c n vo cc (0,0), (1,1), vic thc hin cc thao tc ct s c trnh by
trn hnh v minh ha trn. Trong v d ny, v khch th nht v th ba s l nhng ngi nhn c tng
phm ca cng ty.
Yu cu
Cho bit cc s nguyn k, p, q, u, v. Hy xc nh s th t ca hai v khch may mn nhn c qu.
172
D liu
Gm mt dng cha 5 s nguyn k, p, q, u, v, cc s cch nhau bi du cch.
Kt qu
Mt dng cha hai s nguyn l s th t cc v khch may mn. Hai s phi cch nhau ng mt du cch.
Rng buc
1 k 40, 0 p, q, u, v 2k - 1.
60% s tests ng vi 60% s im ca bi c 1 k 5.
V d
D liu:
1 0 0 1 1
Kt qa
1 3
Vng ua F1
Ngy:
12-02-2008
im:
1.5
M bi:
NKRACING
S ngi gii c/
lm:
14 / 17
Loi bi:
oi
T l ng:
26.8%
Thi gian chy:
1s
Bi chy tt nht:
tinams (100 im - 0.87s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
ACM Singapore Regional

2007
Singapore s t chc mt cuc ua xe Cng Thc 1 vo nm 2008. Trc khi cuc ua din ra, xut hin
mt s cuc ua v m tri lut. Chnh quyn mun thit k mt h thng kim sot giao thng bt gi
cc tay ua phm lut. H thng bao gm mt s camera t trn cc tuyn ng khc nhau. m bo
tnh hiu qu cho h thng, cn c t nht mt camera dc theo mi vng ua.
173
H thng ng Singapore c th c m t bi mt dy cc nt giao thng v cc ng ni hai chiu

(xem hnh v). Mt vng ua bao gm mt nt giao thng xut pht, tip theo l ng i bao gm t nht 3
tuyn ng v cui cng quay tr li im xut pht. Trong mt vng ua, mi tuyn ng ch c i
qua ng mt ln, theo ng mt hng.
Chi ph t camera ph thuc vo tuyn ng c chn. Cc s nh trong hnh v cho bit chi ph
t camera ln cc tuyn ng. Cc s ln xc nh cc nt giao thng. Camera c t trn cc tuyn
ng ch khng phi ti cc nt giao thng. Bn cn chn mt s tuyn ng sao cho chi ph lp t l
thp nht ng thi vn m bo c t nht mt camera dc theo mi vng ua.
Vit chng trnh tm cch t cc camera theo di giao thng sao cho tng chi ph lp t l thp nht.
174
D liu
Dng u tin cha 2 s nguyn n, m ( 1 n 10000, 1 m 100000) l s nt giao thng v s

ng ni. Cc nt giao thng c nh s t 1 n n.
m dng tip theo m t cc ng ni, mi dng bao gm 3 s nguyn dng cho bit hai u mt
ca tuyn ng v chi ph lp t camera. Chi ph lp t thuc phm vi [1, 1000].
Kt qa
In ra 1 s nguyn duy nht l tng chi ph lp t tht nht tm c.
V d
D liu:
6 7
1 2 5
2 3 3
1 4 5
4 5 4
5 6 4
6 3 3
5 2 3
Kt qa
6
175
Tung ng xu
Ngy:
12-02-2008
im:
0.8
M bi:
NKTOSS
S ngi gii c/
lm:
60 / 95
Loi bi:
oi
T l ng:
19.9%
Thi gian chy:
1s
Bi chy tt nht:
aukcwe (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Ngy xa, cch y lu lm ri, vng quc Byteland ti p c mt nng cng cha xinh p tuyt
trn. Tht khng may, chnh v s xinh p lm ph thy Astral bt lm v lm ngi hu cho ng
ta. c Vua v cng hoang mang khi chuyn ny xy ra, ng khng bit phi lm cch no gii cu con
mnh (ng khng th mang qun n nh v iu l v ngha). Tuy nhin, tn ph thy ny li rt s mt
cu thn ch c suy ra t vic gii mt bi ton c ca Thn Sphinx. Bi ton c th c m t mt
cch n gin nh sau: Khi ta tung mt ng xu, ta s nhn c mt sp hoc nga. Nu ta tung ln lt
N ng xu th c bao nhiu trng hp m c t nht K ng xu lin tip cng l nga ? . c vua ha s
thng rt hu hnh v g cng cha cho ai gii c bi ton ny. Thc ra cng cha v anh chng lm
vn trong hong cung yu thng nhau t lu. Anh chng gi y ang rt bi ri v cn s gip ca
bn.
D liu
Mt dng duy nht ghi hai s N v K.
Kt qa
Mt dng duy nht ghi s trng hp m c.
Gii hn
1 K N 10000
V d
D liu:
4 2
Kt qa
8
D liu:
176

4 3
Kt qa
3
Tr chi vi nhng ng xu
Ngy:
19-02-2008
im:
2.0
M bi:
GWCOINS
S ngi gii c/
lm:
1/2
Loi bi:
acm
T l ng:
33.2%
Thi gian chy:
3s
Bi chy tt nht:
khuc_tuan (100 im 0s)
Gii hn m ngun:
5000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
c gi ln bi Khc
Anh Tun
Tun v Hiu rt thch chi xu l. Mt ln, Tun r Hiu chi mt tr chi. Ban u Tun k mt hng gm
N vung lin tip trn nn nh, sau Tun ln lt t cc ng xu vo mt s ( khng c no c qu
1 ng xu ). Hai ngi bt u thc hin nc i lun phin nhau, Tun i trc. mi nc i, mt ngi
phi chn 1 ng xu bt k v mt cn trng pha bn phi ng xu ny. ng xu c chn s c t
vo v tr mi v mi ng xu nm gia v tr c v mi ca ng xu chn u b di chuyn sang tri mt
. Ngi no n lt m khng th thc hin nc i s l ngi thua cuc. Sau mt thi gian chi tr chi
ny, Hiu khng thng c vn no. Hiu bt u nghi ng rng, v tr ban u ca cc ng xu lun m
bo cho Tun mt thng li. Bn hy kim chng iu ny.
Input
Gm nhiu dng, mi dng l mt xu ch gm k t 'C' v '.' biu din trng thi ban u ca tr chi. 'C'
th hin vung c mt ng xu v '.' th hin mt vung trng. K t u tin n k t cui cng
ca xu th hin cc vung t tri sang phi ca tr chi. Mi dng c khng qu 500 k t.
Output
Vi mi dng ca input, in ra mt dng tng ng. "Tuan" th hin rng Tun lun l ngi chin thng bt
chp n lc ca Hiu, "Hieu" trong trng hp ngc li. Nu trng thi tr chi lc ban u m bo tnh
cng bng cho c 2 ngi chi, in ra "Cong bang". ( Cc xu in ra khng c du " ).
Example
Input:
C.C.C
Output:
177

Tuan
Gii thch:
Gi (a,b) l nc i di chuyn ng xu a n trng b, cc nh s t 1 n N t tri sang phi. Nu
bc u tin, Tun i (3,4), Hiu s i (1,3) v dnh chin thng. Nu Tun i (1,4), ng xu 3 s b
dch sang tri 1 , Hiu s i tip (2,3) v chin thng. Nu Tun i (1,2), Hiu c th i (3,4) hoc (2,4),
nhng Tun s dnh chin thng m khng ph thuc vo s la chn ca Hiu.
m cc hnh ch nht
Ngy:
19-02-2008
im:
1.8
M bi:
CRECT
S ngi gii c/
lm:
5 / 13
Loi bi:
acm
T l ng:
13.9%
Thi gian chy:
3s
Bi chy tt nht:
Gii hn m ngun:
5000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
c gi ln bi Khc
Anh Tun
HngM ang theo hc mt kha hc c bn v ting c. V mi bt u, HngM mi bit mt 5 ch

ci l A, B, C, D, E. Ngy sinh nht, HngM c tng mt bng hnh ch nht c cc ch ci ghi cc .
Nhim v ca HngM s l tm cc t n trong bng ny. Tuy nhin, do vn li hc ngoi ng, am m
lp trnh, HngM li ngh ra mt tr chi khc: m s hnh ch nht con ca bng ny c cha ng 3
ch ci khc nhau( V HngM khng thch qu t, cng chng a qu nhiu ). Tuy nhin, bi ny khng
n gin HngM c th gii c d dng. Cc bn hy gip HngM HngM c th nhanh
chng tp trung vo vic hc ting c.
Input
Dng u ghi 2 s M, N (M, N <= 400). Bng ch ca HngM c chia lm M dng, mi dng gm N
vung n v. M dng sau, mi dng l mt xu di N th hin mt dng ca bng ch ch gm cc ch
ci A, B, C, D, E.
Output
Gm mt s duy nht l s hnh ch nht con tm c.
Example
Input:
4 3
CED
178

CEB
CBC
DDA
Output:
12
ua xe cng thc 1
Ngy:
22-02-2008
im:
1.8
M bi:
F1
S ngi gii c/
lm:
4/6
Loi bi:
acm
T l ng:
40.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
(none)
Cc bn chc u bit n mn th thao ua xe cng thc 1 - mn th thao ca tc . Tuy nhin, thi gian
gn y, tng tnh hp dn ca mn th thao ny, BTC quyt nh thay i lut l chi. Cc tay ua s
ua xe trong mt khu vc hnh ch nht chia lm M x N nh. mi c mt im s nht nh ( tt nhin
c th l s m, l cc chng ngi vt nguy him ). Cc tay ua xut pht v tr tri trn ca bn ,
c th i t ny sang khc k cnh nhng khng c php r tri, cng khng c php i vo
tng i qua. Tay ua c quyn quyt nh kt thc chng ua bt c u. Sau khi kt thc cuc ua, ai l
ngi c vn tc nhanh nht s chin thng. Tuy nhin, trong trng hp 2 ngi c cng vn tc ( iu ny
rt hay xy ra do thit b o c k, ch o c vi chnh xc 100Km/h :D ), ngi no t c nhiu
im hn s chin thng. im ca tng tay ua s bng tng im cc tay ua i qua. Bn l mt
trong cc vn ng vin tham gia cuc ua ny, hy tnh ton xem ng ua no s em li cho bn nhiu
im nht.
Input
Dng u ghi 2 s M, N ln lt l 2 kch thc ca bn ( M, N <= 20 ). M dng sau mi dng ghi N s
l im s ca tng ng. im s nm trong khong t -100 n 100.
Output
Mt s duy nht l im s ln nht c th t c.
Example
Input:
2 2
-33 37
179

15 -5
Output:
14
ua xe cng thc 2
Ngy:
22-02-2008
im:
2.0
M bi:
F2
S ngi gii c/
lm:
1/2
Loi bi:
acm
T l ng:
49.8%
Thi gian chy:
3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
acm.timus.ru
ng ua xe cng thc 2 nm nay nm trong mt khun vin hnh ch nht chia lm M x N nh. Tuy
nhin trong khun vin ny c mt s chng ngi vt v khng th i vo. Tay ua cn xut pht t 1
bt k, i qua tt c cc khng c chng ngi vt, mi ng mt ln ri quay v im xut pht. Tay
ua ch c th i t 1 sang cc k cnh. Hy m s ng ua khc nhau c th.
Input
Dng u ghi 2 s M, N ( M, N <= 12 ). M dng sau, mi dng ghi N k t. K t '*' th hin tng ng
c chng ngi vt, v '.' nu ngc li.
Output
Gm 1 s duy nht ghi ra tng s ng ua. D liu lun m bo kt qu nh hn 2^63-1.
Example
Input:
4 4
**..
....
....
....
Output:
2
180
Billboard painting
Ngy:
23-02-2008
im:
1.4
M bi:
NKPANO
S ngi gii c/
lm:
16 / 24
Loi bi:
oi
T l ng:
24.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Prof. Nguyen Duc Nghia
Mt i th sn gm K ngi cn thc hin sn mt bc pano dnh cho qung co c dng mt hnh ch

nht kch thc 1xN c chia ra lm N vch kch thc 1x1. Cc vch c nh s t tri sang phi bt
u t 1. Th i (1 i K) ang ngi trc vch Si ca pano v anh ta ch c th sn mt dy cc vch lin
tip ca pano trong phi c vch Si. Th i ch c th sn khng qu Li vch v tin cng m anh ta nhn
c t vic sn mt vch l Pi . Mi vch c sn bi khng qu mt th.
Yu cu: Tm cch phn cng th sn cc vch ca pano sao cho tng tin cng ca tt c cc th nhn
c l ln nht.
D liu
Dng u tin cha hai s nguyn dng N, K (N 16000; K 100).
Dng th i trong s K dng tip theo cha ba s nguyn Li , Pi, Si (i = 1, 2, K) c ghi cch nhau
bi du cch (1 Pi 10000, 1 Li , Si N ).
Ch :
Cch phn cng tm c khng nht thit phi m bo sn ht tt c cc vch ca pano.
Nu th i khng sn vch no c th vic sn vch Si c th c phn cng cho th khc.
Cc s S1, S2, . . . SK gi thit l khc nhau tng i.
Kt qu
Ghi ra tng tin cng nhn c t cch phn cng th tm c.
V d
D liu:
8 4
3 2 2
3 2 3
3 3 5
181

1 1 7
Kt qa
17
(Cch phn cng: Th 1 sn cc vch 1, 2; th 2 sn cc vch 3, 4; th 3 sn cc vch 5, 6, 7; th 4 khng

sn vch no).
Dy Catalan
Ngy:
23-02-2008
im:
0.5
M bi:
NKCAT
S ngi gii c/
lm:
113 / 126
Loi bi:
oi
T l ng:
48.0%
Thi gian chy:
1s
Bi chy tt nht:
linh0710 (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Dy Catalan bc n l dy gm 2n+1 s nguyn C0, C1 C2n tha mn cc iu kin:
C0=C2n=0
|Ci+1-Ci|=1 vi mi 0 i < 2n
V d: 0 1 2 1 0 1 0 l mt dy Catalan bc 3.
Cho trc gi tr n, ta sp xp cc dy Catalan bc n theo th t t in, nh s bt u t 1. V d vi n=3,
cc dy Catalan c sp xp theo th t nh sau:
0 1 0 1 0 1 0
0 1 0 1 2 1 0
0 1 2 1 0 1 0
0 1 2 1 2 1 0
0 1 2 3 2 1 0
Bn cn vit chng trnh x l hai loi yu cu:
1. Cho mt dy Catalan, hy tm s th t t in ca dy .
2. Cho mt s th t t in, hy tm dy Catalan c th t .
D liu
Dng u ghi s nguyn n (1 n 15).
182
Dng th hai ghi mt dy s Catalan bc n.
Dng th ba ghi mt s nguyn dng k (d liu lun m bo tm c dy Catalan bc n c th t

t in bng k).
Kt qu
Dng u tin ghi s th t ca dy Catalan tng ng vi yu cu 1.
Dng th hai ghi 2n+1 s cch nhau bi khong trng, l dy Catalan tng ng vi yu cu 2.
V d
D liu:
4
0 1 2 3 2 1 2 1 0
1
Kt qa
12
0 1 0 1 0 1 0 1 0
Chui ht
Ngy:
23-02-2008
im:
1.0
M bi:
NKNLACE
S ngi gii c/
lm:
37 / 60
Loi bi:
oi
T l ng:
17.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Ng Minh c
Khi tin hnh khai qut kho c mt vng quc xa xa n, cc nh khoa hc khai qut c rt nhiu
chui ht l. Sau khi quan st, cc nh khoa hc thy rng cc chui ht c mt s c im chung.
Mi chui ht l mt si dy c nh cc ht ngc lm bng mt cht liu c xa. Cc chui ht u c s
lng ht ngc bng nhau. Hn na, mi ht ngc l mt hnh cu c ng knh l mt s nguyn dng,
v nu ln t tri sang phi trn chui ht, ngi ta thy cc ht ngc c ng knh tng dn. Nu nh s
v tr cc ht ngc bt u t 1, theo th t t tri sang phi, ngi ta nhn thy rng ht ngc th i c ng
knh khng vt qa 2i. Cc nh khoa hc cho rng, dn tc c xa ny hn lm ra tt c cc chui ht c
cng nhng c im ny, d chng hin cn ang ri rc u trn tri t.
183

Sau khng lu, cc nh khoa hc tm ra mt mnh da, trn c ghi mt con s theo loi ch s c xa.
H cho rng mnh da ny c lin quan n cc chui ht k l n. Sau nhiu c gng, cc nh khoa hc
a c con s trn mnh da v h ch s thp phn, v k hiu l X.
Manh mi n y th dng li, v cc nh khoa hc khng tm thy c vt tch no khc na, v cng
khng tm ra c mi quan h gia X v cc chui ht.
n y, mt nh khoa hc ngi Vit ngh, hy th xc nh chui ht c th t t in l X, bit u
y s l manh mi?
Yu cu
Bn hy vit chng trnh gip nh khoa hc xc nh chui ht c th t t in l X.
D liu
Dng 1: cha s nguyn dng N, l s ht ngc trong mi chui ht.
Dng 2: cha s nguyn dng X.
Kt qa
Gm 1 dng duy nht, cha N s nguyn, cch nhau mt khong trng, xc nh chui ht c th t t in
l X ( biu din mt chui ht, cn in ra N s nguyn tng ng l ng knh ca cc ht ngc trong
chui ht, theo th t t tri sang phi).
Gii hn
N l s nguyn dng trong phm vi [1, 250].
X l s nguyn dng trong phm vi t 1 n s lng ti a cc chui ht.
V d
D liu
2
4
Kt qa
2 3
Gii thch: cc chui ht sp theo th t t in ln lt l 1 2, 1 3, 1 4, 2 3, 2 4. Chui ht th 4 l 2 3.
Dy ngoc bc K
Ngy:
23-02-2008
im:
1.0
M bi:
NKBRK2
S ngi gii c/
40 / 50
184

lm:
Loi bi:
oi
T l ng:
26.1%
Thi gian chy:
1s
Bi chy tt nht:
mr_luu91 (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Cho 2 s nguyn dng N v K, gi S l tp cc dy ngoc bc K c di N k t. Hy vit chng trnh

x l cc yu cu sau:
1. Cho bit S c bao nhiu phn t.
2. Cho mt dy ngoc bc K c di N k t, hy cho bit th t t in ca dy ny trong tp S.
D liu
Dng u tin cha 2 s N, K (N l s chn khng vt qu 60, K N/2).
Dng th hai cha mt dy ngoc bc K c di N k t.
Kt qa
Dng th nht ghi s phn t ca tp S.
Dng th hai ghi th t t in ca dy ngoc cho trong tp S.
V d
D liu
6 2
(())()
Kt qa
3
2
iu xe but
Ngy:
23-02-2008
im:
1.8
M bi:
NKBUSD
S ngi gii c/
lm:
4/7
Loi bi:
oi
T l ng:
9.3%
Thi gian chy:
1s
Bi chy tt nht:
dtmp (100 im - 0.55s)
185

Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Russian OI
C n xe but chy trn tuyn l mt ng vng khp kn c di S. Cc xe but c nh s t 1 n n

theo th t ni ui nhau trn tuyn ng. Xe s 1 chy sau xe s n.
Cc xe chy cng vi vn tc V0 v khong cch gia hai xe lin tip l nh nhau.
C k xe but ng thi ri khi tuyn. tr li khong cch u nhau gia cc xe, cn phi c mt khong
thi gian t v mt s xe cn phi thay i tc . Trong khong thi gian ny, cc xe phi chy vi tc
khng i trong khong [Vmin, Vmax] theo lnh ca trung tm.
Ht khong thi gian t cc xe li quay v vn tc V0.
Yu cu: gip trung tm tm khong thi gian b nht Tmin khi phc s cn bng khong cch gia hai
xe lin tip trn tuyn v vn tc ca mi xe trong khong thi gian y. Bit rng, trong qu trnh iu chnh,
khng c xe no vt qua xe trc mt.
D liu vo
Dng th nht cha N, K ,S , Vmin, Vmax, V0.
Dng th hai cha K s nguyn dng c ghi theo th t tng dn l ch s ca cc xe ri khi

tuyn.
Cc d liu trn cng mt dng c ghi cch nhau bi t nht mt du cch.
Kt qa
Dng u tin: Tmin
Mi mt trong s N-K dng tip theo cha hai s, s th nht l ch s ca xe but, s th hai l tc
ca n trong khong thi gian Tmin. Cc dng ny phi sp xp theo th t tng dn ca ch s xe
but.
Gii hn
K < N < 10000
S 10000
Vmin < Vmax 10000
Vmin V0 Vmax
V d
D liu mu
4 1 60 21 70 60
3
186

Kt qa
0.2041
1 45.5
2 70
4 21
D liu mu
4 2 40 30 80 50
2 4
Kt qa
0
1 50
3 50
Tng cc c chung ln nht

Ngy:
15-03-2008
im:
1.9
M bi:
GCDSUM
S ngi gii c/
lm:
2 / 21
Loi bi:
acm
T l ng:
3.7%
Thi gian chy:
1.5s
Bi chy tt nht:
gerrob (100 im - 0.15s)
Gii hn m ngun:
10000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
ACM World Final Warm

up 1 - 2008
Mt ln, ktuan c thy gio cho bi tp v nh, yu cu tnh tng tt c cc c chung ln nht ca cc
cp s (i, j) tha mn : 1<=i< j<=N ( N l mt s t nhin cho trc ). Rt nhanh chng, ktuan cho ra mt
on code nh sau:
for i:=1 to N-1 do for j:=i+1 to N do sum := sum + gcd( i, j);
vi gcd l hm tnh c chung ln nht ca 2 s, sum chnh l kt qu cui cng.
Thy gio yu cu ktuan dng chng trnh trn tnh kt qu vi N = 1000000. Tuy nhin, chng trnh
trn chy qu lu. khc phc vn , ktuan vit li on m bng C++ ( vi hi vng C++ s chy
nhanh hn pascal nhiu ) :
for(int i=1;i< N;++i) for(int j=i+1;j<=N;++j) sum += gcd(i,j);
Tht khng may, on chng trnh trn vn khng gii quyt c vn , bn hy gip ktuan gii p yu
cu ca thy gio.
Lu : bi ny c th gii bng phng php Quy hoch ng v cc kin thc s ng trong ton
187

hc, khng cn s dng nhng kin thc ton hc phc tp khng nm trong phm vi chng trnh
ph thng.
Input
Gm nhiu dng, mi dng l mt s N ( 1<=N<=10^6) ng vi mt test. D liu vo s kt thc sau khi
gp N=0 ( bn khng cn thc hin test ny ).
Output
Vi mi gi tr ca N, in ra mt dng l gi tr ca sum sau khi thc hin on m trn.
Example
Input:
4
0
Output:
7
Xp hng
Ngy:
18-03-2008
im:
0.5
M bi:
NKLINEUP
S ngi gii c/
lm:
129 / 179
Loi bi:
oi
T l ng:
30.9%
Thi gian chy:
2s
Bi chy tt nht:
gerrob (100 im - 1.75s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO JAN07 - Gold

Division
Hng ngy khi ly sa, N con b ca bc John (1 N 50000) lun xp hng theo th t khng i. Mt
hm bc John quyt nh t chc mt tr chi cho mt s con b. n gin, bc John s chn ra mt
on lin tip cc con b tham d tr chi. Tuy nhin tr chi din ra vui v, cc con b phi khng
qu chnh lch v chiu cao.
Bc John chun b mt danh sch gm Q (1 Q 200000) on cc con b v chiu cao ca chng
(trong phm vi [1, 1000000]). Vi mi on, bc John mun xc nh chnh lch chiu cao gia con b thp
nht v cao nht. Bn hy gip bc John thc hin cng vic ny!
D liu
Dng u tin cha 2 s nguyn N v Q.

188
Dng th i trong s N dng sau cha 1 s nguyn duy nht, l cao ca con b th i.
Dng th i trong s Q trong tip theo cha 2 s nguyn A, B (1 A B N), cho bit on cc con
b t A n B.
Kt qa
Gm Q dng, mi dng cha 1 s nguyn, l chnh lch chiu cao gia con b thp nht v cao nht thuc
on tng ng.
V d
D liu:
6 3
1
7
3
4
2
5
1 5
4 6
2 2
Kt qa
6
3
0
Cng vin Disneyland

Ngy:
18-03-2008
im:
1.0
M bi:
NKDISNEY
S ngi gii c/
lm:
38 / 44
Loi bi:
oi
T l ng:
31.8%
Thi gian chy:
1s
Bi chy tt nht:
ththanh (100 im 0.16s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Chn i tuyn QG 2006
Bm v Cui c mi n vui chi min ph ti cng vin Disneyland nhn dp cng vin ny c khai
trng ti thnh ph Mt trng. Trong cng vin c tt c n t im vui chi (c nh s t 1 n n).
189

Trc khi i Bm v Cui ha s chp nh tt c cc t im c trong cng vin gii thiu cho cc
bn cng lp. V s lng t im qu ln m thi gian li hn hp, nn Bm v Cui quyt nh thc hin
vic do qua tt c cc t im chp nh theo qui tc sau y:
Cng xut pht ti t im 1.
Mi t im phi c t nht 1 ngi do qua.
Mi ngi s thm cc t im theo th t tng dn ca ch s.
Khi kt thc, mi ngi t t im cui cng trn ng i ca mnh phi quay v ni xut pht m
khng c i qua bt c t im no khc.
Yu cu: Cho bit tij l thi gian i t t im i n t im j (i, j = 1,2,...,n), hy xc nh gip Bm v

Cui cch thc hin cch i tun th qui tc nu sao cho tng thi gian m hai ngi phi i l nh nht.
D liu
Dng u tin cha s nguyn dng n.
Dng th i trong s n dng tip theo ghi cc s nguyn dng ti1, ti2, ..., tin, i = 1,2, ..., n.
Kt qa
In ra 1 s nguyn duy nht l tng thi gian nh nht tm c.
Hn ch
Trong tt c cc test: 1 n 200; tij 32000, i, j = 1,2, ..., n.
C 50% s lng test vi n 100.
V d
D liu:
4
0 1 1 3
1 0 2 8
1 2 0 6
3 8 6 0
Kt qa
10
190
Lp lch trn hai my

Ngy:
18-03-2008
im:
0.5
M bi:
NK2MFS
S ngi gii c/
lm:
112 / 126
Loi bi:
oi
T l ng:
39.0%
Thi gian chy:
1s
Bi chy tt nht:
absyl90 (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
C N chi tit my cn c gia cng ln lt trn hai my A v B. Thi gian gia cng chi tit i trn my A
l ai, thi gian gia cng trn my B l bi.
Yu cu: hy tm trnh t gia cng cc chi tit trn hai my sao cho vic hon thnh gia cng tt c cc chi
tit l sm nht c th.
D liu
Dng u tin cha s nguyn dng N (1 N 10000).
Dng th hai cha N s nguyn dng a1, a2 an (1 ai 10000)
Dng th ba cha N s nguyn dng b1, b2, bn (1 bi 10000).
191
Kt qu
Dng u tin cha s nguyn dng T l thi im sm nht c th hon thnh.
Dng tha hai cha N s nguyn cho bit lch trnh gia cng cc chi tit my.
V d
D liu:
3
2 3 1
1 2 3
Kt qa
7
3 2 1
A1
Ngy:
18-03-2008
im:
1.5
M bi:
NKA1
S ngi gii c/
lm:
15 / 16
Loi bi:
oi
T l ng:
72.7%
Thi gian chy:
5s
Bi chy tt nht:
minhduc9b (100 im 0.75s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Croatian OI 2003
Chnh ph lp ra mt hi ng sa cha ng cao tc chnh A1 ca t nc. ng cao tc c dng

mt ng thng, bao gm cc ct cy s lin tip cch u nhau. Hai ct cy s lin tip cch nhau 1km.
Ct cy s th nht cch im u tin ca ng cao tc 1km. C N v tr ct cy s cn sa cha trn
ng cao tc. Mi ct cy s c xc nh bi mt s nguyn cho bit khong cch i vi im u tin
ca ng cao tc (tnh theo km). Bt u t mt ct cy s no , ng cao tc c chia thnh cc on
di bng nhau, mi on cha ng M ct cy s lin tip. Mt i sa ng s c gi n mi on c
cha mt (hoc nhiu) v tr cn sa cha. Thng thng, s v tr cn sa cha ln hn nhiu so vi s i
sa ng nn tt nht cn chia ng cao tc thnh cc on di bng nhau sao cho s on cha v tr
cn sa cha l t nht.
Bit rng trong M ct cy s u tin, khng c v tr no cn sa cha. on u tin phi c bt u
trong M ct cy s u tin.
Hi cn huy ng t nht bao nhiu i sa ng sa cha c tt c v tr cn thit trn ng cao tc
A1? Xc nh cc v tr m on u tin c th bt u.
192
D liu
Dng u tin bao gm 2 s nguyn M v N cch nhau bi khong trng (1 M, N 100000).
Dng th 2 bao gm N s nguyn cch nhau bi khong trng m t nhng v tr cn sa cha. N s

nguyn to thnh mt dy tng cht, mi s khng vt qu 2000000000.
Kt qa
Dng u tin cha s i sa ng t nht cn huy ng.
Dng th hai cha tt c cc v tr m on u tin c th bt u. Cc s cch nhau bi khong

trng v phi to thnh mt dy tng cht.
V d
D liu:
3 5
4 5 7 8 9
Kt qa
2
1
D liu:
4 3
7 14 15
Kt qa
2
1 2 4
D liu:
2 10
3 4 7 8 12 13 14 15 20 21
Kt qa
7
1 2
Qun m
Ngy:
20-03-2008
im:
1.3
M bi:
VKNIGHTS
S ngi gii c/
21 / 28
193

lm:
Loi bi:
oi
T l ng:
28.3%
Thi gian chy:
1s
Bi chy tt nht:
nt_d2 (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Polish OI 3
Hnh 1 m t mt qun m tn cng cc trn bn c vua.

Cho mt bn c vua c kch thc 3Xn, 3 hng v n ct, trong 1 n 100, v mt tp gm Z . Cc
dng c nh s 1 n 3 t trn xung di, cc ct c nh s 1 n n t tri sang phi.
Cc qun m khng c t trn cc thuc tp Z. Khng c hai qun m no c tn cng ln nhau. Gi
s mi ct c nhiu nht mt thuc tp Z. Khi , tp Z c th m t bi dy k1, k2,... ,kn vi ki thuc {0,
1, 2, 3}. Nu ki=0, khng c no trn ct i thuc tp Z, trong cc trng hp cn li, ki l ch s dng ca
trn ct ny thuc tp Z.
Yu cu
Cho bit s ct n ca bn c v dy m t tp Z, hy tm s nhiu nht qun m M c th t sao cho tha
mn cc iu kin nu, v L, s cch t M qun m ln bn c.
D liu
Dng u tin cha s nguyn dng n 100, l s ct trn bn c.
Mi dng trong s n dng tip theo cha mt s thuc tp {0, 1, 2, 3}, l dy m t tp Z.
Kt qu
In ra hai s nguyn M v L cch nhau bi khong trng.
V d
D liu
2
1
0
Kt qu
4 2
Tng ng ha hai t
Ngy:
20-03-2008
im:
1.8
194

M bi:
VWORDS
S ngi gii c/
lm:
5/7
Loi bi:
oi
T l ng:
62.4%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Polish OI 3
Cho hai t x, y v mt dy hu hn cc t (w1, w2, ..., wk).

Php ton p * q mang ngha l php ni t p vi t q, hay ni cch khc p * q l mt t mi to thnh bng
cch vit t q pha sau t p. Ta cn kim tra xem hai t x, y c th tng ng ha bng cch s dng cc
t trong dy cho trc khng.
V d: T abba v ab c th tng ng ha bng cch s dng cc t trong dy: baaabad aa badccaa cc.
Ta cn ni vo t abba cc t: aa v badccaa, v ni vo t ab cc t baaabad, cc v aa theo th t. Trong c
hai trng hp, ta s thu c cng mt t: abbaaabadccaa.
Yu cu
Cho bit t x, t y v dy t w1, w2, ..., wk. Cho bit t x v y c th tng ng ha bng cch s dng
cc t trong dy cho trc c hay khng? Nu c th, hy tm s lng nh nht php ton * cn s dng.
D liu
Dng u tin cha mt s nguyn dng k 40.
Dng th hai v dng th ba m t t x v y.
K dng tip theo m t dy t w1, w2, ..., wk, mi t trn mt dng.
M t ca mi t cha mt s nguyn cho bit di ca t, theo sau bi khong trng v mt chui

th hin t .
Mi t ch bao gm cc ch ci Latin in thng v c di khng vt qu 2000.
Tng di cc t khng vt qu 5000.
Kt qu
Nu khng tn ti li gii, in ra 'NIE'.
Nu tn ti li gii, in ra mt s nguyn dng, l s lng nh nht cc php ton * cn tng

ng ha hai t x v y.
V d
D liu
4
195

4 abba
2 ab
7 baaabad
2 aa
7 badccaa
2 cc
Kt qu
5
D liu
4
1 a
2 ab
2 bb
2 ab
2 ba
2 aa
Kt qu
NIE
Ro Vn
Ngy:
20-03-2008
im:
1.8
M bi:
RAOVUON
S ngi gii c/
lm:
4/5
Loi bi:
acm
T l ng:
50.0%
Thi gian chy:
2s
Bi chy tt nht:
- 0.22s)
Gii hn m ngun:
10000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
(none)
Bn Minh c l ch mt vn cy n qu ln min Nam. Nu nhn t trn cao xung, cc gc cy ging

nh cc im trn mt phng ta l mt t. nhiu nm ri, bn Minh c khng c bi thu do nn
o tc. Do vy, nm ngoi bn Minh c quyt tm ro khu vn ca mnh li. lm c iu ny, bn
Minh c chng ng ro theo cc gc cy to thnh mt a gic bao kn vn cy. Do tnh keo kit v
chi ph ca ng ro l rt t, bn Minh c tnh ton chi li ng ro c chu vi nh nht c th.
Chc cc bn cng bit y l bi ton tin c bn : tm bao li nh nht ca mt tp im. Tuy nhin, nm
nay bn Minh c cng khng thu hoch c thm nhiu. L do l c mt s cy ng bin ca hng
ro vn khng thot khi bn tay ca o tc. Nm nay bn Minh c quyt xy dng li hng ro cho
khng cn cy no nm ng bin na. lm c iu ny, thay v chng ng ro theo cc gc cy,
196

bn Minh c s chng ng ro theo cc ct st c sn trong vn. V tr ca cc cy v ct st r,
nhng xy dng lm sao hng ro c chu vi nh nht vn l vn nan gii. Bn hy gip bn Minh c
gii quyt bi ton kh trn v cng chia s mt v ma bi thu.
Input
Dng u l s N ( N <= 100 ). L s cy trong vn.
N dng sau, mi dng ghi 2 s l ta ca mt cy trong vn.
Dng tip theo l s M ( M <= 100 ). L s ct st trong vn.
M dng sau, mi dng ghi 2 s l ta ca mt ct st.
Cc ta u l s nguyn trong khong -10000..10000.
Output
In ra mt s duy nht l di nh nht ca hng ro vi ng 2 ch s sau du chm thp phn ( c lm
trn ). D liu lun m bo c t nht 1 cch xy hng ro tha mn.
Example
Input:
1
0 2
3
-2 0
2 0
0 4
Output:
12.94
Gii bng
Ngy:
21-03-2008
im:
0.7
M bi:
NKLEAGUE
S ngi gii c/
lm:
79 / 118
Loi bi:
oi
T l ng:
19.9%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Ng Minh c /
vCoder08
197

Mt gii thi u bng gm n i thi u vng trn mt lt. Cc i bng c nh s th t t 1 n n.
Theo th l gii u, nu trn u din ra vi kt qu ha, hai i s thi u lun lu cho n khi phn nh
thng thua (ngha l cc trn u u c phn nh thng thua).
Hi c tn ti mt cch sp xp cc i theo th t sao cho trong th t , mi i u thng trn u vi
i lin sau mnh? Trong trng hp tn ti, hy xc nh mt cch sp xp nh vy.
D liu
Dng u tin cha s nguyn n, s i bng tham d gii u. (1 n 1000).
Dng th i trong s n dng tip theo cha j k t 0 hoc 1, k t th j th hin gi tr aij :

o
aii = 0 vi mi i.
aij = 1 nu v ch nu i i thng i j. D liu vo lun tha mn aij+aji = 1 vi i khc j.
Kt qu
In ra -1 nu khng tn ti cch sp xp tha mn yu cu. Trong trng hp tn ti, in ra n s nguyn l ch
s ca cc i bng trong cch sp xp tm c.
Hn ch
C 30% s test c n 9.
V d
D liu Kt qu
3
010
000
3 1 2
110
Chm im
Ngy:
22-03-2008
im:
0.7
M bi:
V8SCORE
S ngi gii c/
lm:
81 / 111
Loi bi:
oi
T l ng:
30.1%
Thi gian chy:
1s
Bi chy tt nht:
quarterss (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Russian Training /
vCoder.08
198

C N v gim kho trong k thi chn i tuyn tin hc. K thi bao gm K bi. V gim kho th i ngh s
im ca bi j l Aij.
Hi ng gim kho mun xc nh s im cho mi bi sao cho:
Tng s im bng S.
im ca mi bi khng b hn im ca bi trc .
S im ca mi bi bng im ngh cho bi ny ca mt v gim kho no .
D liu
Dng u tin cha ba s nguyn S (1 S 200), (1 K 20), (1 N 20).
Dng th i trong s N dng tip theo cha K s nguyn, s th j cho bit gi tr Aij l s im v
gim kho th i ngh cho bi th j.
Kt qa
Nu tn ti mt cch cho im tha mn yu cu:

o
Dng th nht: in ra 'YES'.
Dng th hai: in ra K s nguyn l im ca mi bi tm c.
Nu khng tn ti cch cho im, in ra 'NO'.
V d
D liu Kt qu
100 3 2
30 20 40
50 30 50
YES
30 30 40
100 2 3
1 1
2 2
NO
3 3
Sp xp
Ngy:
22-03-2008
im:
1.0
M bi:
V8SORT
S ngi gii c/
lm:
39 / 51
Loi bi:
oi
T l ng:
38.9%
Thi gian chy:
1s
Bi chy tt nht:
congminh91 (100 im 0.08s)
199

Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Russian Training /
vCoder.08
Cho mt dy s. Bn cn sp xp dy s bng cch i ch cc cp phn t. Chi ph i ch phn t hai

v tr i v v tr j l Cij.
Nhim v ca bn l tm chi ph nh nht c th sp xp dy s theo th t tng dn.
D liu
Dng u tin cha dy s cn sp xp, c s phn t khng vt qu 7.
Dng th i trong s N dng tip theo cha N s nguyn, s th j cho bit Cij, chi ph i ch phn
t v tr th i v v tr th j. Bit N l s phn t ca dy s, cc phn t c nh s t 1 n N t
tri sang phi. 0 Cij 999, Cii=0 v Cij=Cji.
Kt qa
In ra mt s nguyn dng duy nht: tng chi ph nh nht sp xp dy s theo th t tng dn.
V d
D liu
Kt qu
1 2 3 4 6 5
0 1 2 3 4 5
1 0 1 2 3 4
2 1 0 1 2 3
3 2 1 0 1 2
4 3 2 1 0 900
5 4 3 2 900 0
T chc i lp
Ngy:
23-03-2008
im:
0.8
M bi:
V8ORG
S ngi gii c/
lm:
55 / 68
Loi bi:
oi
T l ng:
40.3%
Thi gian chy:
1s
Bi chy tt nht:
minhtrang (100 im 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Russian Training /
200

vCoder08
mt t nc n, lc lng an ninh va pht hin mt t chc i lp. T chc i lp ny c t chc
cht ch, bao gm mng li thnh vin v ch huy cc cp bc khc nhau. Cc thnh vin ca t chc
c nh s t 1 n N. T chc c mt ch huy ti cao, lun c nh s 1. Mi thnh vin ch bit vin
ch huy trc tip ca mnh (c duy nht mt vin ch huy trc tip) ch khng bit cc ch huy cp cao hn.
Khi tin hnh vic bt gi cc thnh vin, t chc s b phn r thnh cc nhm nh khng lin kt vi nhau,
v d sau khi bt gi thnh vin s 2 (hnh 1), t chc b phn r thnh 4 nhm. Lc lng an ninh khng
nh, mt nhm cha t hn K thnh vin s khng cn l mi e da cho t nc. khng lm gim hnh
nh ca t nc trc d lun quc t, cc nh lnh o an ninh mun bt gi mt s lng t nht phn t
i lp, sao cho cc nhm b phn r u khng cn gy nguy hi cho t nc.
Cho bit cu trc ca t chc i lp, vic chng trnh gip cc nh lnh o an ninh xc nh s lng
phn t i lp t nht cn bt gi.
D liu
Dng u tin cha s nguyn K (1 K 10000).
Dng th hai cha s nguyn N (1 N 10000).
Dng th ba cha N-1 s nguyn cch nhau bi khong trng, ch s ca ch huy trc tip ca mi
phn t ca t chc (tr ch huy ti cao): s u tin cho bit ch huy ca phn t th hai, s th hai
cho bit ch huy ca phn t th ba,...
Kt qa
In ra mt s nguyn duy nht l s phn t i lp t nht cn bt gi.
V d
D liu
Kt qu
M t
3
14
1 1 2 2 3 2 3 6 6 6 7 4 7
C th bt gi 4 phn t 6, 2, 7 v 8.
Hnh 1
201
Th trng
Ngy:
23-03-2008
im:
1.8
M bi:
V8MAYORS
S ngi gii c/
lm:
4/7
Loi bi:
oi
T l ng:
36.3%
Thi gian chy:
1s
Bi chy tt nht:
taek (100 im - 0.66s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Russian Training /
vCoder.08
Mt t nc c N thnh ph, v tr ca mi thnh ph c th hin bi mt im trn mt phng ta .

Tng thng va c c mun b nhim mi thnh ph mt th trng. Tng thng mun b nhim c cc th
trng nam v n. Vi mi ng thng ngang hoc dc (song song vi trc ta ), gi bnh ng gii
l tr tuyt i ca hiu gia s th trng nam v th trng n ca cc thnh ph nm trn ng thng .
chng t tinh thn bnh ng gii ca t nc, tng thng mun b nhim cc th trng sao cho tng
bnh ng gii i vi cc ng thng ngang v dc l nh nht.
Bn hy vit chng trnh gip tng thng thc hin nhim v ny.
D liu
Dng u tin cha N (1 N 20000), s thnh ph ca t nc.
Dng th i trong s N dng tip theo cha hai s nguyn xi, yi l ta ca thnh ph th i (xi, yi
thuc phm vi s nguyn 32 bit).
Kt qu
In ra N dng, dng th i cha s nguyn 0 hoc 1 tng ng vi vic cn b nhim th trng nam
hay n cho thnh ph.
V d
D liu Kt qu
5
0 0
0 1
1 0
1 1
1 2
0
1
1
0
0
202
Mng my tnh an ton

Ngy:
25-03-2008
im:
1.5
M bi:
SAFENET2
S ngi gii c/
lm:
15 / 19
Loi bi:
oi
T l ng:
28.3%
Thi gian chy:
1s
Bi chy tt nht:
anya (100 im - 0.28s)
Gii hn m ngun:
50000B
Ngi gi:
conankudo
Ngn ng cho php:
Tt c
Ngun bi:
Classical Problem
C n my tnh nh s t 1 n n v m dy cp mng,gia 2 my tnh c th c mt hoc nhiu ng dy

cp mng ni chng,khng c cp mng ni mt my vi chnh n.Hai my tnh c th truyn d liu cho
nhau nu c ng cp ni trc tip gia chng hoc truyn qua mt s my trung gian.
Mt tp S cc my tnh c gi l h thng an ton nu d mt my tnh bt k b tn cng (do s t m
ca ngi dn :-(,c thch truy cp v hack nhng trang cm :-( ) th trong s nhng my tnh cn li,nhng
my tnh thuc tp S vn c th truyn c d liu cho nhau. Xc nh s lng ln nht c th cc my
tnh ca tp S
Input
-Dng 1 cha 2 s nguyn n,m(1<=n<=30.000,0<=m<=100.000)
-m dng tip theo ghi thng tin v cc dy cp mng,gm 2 ch s ca 2 my c dy ni trc tip
Output
Ghi mt s nguyn duy nht l s lng my tnh ln nht tm c
Example
Input:
8 10
1 2
2 3
3 1
1 4
4 5
5 1
1 6
6 7
7 8
8 1
Output:
4
203
RIVER
Ngy:
26-03-2008
im:
1.2
M bi:
LEM
S ngi gii c/
lm:
24 / 63
Loi bi:
oi
T l ng:
11.0%
Thi gian chy:
0.100s-0.800s
Bi chy tt nht:
toan (100 im - 0.54s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
L Huy Bnh
Do nh v trng ca Zone nm hai bn b ca mt con sng nn hng ngy cu phi i qua sng i
hc. Zone cm thy rng hnh trnh ca ng li l khng ti u v Zone mun tm ra mt ng i tt
hn.
Sau khi quan st v o c, Zone c th biu din c con sng bng cch ch ra 2 b ca n. Mi b sng
s c biu din bng 1 ng gp khc v c xc nh bng ta ca cc im trn ng gp khc
nh sau:
ng gp khc biu din b pha ng ca sng c N im, im th i c ta (xi, yi).
ng gp khc biu din b pha Ty ca sng c M im, im th j c ta (uj, vj).
Bit rng 2 b sng khng c im chung v yi < yi+1 vi mi 1 i < N v vj < vj+1 vi mi 1 j < M.
Bn hy tm 2 im A v B sao cho A nm trn b ng ca con sng v B nm trn b Ty ca con sng
v khong cch AB l nh nht.
Input
- Dng u ghi 2 s nguyn dng N v M.
- Dng th i trong N dng tip theo ghi 2 s nguyn xi, yi.
- Dng th j trong M dng tip theo ghi 2 s nguyn uj, vj.
Output
- Gm 1 dng duy nht ghi khong cch ngn nht tm c
( Cc s thc c ghi vi chnh xc 3 ch s sau du phy )
Example
Input:
204

3 4
4 0
3 2
5 4
0 0
2 2
1 3
2 5
Output:
1.000
Gii hn
2 M, N 1000
|xi|, |yi|, |uj|, |vj| 10000
S ph thuc
Ngy:
26-03-2008
im:
1.3
M bi:
SUMS
S ngi gii c/
lm:
21 / 47
Loi bi:
acm
T l ng:
14.2%
Thi gian chy:
5s
Bi chy tt nht:
namkhanh (100 im 2.64s)
Gii hn m ngun:
50000B
Ngi gi:
aukcwe
Ngn ng cho php:
C C++ PAS gpc PAS fpc Ngun bi:
Polish Olympiad in
Infomatics 2003
Cho tp s nguyn A gm n phn t, A={a1, a2,..., an}. S k c gi l ph thuc vo tp A, nu k c

to thnh bng cch cng cc phn t ca tp A(mi phn t c th cng nhiu ln).
V d cho A={2,5,7}. Cc s nh 2, 4(2+2), 12(5+7 hoc 2+2+2+2+2) c gi l ph thuc vo tp A. S
0 cng gi l ph thuc vo tp A.
Yu cu:
Cho mt dy B, hy kim tra xem bi c phi l s ph thuc vo tp A hay khng .
D liu:
Dng u tin cha s nguyn n (1 n 5000).
205
N dng tip theo cha cc phn t ca tp A, a1 < a2 < ... < an (1 ai 50000 ).
Dng th N+2 cha s nguyn m (1 m 10000 ).
M dng tip theo cha dy s nguyn b1, b2, ..., bm (0 bi 1000000000 ).
Kt qu:
Gm m dng, dng th i ghi ra TAK nu bi l s ph thuc vo tp A v NIE nu khng phi l s ph
thuc.
V d:
D liu :
3
2
5
7
6
0
1
4
12
3
2
Kt qu :
TAK
NIE
TAK
TAK
NIE
TAK
COIN
Ngy:
26-03-2008
im:
1.4
M bi:
LEM1
S ngi gii c/
lm:
18 / 28
Loi bi:
oi
T l ng:
21.5%
Thi gian chy:
1s
Bi chy tt nht:
ththanh (100 im 206

0.53s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Cho N ng xu c bn knh ln lt l cc s thc dng r1.. rN. c t xung quanh mt vng trn sao
cho:
Mi ng xu tip xc vi 2 ng xu t cnh n v tip xc vi vng trn.
Bit c bn knh ca tng ng xu. Yu cu: Tm bn knh vng trn
Input
Dng u ghi s nguyn dng N
Dng tip theo ghi N s ri ( 1 i N )
Output
Gm 1 dng duy nht ghi bn knh hnh trn ( chnh xc n 3 ch s sau du phy )
Example
Input:
4
2 2 2 2
Output:
0.828
Gii hn
1 N 10000
1 ri 100000
Tr chi di chuyn con tt

Ngy:
27-03-2008
im:
1.4
M bi:
PBCWAYS
S ngi gii c/
lm:
18 / 24
Loi bi:
oi
T l ng:
11.9%
Thi gian chy:
1s
Bi chy tt nht:
vdmedragon (100 im -
207

0.02s)
Gii hn m ngun:
50000B
Ngi gi:
Ngn ng cho php:

Ngun bi:
JAVA C#
naruto238
Su tm.
Cho mt bng hnh ch nht c chia ra thnh NxM vung(gm N dng v M ct). Mt con tt sau mt
nc i c th di chuyn t 1 ct ny sang 1 ct k tip. i vi mi vung, cho bit s hiu cc
ct k tip m con tt c th di chuyn n sau 1 nc i. Con tt khng th di chuyn n n i qua
trc . Thot u con tt c t mt no ca ct th nht. Sau n di chuyn v pha ct cui
cng. Khi con tt n ct cui cng, ngi ta li t n vo mt no ct u tin m trc n cha
h t n v tip tc di chuyn.
Tr chi kt thc khi khng th thc hin nc i.
Yu cu
Xc nh xem c th thc hin nhiu nht bao nhiu ln di chuyn con tt t ct u tin n ct cui cng.
Input
Dng u tin cha 2 s nguyn dng N,M(1<=N<=50,1<=M<=10).
Tip theo l M-1 nhm dng, mi nhm gm N dng, m t kh nng di chuyn ca con tt t mi ca
bng. Dng th i ca nhm dng j m t kh nng di chuyn ca con tt t dng i ct j ca bng bao
gm: S u tin cho bit kh nng di chuyn, tip theo l to dng ca cc trong ct k tip m con tt
c th di chuyn sang(cc to c lit k theo th t tng dn).
Output
Gm 1 dng duy nht l kt qu bi ton.
Example
Input
4 3
2 1 3
3 1 2 4
0
2 2 3
1 2
1 2
1 3
2 2 4
Output
3
208

Ghi ch: Trong v d c th thc hin nhiu nht 3 ln con tt t ct u tin n ct cui cng. Chng hn:
(1->3->3; 2->4->4; 4->2->2).
Ni im
Ngy:
27-03-2008
im:
1.4
M bi:
PBCPOINT
S ngi gii c/
lm:
18 / 26
Loi bi:
oi
T l ng:
24.4%
Thi gian chy:
1s-3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
naruto238
Ngn ng cho php:

Ngun bi:
JAVA C#
Su tm.
Trn mt phng to xt cc im c to nguyn. C N im mu . bnta2 bt u tr chi nh sau:

vi 2 im mu cng dng hay cng ct, ni 2 im bng 1 on thng, cc im c to nguyn
nm trn on thng s c t . bnta2 c lm nh vy cho n khi khng c thm im no na.
Tnh xem c bao nhiu im khi kt thc tr chi.
Input
Dng 1: cha s nguyn dng N, N<=10^5.
Dng th i trong N dng tip theo: cha 2 s c gi tr tuyt i khng qu 10^3 l to ca 1 im

. Hai im khc nhau th c to khc nhau.
Output
Gm 1 dng duy nht l s im cui cng.
Example
Input
4
0 2
3 1
1 4
4 4
Output
12
209
GUMBI
Ngy:
27-03-2008
im:
1.1
M bi:
LEM2
S ngi gii c/
lm:
31 / 59
Loi bi:
oi
T l ng:
17.9%
Thi gian chy:
0.100s-1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Mt TV c N phm bm nh s 1..N. Trc y TV cn tt, khi n 1 phm xung mi phm khc u tt v

ch c phm va n l bt. By gi TV c, khi n 1 phm,ch c 1 s phm khc tt(nu n ang bt), cc
phm khc khng i
Mt phm d ang bt hay tt khi ta n n th phm ny s bt. Cc phm b n tc ng s tt nu ang bt.
Bn c cho bit kt qu bm ca mi phm v 1 hin trng ca cc phm. Hy tm 1 dy bm lin tip 1 s
t nht phm sao cho cui cng ch cn li phm K, 1 <= K <= N, l bt cc phm cn li u tt.
Input
- Gm 1 test duy nht:
- Dng u l 2 s nguyn N, K ( 3 N 20 )
- N dng tip theo, dng th i:
* u tin l s S ( s phm m phm i tc ng ) . Tip theo S s l dy phm m phm i tc ng khi bt n
- Dng cui l N s 0 or 1 m t hin trng bn phm ang tt or bt
Output
- Gm 1 s nguyn duy nht l s ln bm phm t nht. Nu ko c p n ghi ra -1
Example
Input:
3 3
2 2 3
2 1 3
2 1 2
1 1 0
210

Output:
1
Input:
4 3
3 2 3 4
1 1
1 1
0
0 1 0 1
Output:
2
Password
Ngy:
29-03-2008
im:
1.7
M bi:
PASSWORD
S ngi gii c/
lm:
7 / 12
Loi bi:
oi
T l ng:
20.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Thi vng 2 - 2008
Cho mt xu S c di khng vt qu 2000. Tm mt xu con T (khng cn lin tip) c di chn ca

xu S c di ln nht, v tha mn:
T[1]=T[l]
T[2]<>T[l-1]
T[3]=T[l-2]
...
Vi l l di ca xu T.
Nu c nhiu xu cng tha mn, hy in ra xu c th t t in nh nht.
Input
Dng u tin: n, di ca xu S.
211
Dng th hai: xu S.
Output
Gm 1 dng duy nht cha xu T
Example
Input:
6
window
Output:
wdow
Dy ngoc bc P
Ngy:
31-03-2008
im:
1.9
M bi:
VNBRACK
S ngi gii c/
lm:
2/8
Loi bi:
oi
T l ng:
18.5%
Thi gian chy:
1s-2s
Bi chy tt nht:
absyl90 (100 im - 0s)
Gii hn m ngun:
10000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
Thi vng 2 - 2008
Xt nh ngha 1 dy ngoc ng:

- Nu A khng c k t no th A l dy ngoc ng
- Nu A l dy ngoc ng th (A) l dy ngoc ng
- Nu A v B l 2 dy ngoc ng th AB l dy ngoc ng
Ta gi bc ca dy ngoc ng S l hm deg(S). Gi R l dy ngoc thu c bng cch xa i N div 2 k
t u v N div 2 k t cui ca S, trong 2*N l di ca S. Ta c cng thc quy tnh deg(S) nh
sau:
- Nu R khng phi dy ngoc ng th deg(S) = 1
- Nu R l dy ngoc ng th deg(S) = deg(R)+1
V d dy (()()) c bc l 2, dy ()(()) c bc l 1, dy (()) c bc ln v cng ( p dng v hn ln cng thc
quy trn ).
Yu cu: Xt cch dy ngoc c di 2*N v bc P, hy in ra dy ngoc c th t t in th K.
Input
Gm mt dng duy nht ghi ra 3 s N, P, K.
212
Output
Gm mt dng duy nht ghi ra dy ngoc tm c.
Example
Input:
3 1 2
Output:
()(())
Gii thch: c 3 dy ngoc di 6 v bc 1 l: (())(), ()(()), ()()().

Gii hn:
- 1 <= N <= 40, 1 <= P <= 6, K nguyn dng khng vt qu 10^18 v khng vt qu s lng dy
ngoc di 2*N bc P.
- K t '(' c th t t in nh hn k t ')'
Mo
Ngy:
01-04-2008
im:
2.0
M bi:
MEO
S ngi gii c/
lm:
0 / 57
Loi bi:
oi
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
anphunl (50 im - 0.09s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
vnoi.info
C mt vng trn n mo. Mo trng, , v xanh l cy. Khi tr chuyn vi nhau, hai mo khc mu ng
thi thnh mu th ba.
Mi lt, mo ng cnh nhau tr chuyn theo th t: mt v hai, hai v ba, ba v bn,... ,n v mt.
Yu cu
Cho bit mu ban u ca mo, hi mu ca mo sau k lt.
D liu
Dng 1: n, k (1 n &le 10000, 1 k 30000).
Dng 2: dy n k t, k t th i l 'R','G', hoc 'W' cho bit mu ca mo i tng ng: , xanh hoc
trng.
213
Kt qu
In ra dy n k t cho bit mu ca mo sau k lt.
Hn ch
C 50% s tests c 1 n &le 1000, 1 k 3000.
V d
D liu
3 1
GRR
Kt qu
RGR
Gii thch: lt 1: GRR -> WWR -> WGG -> RGR.
D liu
5 4
WRWRW
Kt qu
GGGWG
Help Conan !
Ngy:
01-04-2008
im:
0.8
M bi:
PAIRVIS
S ngi gii c/
lm:
63 / 93
Loi bi:
oi
T l ng:
16.3%
Thi gian chy:
0.300s-0.319s
Bi chy tt nht:
superman12 (100 im 0.86s)
Gii hn m ngun:
50000B
Ngi gi:
conankudo
Ngn ng cho php:
Tt c
Ngun bi:
bit !
Trong mt bui chiu p tri,Conan ang ngi code bi.Cu t nh :"Vt v c tun ri hm nay i chi
mt ngy cho ".
Ni l lm,cu ly $$ ri phi ra hng KFC n 2 sut combo 1 (kh tht,do ny Combo 1 ln gi,53.000 mt
sut,i sang khoai ty Jumbo li cn thm 8000 na ch,chm ngi ta qu :-( ),n xong cu quyt nh ln
214

Megastar xem phim (dn chi khng s ma ri m =)) ).Ln n ni,Conan chong vng v nhn thy cnh
xp hng mua v di dng dc.Ch mi m khng n lt,Conan lin ngh ra mt bi ton rt th v cc
VCoder nh sau :C N ngi xp hng mua v ng trc Conan,mi ngi c chiu cao l a_i,nhim v
ca cc bn l m s cp ngi nhn thy nhau,ngi u v v nhn thy nhau khi v ch khi gia u v v
khng c ai cao hn u hoc cao hn v ,vi li ha,bn no gii c s c Conan khao 1/2 gi khoai ty
Jumbo (20.000 /gi y,khng r u :)) )
Ch :Bi ny O(N) l thut ton chun,O(NLogN) hoc O(N^2) m c 100 im chng qua l
may mn Accept thi.M 100 th no c,O(N) ci khng kho cn TLE na l :))
B test va c cp nht,ln ny s gii hn thi gian rt cht,cc bn hy s dng mi th thut
c th AC c :)
Input
-Dng u tin cha s nguyn N(1<=N<=500.000) l s ngi ng trc Conan
-Mi dng trong s n dng tip theo cha chiu cao ca mt ngi(a_i<=2.10^9)
Output
Mt s nguyn duy nht l s cp ngi nhn thy nhau
Ch
Cc bn khng cn phi thc mc cc chi tit kiu nh : Sao li c n 500.000 ngi hay l chiu cao ca
mi ngi nh hn hoc bng 2 t u nh =)) =)).M gi KFC Combo1 mi ln gi, bi c update =))
Example
Input:
7
2
4
1
2
2
5
1
Output:
10
Help Conan ! (version 3)

Ngy:
01-04-2008
im:
1.6
M bi:
LSPITO
S ngi gii c/
11 / 17
215

lm:
Loi bi:
oi
T l ng:
25.8%
Thi gian chy:
1s
Bi chy tt nht:
phaleq (100 im - 0.19s)
Gii hn m ngun:
50000B
Ngi gi:
tikiupi
Ngn ng cho php:
C C++ PAS gpc PAS fpc Ngun bi:
Conan gi l v i trong giang h IOITRAIN. Hn i mnh v i, Conan quyt nh ra tay gc kim,

i v chi bi vi my a con nt. Nhng v tu luyn thnh cng chiu thc n Ch Thn Cng nn Conan
cng khng h c i th trong tr chi bn bi. Conan thng ht tt c bi ca my a con nt cng xm.
Khng ai cn bi chi tip vi Conan c. V th Conan quyt nh ngao du thin h, hy vng s tm c
i th tng xng. Nhng ri cc cao th c ting nh Taek, Kaiel, Andorea... u ln lt tht bi di
tay ca Conan. Qu bun, Conan ngi khc. V bt li hin ln hi: "Conan, v sao con khc? a no n
mt sut KFC ca con ?". Conan thnh tht k li s tnh cho bt. Bt ni: "ng nn ch, vn cn 1 cao
th n mnh. Con hy c tm i! Ta i y....". Nghe bt ni th Conan hm h tip tc ln ng. Trn
ng i Conan gp Thu Uyn, mt c nng xinh p tuyt trn, li v cng hin du v m ang. em
lng yu Thu Uyn, Conan quyn mt mc ch ca mnh, c ngy eo ui Thu Uyn. Nhng tht khng
ng Conan pht hin ra Thu Uyn li chnh l cao th n mnh m Bt nhc n. D lng au nh ct
nh Conan vn quyt nh u mt trn sinh t vi Thu Uyn.
Do l mt trn u gia 2 cao th nn lut chi c thay i so vi tr bn bi thng thng: c th bn mt
lc nhiu vin bi nhng khng c qu cn bc 2 ca s bi ang c. V do c 2 u rt gii nn s ko c
chuyn bn bi ra ngoi l. Do th ngi thng cuc s l ngi bn vin bi cui cng. S bi ban u l k. V
ang nm gi mt s b mt quan trng ca Thu Uyn nn Conan ginh quyn i trc. Th nhng Thu
Uyn s chn s bi ban u. C 2 u thi u ht mnh, lun chn cch chi ti u. Conan rt mun bit
trc ai s l ngi thng cuc v trn quyt u din ra trong thi gian rt lu. Bn hy gip Conan, anh ta
s ni cho bn bit b mt ca Thu Uyn.
Input
Gm nhiu dng, mi dng gm 1 s k <= 10^12 l s lng bi ban u.
Output
Ghi ra ngi thng cuc tng ng vi mi s k trn 1 dng. Nu Conan thng in ra 'Conan', ngc li in ra
'Thu Uyen'.
Example
Input:
3
5
7
Output:
Conan
Thu Uyen
216

Conan
Chat chit
Ngy:
01-04-2008
im:
0.7
M bi:
CHATCHIT
S ngi gii c/
lm:
83 / 113
Loi bi:
oi
T l ng:
29.8%
Thi gian chy:
1s
Bi chy tt nht:
ktuan (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
vnoi.info
Sau khi tri qua k thi chn i tuyn Quc t y cng thng, cc vCoders quyt nh tm gc nim am
m tin hc ca mnh mt thi gian i tm nhng nim vui mi. Mt s quyt nh i Hng Kng ngh mt
b li nhng ngy hc hnh vt v. S khc quay li trng hc. Nhng c bit, c mt s vCoders sau
nhng bui chat m i n quyt nh: dng kin thc tin hc ca mnh gp phn gi gn s trong sng
ca ting Vit. Nhm quyt nh ly tn l vitko (Viet-Coder) mi ngi thc c cng vic thm
lng h ang lm.
Nhn thy rng ngn ng chat ting Vit b lm dng qu nhiu, cc vitkos suy ngh v tm mt thut
ton dch t ngn ng chat tr li ting Vit. D liu vo s l mt cu chat (gm cc ch ci latin in
thng v khng du). Thut ton ca cc vitkos gm mt s quy tc c p dng theo th t vo cu vn.
Cc quy tc ny da trn hai thao tc c bn:
R(p)=q: thay tt c cc chui con p bng chui con q trong cu vn.
RW(p)=q: thay tt c cc t p bng t q trong cu vn.
Cc quy tc c p dng ln lt theo th t nh sau:
RW('k')='khong'
RW('ko')='khong'
RW('ng')='nguoi'
RW('n')='nhieu'
RW('dc')='duoc'
RW('hok')='khong'
RW('ntn')='nhu the nao'
RW('kq')='ket qua'
R('j')='gi'
R('w')='qu'
R('f')='ph'
217
R('dz')='d'
R('z')='d'
Mc d y l nhng quy tc rt n gin, tuy nhin chng cng gip cc vitkos cng mt khi nhn vo
cc on chat! Hy gip cc vitkos ci t thut ton ny. H s dng chng trnh ca bn vit mt
plugin cho Yahoo Messenger :)
D liu
Gm mt dng duy nht cha mt cu chat vitko va nhn c. Cu chat c di khng vt qu 255 k
t, ch gm cc k t latin in thng, khong trng v cc du cu. Cc t c cch nhau ng mt khong
trng.
Kt qu
In ra mt dng l cu chat c dch theo thut ton trn.
V d
D liu
chan wa. jo den luc co kq cha mun lam bai j nua :(
Kt qu
chan qua. gio den luc co ket qua cha mun lam bai gi nua :(
Hin cc vitkos quyt nh pht trin hiu qu hn thut ton ca mnh!
Conan Needs Help Again (Help Conan 4 )!

Ngy:
01-04-2008
im:
1.9
M bi:
CONANSP
S ngi gii c/
lm:
3/3
Loi bi:
oi
T l ng:
40.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
conankudo
Ngn ng cho php:
Tt c
Ngun bi:
bit ^o^
Li ni sau trn u vi Thu Uyn,Conan ginh chin thng v phn thng ca anh l 100 im trn
ioitrain v mt chuyn i du lch Hawai ( cn bn Thu Uyn cng rn chi nn t cc hi cao qu :))
=)),gi ch c ngm ngi thi ) . Conan vi vng ln ng khng qun mang theo 10 sut KFC Combo 1 (
v nghe ni Hawai khng bn KFC =))=)) )
218

Hawai l mt hn o gia i dng bao la. Trn hn o c cc h v trn nhng h ny li c nhng hn
o nh m trn c th c h m trn c th c nhng hn o nh na v tng t. i dng c
bc l 0, Hawai c bc 1. H trn Hawai c bc 2. Nh vy, mt h c bc w+1 nu n trn hn o c
bc w v mt o c bc j+1 nu n nm trn h c bc j. Tt c cc h v o c bin l a gic khng t
ct vi cc cnh lin tip vung gc vi nhau (// vi trc OX hoc OY) v nh c ta nguyn. Tt nhin
cc ng bin ca h hay o khng ct nhau. Conan vn thch s yn tnh nn cu mun bit ni no c
bc cao nht. Yu cu tnh bc cao nht ca o hay h Hawai.
Input
Dng u ghi n, l s ng gii hn (1 <= n <= 40000). Cc ng bin c m t trong cc dng tip
theo, mi dng mt ng bin. S u tin trong mi dng ghi s chn k l s im to nn ng bin,
4 <= k <= 10000. Tip theo l k s x1, x2, , xk, 0 <= xi <= 10^8. Cc im to nn ng bin l (x1, x2),
(x3, x2), (x3, x4) , (xk-1, xk), (x1, xk). Cc im ny c t trong ta Cc v ngc chiu kim
ng h. Cc ng bin c in theo th t tha mn ng bin ca mi h c in sau ng bin hn
o cha n v ng bin ca mi hn o c in sau ng bin ca h bao quanh n. Ch : khng cn
dng qu 200000 im m t bn .
Output
Dng duy nht ghi bc ln nht ca hn o hay h.
Example
Input:
6
4 1 0 17 12
16 10 4 16 11 2 4 8 2 3 3 2 1 16 3 15 2
8 8 10 3 5 12 8 11 6
6 10 9 15 10 9 7
4 4 6 7 9
4 6 8 5 7
Output:
5
TRIP
Ngy:
10-04-2008
im:
1.0
M bi:
LEM3
S ngi gii c/
lm:
42 / 91
Loi bi:
oi
T l ng:
9.2%
Thi gian chy:
0.5s
Bi chy tt nht:
ktuan (100 im - 0.2s)
219

Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
V Khnh Trung
Trong k ngh h nm nay sherry c b thng cho 1 tour du lch quanh N t nc ti p vi nhiu
thng cnh ni ting ( v sherry rt ngoan m ^^ ). Tt nhin sherry s i bng my bay :D
Gi v my bay t t nc i n t nc j l Cij ( d nhin Cij c th khc Cji ). Tuy c b thng cho
nhiu tin i du lch nhng sherry cng mun tm cho mnh 1 hnh trnh vi chi ph r nht c th
dnh tin mua qu v tng mi ngi ^^ ( Cc chuyn bay ca sherry u c m bo an ton tuyt i ).
Bn hy gip sherry tm 1 hnh trnh i qua tt c cc nc, mi nc ng 1 ln sao cho chi ph l b nht
nh !!!
Input
Dng 1: N (5 < N < 16)
Dng th i trong N dng tip theo: Gm N s nguyn, s th j l Cij (0 < Cij < 10001)
Output
Gm 1 dng duy nht ghi chi ph b nht tm c
Example
Input:
6
0 1 2 1 3 4
5 0 3 2 3 4
4 1 0 2 1 2
4 2 5 0 4 3
2 5 3 5 0 2
5 4 3 3 1 0
Output:
8
WHITE BLACK
Ngy:
10-04-2008
im:
1.1
M bi:
LEM4
S ngi gii c/
lm:
31 / 52
Loi bi:
oi
T l ng:
29.3%
220

Thi gian chy:
1s
Bi chy tt nht:
nt_d2 (100 im - 2.06s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
VOI
Hi cn b sherry thng chi vi b 1 tr chi c tn gi l White Black :D

B c 1 mnh giy HCN tht di c 1 x N chia thnh N vung b dn thnh hng ngang. Ban u vung
no cng c mu trng. Quy tc chi s l mi bc b c th t mu 1 on cc vung t L n R
cng 1 mu ( c th l mu en hoc mu trng ) 1 lc sau t giy s c rt nhiu en trng an xen nhau
v cu hi ca b dnh cho sherry l c bao nhiu vung mu trng lin tip ( sao cho s lng cc ny
l nhiu nht )
sherry cng thng minh lm nn hm no cng thng ( tuy nhin sherry chi hi chm 1 cht ^^ ) Sao bn
khng th tham gia tr chi ny nh :D
Input
Dng 1: N (1 <= N <= 10000)
Dng 2: M (1 <= M <= 100000) ( tng s ln t mu v s ln b sherry )
M dng tip theo: Mi dng c dng:
1 L R (1 <= L <= R <= N) t cc vung t L -> R mu trng
2 L R (1 <= L <= R <= N) t cc vung t L -> R mu en
3 m s lng mu trng lin tip di nht
Output
Gm 1 s dng tng ng vi cc cu tr li ca sherry cho cu hi ca b
Example
Input:
6
7
2 1 2
2 4 5
3
1 3 4
3
1 1 1
3
Output:
221

1
2
2
ARITHMETIC PROGRESSION
Ngy:
11-04-2008
im:
1.4
M bi:
LEM5
S ngi gii c/
lm:
19 / 64
Loi bi:
oi
T l ng:
5.6%
Thi gian chy:
5s
Bi chy tt nht:
lyxuansang91 (100 im 3.67s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
VOI
Cho 1 dy gm N s nguyn Ai. Mt cp s cng l 1 dy con B ca dy A tho mn: Bi = Bi-1 + D ( D l

cng sai & 1 <= D <= 100 )
Yu cu: Bn hy tm 1 cp s cng di nht
Input
Dng 1: N ( 1 <= N <= 105 )
N dng tip theo: dng th i l s nguyn Ai ( |Ai| <= 109 )
Output
Gm 1 dng duy nht l s phn t ca cp s cng di nht tm c
Example
Input:
10
1
10
3
20
5
30
7
9
40
222

11
Output:
6
BIRTHDAY
Ngy:
16-04-2008
im:
0.9
M bi:
LEM6
S ngi gii c/
lm:
49 / 76
Loi bi:
oi
T l ng:
12.5%
Thi gian chy:
1s
Bi chy tt nht:
heo (100 im - 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
V Khnh Trung
Ch nm nay na thi l sherry s tt nghip i Hc ri v th sherry mun sinh nht nm nay ca mnh s
tht ngha. V Sherry mi tt c bn ca mnh n d sinh nht ^^
Sherry t chc 1 tr chi nh cho tt c cc bn cng tham gia, sherry c 1 t giy HCN kch thc 1 x N v
M mnh nh hn, mnh giy th i c kch thc 1 x Ai. by gi sherry cc bn ca mnh c bao nhiu
cch t cc mnh giy nh theo th t t 1 n M vo mnh giy 1 x N sao cho mi mnh giy cch nhau t
nht 1 vung ( Nu i < j th mnh giy th i s c t nm trc mnh giy th j ). Sherry ha s tng 1
mn qu c bit cho bn no tr li nhanh nht :D
Input
Dng 1: N, M ( 1 <= N <= 1000, 1 <= M <= N/2 )
Dng 2: Gm M s, s th i l Ai
Output
Gm 1 dng duy nht l s cch tm c
Example
Input:
4 2
1 1
Output:
3
223
Bc Palindrome
Ngy:
19-04-2008
im:
1.7
M bi:
LSPALIN
S ngi gii c/
lm:
7 / 11
Loi bi:
oi
T l ng:
20.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
tikiupi
Ngn ng cho php:

Ngun bi:
PAS fpc
Khng r
Palindrome l xu c t tri qua phi ging nh c t phi qua tri, v d xu abba hoc madam.
Vi xu s bt k ngi ta xc nh php chia i k hiu l half(s) v nh ngha nh sau:
Nu s khng phi l palindrome th half(s) khng xc nh,
Nu s c di bng 1 th half(s) khng xc nh,
Nu s l palindrome di n th half(s) l xu k k t u ca s, trong k = (n+1) div 2.
V d, half(informatics) v half(i) l khng xc nh, half(abba) = ab, half(madam) =mad.
Bc palindrome (ta s gi ngn gn l bc) ca xu s l s ln ti a c th p dng php chia i m kt qu
vn xc nh. V d, cc xu informatics v i c bc bng 0 v khng th p dng php chia i mt ln
no, cc xu abba, madam c bc bng 1, cn xu totottotot c bc bng 3: totottotot -> totot -> tot
-> to. Yu cu: Xt tt c cc xu di n ch cha cc ch ci la tinh thng v c bc palindrome bng
p. Hy xc nh xu th k theo th t t in (1 n 200, 0 p 8, 1 k 10^9). D liu m bo tn ti
xu cn tm.
Input
Gm mt dng duy nht cha 3 s n, p, k.
Output
In ra xu tm c
Example
Input:
4 1 1
Output:
abba
Input:
224

10 3 490
Output:
totottotot
Input:
5 0 6597777
Output:
olymp
Brainfck Nhp xut

Ngy:
20-04-2008
im:
0.5
M bi:
VBF1
S ngi gii c/
lm:
109 / 116
Loi bi:
oi
T l ng:
58.2%
Thi gian chy:
1s
Bi chy tt nht:
lionking10 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
BF
Ngun bi:
vnoi.info
Nhp mt chui c khng qu 100 k t. Hy in ra chui . (Bit k t kt thc file - EOF c gi tr bng 1).
D liu
Gm mt dng duy nht cha chui k t.
Kt qu
In ra mt dng duy nht l chui k t nhp vo.
V d
D liu
Bonjour Vietnam!
Kt qu
Bonjour Vietnam!
225
Brainfck Ch d
Ngy:
20-04-2008
im:
0.6
M bi:
VBF2
S ngi gii c/
lm:
105 / 111
Loi bi:
oi
T l ng:
48.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
30B
Ngi gi:
paulmcvn
Ngn ng cho php:
BF
Ngun bi:
vnoi.info
Khng c d liu vo.
Kt qu
In ra mt ch ci duy nht: ch d (in thng).
Hn ch
M ngun khng qu 30 bytes.
a gic
Ngy:
27-04-2008
im:
1.2
M bi:
NKPOLI
S ngi gii c/
lm:
26 / 28
Loi bi:
oi
T l ng:
63.3%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Croatian OI 2001
C N im trn mt phng vi ta l cc s t nhin. Mt a gic li nhiu nh nht l mt a gic li

c cc nh l gc ta v mt s nh trong cc im cho, v c s nh l nhiu nht. im gc,
ngha l im c ta (0, 0), phi l mt trong cc nh ca a gic li nhiu nh nht.
Vit chng trnh xc nh s nh ca a gic ny.
Mt a gic l li nu mi on thng c u mt nm trong a gic u nm hon ton trong a gic .
226

Cc cnh lin tip ca mt a gic khng c php song song vi nhau.
D liu
Dng u tin cha s t nhin N, 2 N 100, s im c cho.
Mi dng trong s N dng tip theo cha 2 s t nhin X, Y, 1 X 100, 1 Y 100 cch nhau
bi khong trng, cho bit ta ca mt im. Cc im u phn bit nhau.
Kt qa
In ra mt s nguyn duy nht l s nh ca a gic li nhiu nh nht.
Lu : kt qu lun khng nh hn 3.
V d
D liu:
5
4 2
2 2
2 3
3 2
3 1
Kt qa
4
D liu:
8
10 8
3 9
2 8
2 3
9 2
9 10
10 3
8 10
Kt qa
8
D liu:
10
9 6
1 7
227

2 2
3 9
8 7
3 2
9 4
3 1
9 7
6 9
Kt qu:
7
Tch t
Ngy:
27-04-2008
im:
1.0
M bi:
NKSEV
S ngi gii c/
lm:
40 / 53
Loi bi:
oi
T l ng:
32.7%
Thi gian chy:
3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Croatian OI 2006
Mt t cn c tch thnh cc on con sao cho mi on con thuc mt tp cc t cho trc.

Vit chng trnh xc nh s cch tch mt t cho trc.
Do kt qu c th c gi tr ln, ch cn in ra phn d ca kt qu cho 1337377.
D liu
Dng u tin cha mt t vi ti a 300000 k t.
Dng th hai cha s nguyn N, 1 N 4000.
Mi dng trong s N dng tip theo cha mt t trong tp cc t. Mi t c di khng qu 100 k

t. Khng c hai t no ging nhau. Tt c cc k t u l ch ci Latin in thng.
Kt qa
In ra mt s nguyn duy nht l phn d ca s cch tch t khi chia cho 1337377.
V d
228

D liu:
abcd
4
a
b
cd
ab
Kt qa
2
D liu:
afrikapaprika
4
afr
ika
pap
r
Kt qa
1
D liu:
ababababababababababababababababababababab
3
a
b
ab
Kt qa
759775
Ngi a th
Ngy:
27-04-2008
im:
1.4
M bi:
NKPOS
S ngi gii c/
lm:
17 / 20
Loi bi:
oi
T l ng:
48.2%
Thi gian chy:
1s
Bi chy tt nht:
khanhptnk (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
229

Ngn ng cho php:
Tt c
Ngun bi:
Baltic OI 2001
Mt bu t vng qu cn chuyn th cho ngi dn cc ngi lng cng nh trn cc con ng ni

gia cc ngi lng. Bn cn gip bu t tm hnh trnh i qua mi ngi lng v mi con ng t nht mt
ln (d liu vo m bo mt hnh trnh nh vy tn ti). Tuy nhin, mi hnh trnh cn c gn vi mt
chi ph. Ngi dn cc ngi lng u mun bu t n lng mnh cng sm cng tt. V vy mi ngi lng
tha thun vi bu in, nu lng i l lng th k phn bit c thm trn hnh trnh v k wi, lng i s
tr wi k euros cho bu in. Nu k > wi , bu in ng tr k - wi euros cho ngi lng. Ngoi ra, bu in
cn tr bu t mt euro khi i qua mi con ng trn hnh trnh.
C n ngi lng, c nh s t 1 n n. Bu in c t ngi lng s mt, do hnh trnh cn bt u
v kt thc ti ngi lng ny. Mi ngi lng c t giao im ca hai, bn, hoc tm con ng. C th
c nhiu ng ni gia hai ngi lng. Con ng c th l mt vng ni mt ngi lng vi chnh n.
Yu cu: Vit chng trnh xc nh mt hnh trnh i qua mi ngi lng v mi con ng t nht mt ln,
sao cho tng li nhun ca bu in l ln nht (hay tng thit hi l b nht).
D liu
Dng u tin cha 2 s nguyn n, m, cch nhau bi khong trng; n (1 n 200), l s ngi lng
v m l s con ng.
Mi dng trong s n dng sau cha mt s nguyn dng. Dng th i+1 cha s wi, 0 wi 1000,
xc nh chi ph c tr bi lng i.
Mi dng trong s m dng sau cha hai s nguyn dng cch nhau bi khong trng, m t mt
con ng ni hai ngi lng.
Kt qa
Dng u tin cha s nguyn dng k, di ca hnh trnh.
Dng th hai theo cha k+1 s cho bit cc ngi lng c thm theo th t trn hnh trnh, cch
nhau bi khong trng, trong v1=vk+1=1.
V d
D liu:
6 7
1
7
4
10
20
5
2 4
1 5
2 1
4 5
230

3 6
1 6
1 3
Kt qa
7
1 5 4 2 1 6 3 1
Mnh t t tin
Ngy:
27-04-2008
im:
1.3
M bi:
NKLAND
S ngi gii c/
lm:
23 / 46
Loi bi:
oi
T l ng:
15.3%
Thi gian chy:
1s
Bi chy tt nht:
huhuhu (100 im 0.11s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
vnoi.info
Bm sng trn mnh t t tin li t xa xa. Tuy nhin, tri qua bao i, mnh t ca Bm ngy nay c
th b thay i v tr, thm ch cn c th khng giao vi mnh t ca t tin! Mt ngy n, Bm pht
hin tm bn m t hnh dng mnh t ca t tin. Bm mun xc nh xem mnh t ngy nay v
mnh t t tin c cn giao nhau hay khng!
Yu cu: Bit mnh t ngy nay ca Bm v mnh t ca t tin u c hnh dng a gic li. Hy gip
Bm xc nh 2 mnh t c giao nhau (ngha l c phn din tch chung) hay khng.
D liu
Dng u tin cha s nguyn t, cho bit s lng test (t 10). t nhm dng tip theo m t cc test, mi
test c dng nh sau:
Dng u tin cha s nguyn m, s nh ca a gic li miu t mnh t ca Bm.
Dng th 2 cha 2m s nguyn cho bit ta cc nh ca mnh t ca Bm. Cc nh c lit

k theo chiu kim ng h.
Dng th 3 cha s nguyn n, s nh ca a gic li miu t mnh t ca t tin.
Dng th 4 cha 2n s nguyn cho bit ta cc nh ca mnh t ca t tin Bm. Cc nh

c lit k theo chiu kim ng h.
Kt qa
231

Gm t dng, mi dng ghi ra YES / NO nu 2 mnh t giao nhau / khng giao nhau trong test tng
ng.
Gii hn
3 m, n 1000
Ta cc nh c gi tr tuyt i khng vt qu 1000000000.
C 50% s test m trong cc s m,n u c gi tr khng vt qu 100.
V d
D liu:
2
3
-6 3 -11 11 -10 6
3
-4 0 -3 5 -7 3
3
-3 4 -3 11 -6 9
3
0 -2 1 0 -2 -1
Kt qa
YES
NO
Lung cc i trn mng

Ngy:
27-04-2008
im:
0.6
M bi:
NKFLOW
S ngi gii c/
lm:
90 / 125
Loi bi:
oi
T l ng:
29.7%
Thi gian chy:
3s
Bi chy tt nht:
jangnara (100 im 0.58s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Trong l thuyt th, mng lung l mt th c hng, trong mi cnh c mt thng qua v mt
gi tr lung. Lng lung trn mi cnh khng c vt qu thng qua ca cnh . Lng lung i
vo mt nh phi bng lng lung i ra khi n, tr khi l nh ngun (c nhiu lng lung i ra
hn), hay nh ch (c nhiu lng lung i vo hn). Mng lung c th dng m hnh ha h thng
232

ng giao thng, dng chy ca cht lng trong ng, dng in trong mch, hay bt k cc bi ton no
tng t khi c s di chuyn trong mt mng cc nt.
M hnh cc ng dn nc bng mt mng lung. Mi ng nc c ng knh xc nh nn ch cho php
mt lu lng nc xc nh chy qua. ni giao im gia cc ng, lu lng nc i vo phi bng lu
lng nc i ra nu khng nc s nhanh chng b tht thot. Ta c mt bn nc, hay nh pht, v mt
vi nc, hay nh thu. Mt cch trc quan, gi tr lung trn mng chnh l vn tc nc chy ra t vi.
Lung cn c th m hnh s lu chuyn ca ngi hay hng ha trn cc mng giao thng, dng in trong
h thng phn phi,... i vi cc h thng mng ny, lung i vo cc nt trung gian cn phi bng lung
i ra khi nt . Tnh cht ny cng ging nh nh lut dng in Kirchhoff. Mng lung cn c ng
dng trong sinh thi hc: mng lung xut hin khi xem xt s lu chuyn cht dinh dng v nng lng
gia cc nhm khc nhau trong mt mng thc n. Cc bi ton gn vi loi mng sinh thi ny hon ton
khc vi trng hp mng cht lng hay mng giao thng.
Bi ton lung cc i trn mng yu cu tm mt lung tng thch c gi tr ln nht trong mng lung c
mt nh pht v mt nh thu. Bi ton lung cc i trn mng c th xem nh trng hp c bit ca
lp cc bi ton mng phc tp hn, chng hng nh bi ton lu thng. nh l lung cc i-lt ct hp
nht (max-flow min-cut theorem) ch ra gi tr lung cc i t s n t (nh pht n nh thu) bng gi tr
ca lt ct s-t hp nht trn mng.
Bn hy th gii quyt bi ton lung cc i trn mng: cho mt mng lung, hy tm gi tr lung cc i.
D liu
Dng u tin cha 4 s nguyn dng n, m, s, t, (2 n 1000) tng ng l s nh, s cnh ca

th, ch s ca nh pht v nh thu.
m dng tip theo, mi dng c dng ba s u, v, c cch nhau t nht mt du cch th hin c cung u,
v trong mng vi kh nng thng qua l c (1 c 106).
Kt qa
In ra mt s duy nht l gi tr ca lung cc i trn mng.
V d
D liu:
6 8 1 6
1 2 5
1 3 5
2 4 6
2 5 3
3 4 3
3 5 1
4 6 6
5 6 6
Kt qa
9
233
Cp ghp cc i trn th hai pha

Ngy:
27-04-2008
im:
0.6
M bi:
NKBM
S ngi gii c/
lm:
101 / 111
Loi bi:
oi
T l ng:
45.2%
Thi gian chy:
3s
Bi chy tt nht:
mr_hh (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Trong l thuyt th, mt cp ghp hay tp cnh c lp ca mt th l mt tp cc cnh khng c nh

chung. Bi ton ghp cp thng c quan tm trong trng hp th hai pha. th n v hng
G=(V,E) l mt th hai pha nu nh tn ti mt cch phn hoch tp inh V thnh hai tp V1, V2 sao cho
mi cnh thuc E u c dng v1v2 vi v1 thuc V1, v2 thuc V2. Mt v d l bi ton sp xp cng vic.
Gi s c P ngi v J cng vic, mi ngi c th lm mt s cng vic no . Ta m hnh bi ton bng
mt th hai pha vi P+J nh. Nu ngi pi c th lm cng vic ji th c mt cnh gia hai nh pi v ji
trn th.
Tm mt cp ghp cc i (cn c gi l cp ghp c lc lng ln nht) trn mt th hai pha
G=(V=(X,Y), E) l mt bi ton quen thuc v n gin trong l thuyt th. nh l Konig ch ra rng
trong mt th hai pha, kch thc ca cp ghp cc i bng kch thc ca ph nh nh nht. T kt
qu ny, bi ton ph nh nh nht v bi ton tp c lp ln nht trn th hai pha c th gii c
trong thi gian a thc.
Bn hy th gii quyt bi ton tm cp ghp cc i trn th hai pha: cho bit th hai pha
G=(V=(X,Y), E), hy tm cp ghp cc i (c nhiu cnh nht).
D liu
Dng u tin cha hai s x, y, m (x, y 1000), theo th t l s nh thuc tp X, tp Y ca th

v s cnh ni.
m dng tip theo mi dng ghi hai s i, j cch nhau bi mt du cch th hin c cnh ni gia hai
nh xi, yj.
Kt qa
In ra kch thc ca cp ghp cc i.
V d
D liu:
4 5 9
1 1
234

1 4
2 1
2 2
2 4
3 2
3 3
4 2
4 3
Kt qa
4
Lp lch gim thiu tr hn

Ngy:
27-04-2008
im:
1.2
M bi:
NKTARDY
S ngi gii c/
lm:
26 / 45
Loi bi:
oi
T l ng:
15.9%
Thi gian chy:
2s
Bi chy tt nht:
overtherainbow (100
im - 1.66s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
C n cng vic nh s t 1 n n v mt my thc hin chng. Bit:
pi l thi gian cn thit hon thnh cng vic i.
di l thi hn hon thnh cng vic i.
My bt u hot ng t thi im 0. Mi cng vic cn c thc hin lin tc t lc bt u cho ti khi

kt thc, khng cho php ngt qung. Gi s ci l thi im hon thnh cng vic i. Khi , nu ci > di ta ni
cng vic i b hon thnh tr hn, cn nu ci di th ta ni cng vic i c hon thnh ng hn.
Yu cu: Tm trnh t thc hin cc cng vic sao cho s cng vic hon thnh tr hn l t nht.
D liu
Dng u tin cha s nguyn dng n (0 < n 100000).
Dng th hai cha n s nguyn dng p1, p2, ..., pn (0 < pi 10000).
Dng th ba cha n s nguyn dng d1, d2, ..., dn (0 < di 10000).
Kt qu
235
Dng u tin ghi s lng cng vic b hon thnh tr hn theo trnh t tm c.
Dng tip theo ghi n s nguyn dng l ch s ca cc cng vic theo trnh t thc hin tm c.
Hn ch
C 50% s test c n 100.
V d
D liu
6
2 4 1 2 3 1
3 5 6 6 7 8
Kt qu
2
1 3 4 6 2 5
Closest distance
Ngy:
02-05-2008
im:
1.9
M bi:
GANNHAT
S ngi gii c/
lm:
3 / 10
Loi bi:
acm
T l ng:
12.5%
Thi gian chy:
1s-3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
aukcwe
Ngn ng cho php:
C++ PAS gpc PAS fpc

JAVA
Ngun bi:
Mr Taek
Khong cch Manhattan gia 2 im A(x1,y1) v B(x2,y2) c nh ngha nh sau:

D(A,B) = |x1 - x2| + |y1 - y2|
Cho N im A1, A2, ..., AN trn mt phng, vi mi im Ai ta cn tm D(Ai , Aj) nh nht vi j i.
D liu
Dng u ghi s nguyn dng N (1 N 200000).
N dng sau dng th i ghi 2 s x v y l ta ca im th i. (0 x , y 107)
Kt qu
236
Gm N dng, dng th i ghi khong cch nh nht cn tm i vi im th i.
V d
D liu:
4
0 0
0 1
1 0
1 1
Kt qu:
1
1
1
1
Phn nhm
Ngy:
08-05-2008
im:
1.7
M bi:
GROUP
S ngi gii c/
lm:
8 / 26
Loi bi:
acm
T l ng:
20.0%
Thi gian chy:
1s-5s
Bi chy tt nht:
taek (100 im - 1.34s)
Gii hn m ngun:
50000B
Ngi gi:
aukcwe
Ngn ng cho php:
C++ PAS gpc PAS fpc

JAVA
Ngun bi:
USACO MAR08
Cho n<=300000 cp s (x,y) (1<=x, y<=1000000). Ta c th nhm mt vi cp s li thnh mt nhm. Gi

s mt nhm gm cc cp s th a1, a2, ..., am th chi ph cho nhm ny s l max(xa1, xa2, ..., xam) *
max(ya1, ya2, ..., yam).
Yu cu: tm cch phn nhm c tng chi ph b nht.
D liu
Dng u tin l s nguyn dng N.
N dng tip theo dng th i ghi 2 s xi v yi.
Kt qu
Gm 1 s duy nht l kt qu tm c.
237
V d
D liu:
4
100 1
15 15
20 5
1 100
Kt qu:
500
Gii thch:
C 3 nhm ln lt l (1), (2,3) v (4).
Thm kch nng trang

Ngy:
24-05-2008
im:
1.7
M bi:
VCRISIS
S ngi gii c/
lm:
6/7
Loi bi:
oi
T l ng:
50.0%
Thi gian chy:
1s
Bi chy tt nht:
buihaduong (100 im 0.15s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO US-Open 2008 Bng Vng
Nng dn John v n b ngc nghch ca ng ta ang tp luyn cho v nhc kch mi, "The Street Cow
Named Desire". Ti mt thi im trong lc din tp, n b ca John chng ln nhau thnh N (1 <= N <=
1,000) ct, mi ct c 30 con, con n ng ln lng con kia (my con b ny tht th v). V th m trn
ng c cc ct b ny coi nh l cc nh v bn cnh cn c M (1 <= M <= 1,000) l cc ng c
kh.
Di y l v d v mt ng c :
8 .........
7 ....CH.H.
C = ct 30 con b
6 .........
5 .........
H = ng c kh
4 ..C.HH...
238

3 .........
2 .....C.HH
1 .........
123456789
L ngi ch o bui nhc kch, John c 4 ci ci vi 4 m thanh khc nhau. Mt ci ci s ra lnh cho tt
c cc con b di cng ca mi ct b di chuyn ( tt c cc con b ct tt nhin cng b di chuyn
theo )v pha bc 1 n v, ci khc li ra lnh cho di chuyn v pha nam, 1 ci v pha ng v ci cn li
v hng ty.
Mi ln cc ct b i vo mt m c c kh, con b trn cng ca ct b ( k c nu ct b ch cn mi
mt con ) s nhy vo ng c kh trong khi s cn li s tip tc di chuyn vo c ng c . V vy,
nu con b di cng m i qua 30 ng c kh ( cc ng c c th khc nhau hoc khng khc nhau )
th ct b s ht sch b. Gi s rng cc ng c kh c sc chu ng l khng gii hn, bao nhiu b
trn cng c.
Nng dn John lic qua ng c ca mnh nhn v pha khu vt sa b ca nng dn Don v kinh hong khi
thy mt thng cha sa khng l b n tung, sa trn ra ngoi thnh mt cn l sa v n ang trn v
pha cc con b ca John. Cc con b trn cc ng c kh th s an ton, John cn phi lm tt c cu
c nhiu con b nht c th bng cch s dng cc ci ci ra lnh cho n b.
Cho s nguyn K ( 1 <= K <= 30 ) l s giy John c th thi ci cho n khi l sa p ti v cc ta
X_i, Y_i (1 <= X_i <= 1,000; 1 <= Y_i <= 1,000) ca N ct b v M ng c kh ( trn cc ng c kh
hin thi cha c con b no ), hy cho bit s lng ln nht b c th cu c v trnh t thi ci ra sao.
Trnh t thi ci s l mt xu k t bao gm 4 loi k t tng ng vi 4 hng, E l hng ng, N l
hng Bc, W l hng Ty, S l pha Nam. Trong tt c cc trnh t tho mn th ghi ra trnh t c th
t t in nh nht.
V tr lc u ca cc con b v cc ng c l khc nhau.
Cc con b c th di chuyn ti bt k v tr no, k c ra ngoi cnh ng.
D liu
Dng 1: 3 s nguyn cch nhau bi du cch: N, M, v K
Dng 2..N+1: Dng i+1 m t ta X,Y ca 1 ct b bng 2 s nguyn cch nhau bi du cch:
X_i v Y_i
Dng N+2..N+M+1: Dng i+N+1 m t ta X,Y ca mt ng c kh bng 2 s nguyn cch

nhau bi du cch: X_i and Y_i
Kt qu
Dng 1: Mt s nguyn cho bit s lng nhiu nht b c th cu c.
Dng 2: K k t, trnh t ra lnh c th t t in nh nht m John c th thc hin nhm cu c

nhiu con b nht.
V d
239

D liu
3 6 3
3 4
6 2
5 7
8 2
9 2
6 4
5 4
6 7
8 7
Kt qu
6
EEE
Gii thch
S dng ci ng 3 ln, lc m cn l sa trn n th mi ng c cu c 1 con b.
Vng hng xm b
Ngy:
24-05-2008
im:
2.0
M bi:
VNABOR
S ngi gii c/
lm:
1 / 11
Loi bi:
oi
T l ng:
3.6%
Thi gian chy:
1s
Bi chy tt nht:
nkvuong (100 im 7.38s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO US-Open 2008 Bng Vng
Nhng ngi-bit-v-b nhn ra cch m cc con b nhm li thnh cc vng hng xm b. H

quan st N (1 <= N <= 100,000) con b ca nng dn John ( tin ta s nh s cc con b t 1..N) khi
chng i n c, ta ca cc con b l khc nhau v l cc s nguyn, coi ng c l hnh ch nht c cc
ta X v Y trong khong 1..1,000,000,000.
Hai con b l hng xm nu c 1 trong 2 iu kin sau:
1. Khong cch Manhattan ca cc con b khng ln hn 1 s nguyn C cho trc (1 <= C <=
1,000,000,000). [Khong cch Manhattan tnh nh sau: d = |x1-x2| + |y1-y2|.]
240

2. Nu b A l hng xm ca b Z v b B cng l hng xm ca b Z th b A v b B cng l hng
xm.
Mt vng hng xm b l mt tp cc con b l hng xm ca nhau v khng l hng xm ca bt k con
b no khc ngoi tp ny. Cho v tr ca cc con b v khong cch C, xc nh s vng hng xm b v
vng c nhiu b nht.
V d nh hnh bn di l ng c. Vi C = 4, ng c ny c 4 vng hng xm b: 1 vng ln bn
tri, 2 vng nh c kch thc 1 (cc con b c n), v mt vng rt ln bn phi vi 60 con b.
.....................................*.................
....*...*..*.......................***.................
......*...........................****.................
..*....*..*.......................*...*.******.*.*.....
........................*.............***...***...*....
*..*..*...*..........................*..*...*..*...*...
.....................................*..*...*..*.......
.....................................*..*...*..*.......
...*................*..................................
.*..*............................*.*.*.*.*.*.*.*.*.*.*.
.*.....*..........................*.*.*.*.*.*.*.*.*.*.*
....*..................................................
D liu t tp tin input s m t cc ta bng cc s nguyn X, Y vi v tr gc tri di l (1,1) v cc

con b gn gc ny nm v tr (2,2) v (5,1) trong v d trn.
Hnh trn l test v d s 2, test ny s dng nh gi bi np ca bn.
Mt phn kt qu ca mt s test v d s c thng bo 10 ln np u tin.
D liu
Dng 1: 2 s nguyn cch nhau bi du cch: N v C
Dng 2..N+1: Dng i+1 m t v tr ca con b th i gm 2 s nguyn cch nhau bi du cch: X_i
v Y_i
Kt qu
Dng 1: 2 s nguyn cch nhau bi du cch tng ng l s vng hng xm b v s lng b

vng ln nht.
V d
D liu
4 2
1 1
241

3 3
2 2
10 10
Kt qu
2 3
Gii thch
C 2 vng b, mt vng l 3 con b u tin v vng th 2 l cc con b cn li. Vng ln nht c 3 con b.
Bi c ngon nht
Ngy:
24-05-2008
im:
0.4
M bi:
VBGRASS
S ngi gii c/
lm:
144 / 156
Loi bi:
oi
T l ng:
52.7%
Thi gian chy:
1s
Bi chy tt nht:
iamtoi (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO US-Open 2008 Bng ng
Bessie d nh c ngy s nhai c xun v ngm nhn cnh xun trn cnh ng ca nng dn John, cnh
ng ny c chia thnh cc vung nh vi R (1 <= R <= 100) hng v C (1 <= C <= 100) ct. Bessie
c g c th m c s khm c trn cnh ng.
Mi khm c trn bn c nh du bng mt k t # hoc l 2 k t # nm k nhau (trn ng
cho th khng phi). Cho bn ca cnh ng, hy ni cho Bessie bit c bao nhiu khm c trn cnh
ng.
V d nh cnh ng di dy vi R=5 v C=6:
.#....
..#...
..#..#
...##.
.#....
Cnh ng ny c 5 khm c: mt khm hng u tin, mt khm to bi hng th 2 v th 3 ct th 2,

mt khm l 1 k t nm ring r hng 3, mt khm to bi ct th 4 v th 5 hng 4, v mt khm cui
cng hng 5.
D liu
242
Dng 1: 2 s nguyn cch nhau bi du cch: R v C
Dng 2..R+1: Dng i+1 m t hng i ca cnh ng vi C k t, cc k t l # hoc . .
Kt qu
Dng 1: Mt s nguyn cho bit s lng khm c trn cnh ng.
V d
D liu
5 6
.#....
..#...
..#..#
...##.
.#....
Kt qu
5
i xem phim
Ngy:
24-05-2008
im:
0.4
M bi:
VCOWFLIX
S ngi gii c/
lm:
166 / 181
Loi bi:
oi
T l ng:
47.6%
Thi gian chy:
1s
Bi chy tt nht:
thelastking (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Nng dn John ang a cc con b ca anh ta i xem phim! Xe ti ca anh ta th c sc cha c hn thi,
l C (100 <= C <= 5000) kg, anh ta mun a 1 s con b i xem phim sao cho tng khi lng ca ng
b ny l ln nht, ng thi xe ti ca anh ta vn chu c.
Cho N (1 <= N <= 16) con b v khi lng W_i ca tng con, hy cho bit khi lng b ln nht m John
c th a i xem phim l bao nhiu.
D liu
Dng 1: 2 s nguyn cch nhau bi du cch: C v N
243
Dng 2..N+1: Dng i+1 cha 1 s nguyn: W_i
Kt qu
Dng 1: Mt s nguyn l tng khi lng b ln nht m John c th mang i xem phim.
V d
D liu
259 5
81
58
42
33
61
Kt qu
242
Gii thch
81+58+42+61 = 242; y l tng khi lng b ln nht c th c.
Nc lnh
Ngy:
24-05-2008
im:
0.5
M bi:
VCOLDWAT
S ngi gii c/
lm:
121 / 129
Loi bi:
oi
T l ng:
55.0%
Thi gian chy:
1s
Bi chy tt nht:
bt09 (100 im - 0.19s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Ma h oi Wisconsin khin cho l b phi i tm nc lm du i cn kht. Cc ng ng dn

nc ca nng dn John dn nc lnh vo 1 tp N (3 <= N <= 99999; N l) nhnh (nh s t 1..N) t
mt ci bm t chung b.
Khi nc lnh chy qua cc ng, sc nng ma h s lm nc m ln. Bessie mun tm ch c nc lnh
nht c b c th tn hng ma h mt cch thoi mi nht.
244

Bessie v s ton b cc nhnh ng nc v nhn ra rng n l mt th dng cy vi gc l chung
b v cc im nt ng th c chnh xc 2 nhnh con i ra t nt . Mt iu ngc nhin l cc nhnh ng
ny u c di l 1.
Cho bn cc ng nc, hy cho bit khong cch t chung b ti tt c cc nt ng v cc phn cui
ng ng.
Phn cui ca mt ng ng, c th l i vo mt nt ng hoc l b bt, c gi theo s th t ca
ng ng. Bn c C (1 <= C <= N) nt ng, c m t bng 3 s nguyn: l phn cui ca ng E_i
(1 <= E_i <= N) v 2 ng nhnh i ra t l B1_i v B2_i (2 <= B1_i <= N; 2 <= B2_i <= N). ng ng
s 1 ni vi chung b; khong cch t phn cui ca ng ng ny ti chung b l 1.
D liu
Dng 1: 2 s nguyn cch nhau bi du cch: N v C
Dng 2..C+1: Dng i+1 m t nt ng i vi ba S nguyn cch nhau bi du cch: E_i, B1_i, v
B2_i
Kt qu
Dng 1..N: Dng i cha 1 s nguyn l khong cch t chung ti phn cui ca ng th i.
V d
D liu
5 2
3 5 4
1 2 3
Gii thch:
D liu trn m t bn ng nc sau:
+--------+
| Chung |
+--------+
| 1
*
2 / \ 3
*
4 / \ 5
Kt qu
1
2
2
3
245

3
Gii thch:
ng 1 lun cch chung 1 on l 1. ng 2 v 3 ni vi ng
1 nn khong cch s l 2. ng 4 v 5 ni vi ng 3 nn
khong cch s l 3.
CENTRE
Ngy:
25-05-2008
im:
1.1
M bi:
CENTRE28
S ngi gii c/
lm:
31 / 54
Loi bi:
oi
T l ng:
18.3%
Thi gian chy:
1s
Bi chy tt nht:
linh0710 (100 im 0.67s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP4
Theo thng k cho bit mc tng trng kinh t ca nc Peace trong nm 2006 rt ng kh quan. C
nc c tng cng N thnh ph ln nh c nh s tun t t 1 n N pht trin kh ng u. Gia N
thnh ph ny l mt mng li gm M ng i hai chiu, mi tuyn ng ni 2 trong N thnh ph sao
cho khng c 2 thnh ph no c ni bi qu 1 tuyn ng. Trong N thnh ph ny th thnh ph 1 v
thnh ph N l 2 trung tm kinh t ln nht nc v h thng ng m bo lun c t nht mt cch i t
thnh ph 1 n thnh ph N.
Tuy nhin,c 2 trung tm ny u c du hiu qu ti v mt dn s. V vy, c vua Peaceful quyt nh
chn ra thm mt thnh ph na u t thnh mt trung tm kinh t th ba. Thnh ph ny s tm ngng
mi hot ng thng nht, cng nh mi lung lu thng ra vo tin hnh nng cp c s h tng.
Nhng trong thi gian sa cha y, phi bo m ng i ngn nht t thnh ph 1 n thnh ph N khng
b thay i, nu khng nn kinh t quc gia s b tr tr.
V tr v ng ni gia N thnh ph c m t nh mt th N nh M cnh. Hy gip nh vua m s
lng thnh ph c th chn lm trung tm kinh t th ba sao cho thnh ph c chn tha mn cc iu
kin trn
Input
Dng u tin ghi 2 s nguyn dng N v M l s thnh ph v s tuyn ng.
Dng th i trong s M dng tip theo ghi 3 s nguyn dng xi, yi v di vi ngha tuyn ng th i c
di di v ni gia 2 thnh ph xi, yi.
Output
Dng u tin ghi s t nhin S l s lng cc thnh ph c th chn lm trung tm kinh t th ba.
246

S dng tip theo, mi dng ghi 1 s nguyn dng l s th t ca thnh ph c chn ( In ra theo th t
tng dn )
Example
Input:
6 6
1 2 1
2 3 1
3 6 1
1 4 100
4 5 100
5 6 100
Output:
2
4
5
Gii hn
2 N 30000
1 M 100000
1 di 1000
KMIN
Ngy:
26-05-2008
im:
0.6
M bi:
KMIN
S ngi gii c/
lm:
94 / 123
Loi bi:
oi
T l ng:
25.5%
Thi gian chy:
1s
Bi chy tt nht:
mocthulan (100 im 1.16s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnamese Online
Problem Solving Contest
Cho 2 dy s nguyn A v B. Vi mi s A[i] thuc A v B[i] thuc B ngi ta tnh tng n. Tt c cc tng
ny sau khi c sp xp khng gim s to thnh dy C.
247

Nhim v ca bn l: Cho 2 dy A, B. Tm K s u tin trong dy C
Input
Dng u tin gm 3 s: M, N, K
M dng tip theo gm M s m t dy A
N dng tip theo gm N s m t dy B
Output
Gm K dng tng ng l K phn t u tin trong dy C
Example
Input:
4 4 6
1
2
3
4
2
3
4
5
Output:
3
4
4
5
5
5
Gii hn
1 M, N, K 50000
1 Ai, Bi 1000000000
Gm c
Ngy:
27-05-2008
im:
0.5
M bi:
VMUNCH
S ngi gii c/
125 / 141
248

lm:
Loi bi:
oi
T l ng:
34.7%
Thi gian chy:
1s
Bi chy tt nht:
kimgiang_92 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Bessie rt yu bi c ca mnh v thch th chy v chung b vo gi vt sa bui ti.

Bessie chia ng c ca mnh l 1 vng hnh ch nht thnh cc vung nh vi R (1 <= R <= 100)
hng v C (1 <= C <= 100) ct, ng thi nh du ch no l c v ch no l . Bessie ng v tr
R_b,C_b v mun n c theo cch ca mnh, tng vung mt v tr v chung 1,1 ; bn cnh
ng i ny phi l ngn nht.
Bessie c th i t 1 vung sang 4 vung khc k cnh.
Di y l mt bn v d [vi ('*'), c ('.'), chung b ('B'), v Bessie ('C') hng 5, ct 6] v mt
bn cho bit hnh trnh ti u ca Bessie, ng i c dnh du bng ch m.
Bn
1 2 3 4 5 6
ng i ti u
<-ct
1 2 3 4 5 6
1 B . . . * .
1 B m m m * .
2 . . * . . .
2 . . * m m m
3 . * * . * .
3 . * * . * m
4 . . * * * .
4 . . * * * m
5 * . . * . C
5 * . . * . m
<-ct
Bessie n c 9 c.
Cho bn , hy tnh xem c bao nhiu c m Bessie s n c trn con ng ngn nht tr v chung
(tt nhin trong chung khng c c u nn ng c tnh nh)
D liu
Dng 1: 2 s nguyn cch nhau bi du cch: R v C
Dng 2..R+1: Dng i+1 m t dng i vi C k t (v khng c du cch) nh ni trn.
Kt qu
Dng 1: Mt s nguyn l s c m Bessie n c trn hnh trnh ngn nht tr v chung.
V d
D liu
249

5 6
B...*.
..*...
.**.*.
..***.
*..*.C
Kt qu
9
Nhng con ng quanh nng trang

Ngy:
27-05-2008
im:
0.4
M bi:
VRATF
S ngi gii c/
lm:
150 / 157
Loi bi:
oi
T l ng:
57.1%
Thi gian chy:
1s
Bi chy tt nht:
lighthouse (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO US-Open 2008 Bng Bc
Cc con b ca nng dn John c s thch l hay i khm ph nhng vng xung quanh nng trang. Ban u,
tt c N (1 <= N <= 1,000,000,000) con b tp trung thnh 1 nhm v cng bt u chuyn i trn 1 con
ng. Cho ti khi gp mt ng ba ng th chng i khi chn cch chia lm 2 nhm nh hn ( mi nhm
t nht 1 b ) v mi nhm li tip tc hnh trnh trn con ng ca nhm chng. Khi mt trong nhng
nhm ny gp 1 ng ba khc th nhm ny li c th tch ra tip, v c nh vy.
Cc con b hnh thnh nn 1 quy tc v vic chia nhm nh sau: nu chng c th chia thnh 2 nhm m
chnh lch s b ca 2 nhm l ng bng K (1 <= K <= 1000) th ti ng ba chng s chia lm 2; nu
khng th chng s dng cuc hnh trnh v ng nhm nhp c non.
Gi s rng lun c nhng ng ba mi trn cc con ng, hy tnh xem cui cng c bao nhiu nhm b tt
c.
D liu
Dng 1: 2 s nguyn cch nhau bi du cch: N v K
Kt qu
Dng 1: Mt s nguyn cho bit s lng nhm b sau cng.
V d
250
D liu
6 2
Gii thch:
C 6 con b v chnh lch khi xt chia nhm l 2.
Kt qu
3
Gii thch:
Cui cng c 3 nhm b (1 nhm c 2 b, 1 nhm c 1 v 1 nhm c 3 ).
6
/ \
2
4
/ \
1
Xe t ca b
Ngy:
27-05-2008
im:
1.3
M bi:
VCOWCAR
S ngi gii c/
lm:
23 / 25
Loi bi:
oi
T l ng:
45.7%
Thi gian chy:
1s
Bi chy tt nht:
lionking10 (100 im 0.21s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
N (1 <= N <= 50,000) con b nh s t 1..N ang li trn cc chic xe khc nhau dc theo ng cao tc
X B. B i c th li bt k ln ng no trong s M (1 <= M <= N) ln ng cao tc v c th li xe
tc ti a l S_i (1 <= S_i <= 1,000,000) km/gi.
T kinh nghim ng xe kh nhiu, cc con b rt ght ng nhau v tin hnh cc o c trnh ng
nhau. Trn ng cao tc ny, b i s gim tc ca mnh i D (0<= D <= 5,000) km/gi nu c mt con
b ang i trc n (tt nhin l khng bao gi tc ca b i nh hn 0 km/gi c). Nh vy, nu c K
con b i trc b i th b i s i vi tc ti a l max[S_i - D * K, 0].
Nu mt con b i nhanh hn con b ngay pha trc n th m bo rng cc con b cch nhau xa
tai nn khng xy ra khi cc con b gim tc (nhng nu sau khi gim tc m b i sau vn phng
nhanh hn b i trc th s xy ra tai nn).
251

X b cng c mt iu lut v giao thng l tc ca b i trn ng cao tc ti thiu phi l L (1 <=
L <= 1,000,000) km/gi, bi vy m i khi vi con b s khng th tham gia giao thng v phi tun th
lut giao thng. Bn hy vit chng trnh tnh xem ti a c bao nhiu con b c th i trn ng cao tc
m vn tun th lut giao thng.
D liu
Dng 1: 4 s nguyn cch nhau bi du cch: N, M, D, v L
Dng 2..N+1: Dng i+1 m t tc ban u ca b i l 1 s nguyn: S_i
Kt qu
Dng 1: Mt s nguyn cho bit s lng b nhiu nht c th tham gia giao thng.
V d
D liu
3 1 1 5
5
7
5
Gii thch:
C 3 con b v ch c mt ln ng i, gim tc
l 1 km/gi v tc ti thiu phi t l 5 km/gi.
Kt qu
2
Gii thch:
Ti a 2 con b l tham gia giao thng c, cch chn
l chn 2 b u tin.
Sc mnh ca ngn t
Ngy:
27-05-2008
im:
1.3
M bi:
VWORDPOW
S ngi gii c/
lm:
23 / 73
Loi bi:
oi
T l ng:
14.2%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
252

Ngn ng cho php:
Tt c
Ngun bi:
Nng dn John mun nh gi cht lng cc ci tn m ng t cho N (1 <= N <= 1000) con b ca
mnh. Mi ci tn l mt xu k t c di khng qu 1000 k t v khng c k t no l k t trng (
du cch ).
John lp nn 1 tp M xu tt ( di khng qu 30 k t v hon ton khng c du cch ). Nu mt
xu tt l xu con ca tn 1 con b ( cc k t khng nht thit phi lin k nhau ) th tn con b c
cng 1 im cht lng.
Tt c cc xu l case-insensitive, tc l ch hoa v ch thng coi nh ging nhau. V d tn Bessie
cha cc xu Be, sI, EE, v Es ,... l xu con nhng khng cha is hay eB l xu con. Hy gip
nng dn John xc nh s lng im cht lng m tn ca mi con b c c.
D liu
Dng 1: 2 s nguyn cch nhau bi du cch: N v M
Dng 2..N+1: Dng i+1 cha 1 xu k t l tn ca con b th i.
Dng N+2..N+M+1: Dng N+i+1 cha xu tt th i.
Kt qu
Dng 1..N+1: Dng i+1 cha 1 s nguyn l im cht lng ca tn b th i.
V d
D liu
5 3
Bessie
Jonathan
Montgomery
Alicia
Angola
se
nGo
Ont
Gii thch:
C 5 con b, tn chng l Bessie, Jonathan, Montgomery, Alicia v Angola.
C 3 xu tt l se, nGo v Ont.
Kt qu
1
1
253

2
0
1
Gii thch:
"Bessie" c cha "se", "Jonathan" cha "Ont", "Montgomery" cha
c "nGo" v "Ont", Alicia khng cha xu tt no
v "Angola" cha "nGo".
Nguy him r rng trc mt

Ngy:
27-05-2008
im:
0.5
M bi:
VDANGER
S ngi gii c/
lm:
115 / 123
Loi bi:
oi
T l ng:
44.2%
Thi gian chy:
1s
Bi chy tt nht:
ronaldinho (100 im 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Nng dn John ang trn mt con thuyn nh v ang tm kim kho bu 1 trong s N (1 <= N <= 100)
hn o (nh s t 1..N) vng bin Ca-ri-b.
Bn kho bu cho John bit John cn phi thc hin 1 hnh trnh i qua o A_1, A_2, A_M (2 <= M
<= 10,000), bt u t o 1 v kt thc o N trc khi kho bu bin mt. Anh ta c th n thm cc
o khc v thm bao nhiu ln ty thch, min l hnh trnh ca ng ta phi cha dy A_1,..A_M l 1 dy
con (khng nht thit phi lin tip nhau).
John mun trnh ng cp bin v bit c mc--b-cp (0 <= mc--b-cp <= 100,000) khi i
li gia 2 hn o vi nhau. nguy him ca hnh trnh ca John s l tng cc mc--b-cp trn cc
tuyn ng m John i qua.
Hy gip John tm c 1 hnh trnh t nguy him nht c th ly c kho bu.
D liu
Dng 1: 2 s nguyn cch nhau bi du cch: N v M
Dng 2..M+1: Dng i+1 m t cha 1 s nguyn l o th i m John cn phi ti: A_i
Dng M+2..N+M+1: Dng i+M+1 cha N s nguyn cch nhau bi du cch tng ng l mc-b-cp trn tuyn ng i gia o i v o 1, 2,N; m bo s nguyn th i lun l s 0.
Kt qu
254
Dng 1: nguy him nh nht ca hnh trnh ca John.
V d
D liu
3 4
1
2
1
3
0 5 1
5 0 2
1 2 0
Gii thch:
C 3 hn o v bn kho bu yu cu John phi thc hin 1 hnh
trnh ti cc o nh sau: t o 1 ti o 2, quay li o 1 v cui
cng l ti o 3. Mc--b-cp trn cc tuyn ng c
cho: (1, 2); (2, 3); (3, 1) c ln tng ng l 5, 2 v 1.
Kt qu
7
Gii thch:
Hnh trnh c nguy him nh nht l 7. John s i nh sau:
1, 3, 2, 3, 1, and 3. Yu cu ca bn l phi cha dy
(1, 2, 1, v 3) v hnh trnh ny tha mn yu cu. Chng ta s trnh i
trn ng ni gia 2 o 1 v 2 v n c mc--b-cp ln.
Tng b phn
Ngy:
27-05-2008
im:
1.6
M bi:
VPARTSUM
S ngi gii c/
lm:
10 / 23
Loi bi:
oi
T l ng:
27.8%
Thi gian chy:
1s
Bi chy tt nht:
dhkhtn (100 im - 1.07s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Indian Computing
Olympiad, Online
Programming Contest,
255

July 06
Cho mt dy gm N (1 N 100000) s nguyn dng a1, a2, ..., an. Tng ai + ai+1 + ... + aj (1 i j N)
c gi l tng b phn t i n j ca dy s.
Cho hai s nguyn dng P v K (1 < P 109, 0 K < P). Hy tm tng b phn theo modulo P nh nht
khng b hn K.
V d, xt dy s sau:
12
13
15
11
16
26
11
y N=7, gi s K=2 v P=17, ta c kt qu l 2 v 11 + 16 + 26 = 53 v 53 mod 17 = 2. Nu K=0 ta c

kt qu bng 0 v 15 + 11 + 16 + 26 = 68 v 68 mod 17 = 0.
D liu
Dng 1: N, K, P.
Dng 2..n+1: a1, a2,... , aN, mi s trn mt dng.
Kt qu
In ra tng b phn theo modulo P nh nht khng b hn K.
V d
D liu
7 2 17
12
13
15
11
16
26
11
Kt qu
2
Ni Xch
Ngy:
11-06-2008
im:
0.6
M bi:
NOIXICH
S ngi gii c/
lm:
105 / 131
256

Loi bi:
oi
T l ng:
32.3%
Thi gian chy:
1s
Bi chy tt nht:
nt_d2 (100 im - 0.08s)
Gii hn m ngun:
50000B
Ngi gi:
soncbg
Ngn ng cho php:
Tt c
Ngun bi:
Su Tm
Ngi ta c N on dy xch(N <= 20000), mi on dy xch l chui cc mt xch c ni vi nhau. Cc

on dy xch ny tch ri nhau. Mi on mt xch c khng qu 20000 mt xch. Bng cch ct ra mt
mt xch, sau hn li, ta c th ni hai dy xch thnh mt on. Thi gian ct v hn mi mt xch l
1 n v thi gian v c xem l bng nhau vi mi mt xch. Nhim v ca bn l phi ni chng li
thnh mt on dy xch duy nht vi thi gian t nht( hay s mt xch b ct v hn li l t nht).
Input
D liu vo cho trong file vn bn c cu trc nh sau: Dng u tin l s N, s on xch. Nhng dng
tip theo ghi N s nguyn dng, s th i l s mt xch c trong on xch th i(i <= i <= N) Hai s cnh
nhau trn cng mt dng cch nhau t nht mt du cch.
Output
Mt dng duy nht l s n v thi gian m bn cn ni N on xch cho.
Example
Input:
3
2 3
4
Output:
2
Dy con di nht c tng chia ht cho K

Ngy:
11-06-2008
im:
0.5
M bi:
QBSEQ
S ngi gii c/
lm:
114 / 132
Loi bi:
acm
T l ng:
34.5%
Thi gian chy:
1s
Bi chy tt nht:
minhtrang (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
L Minh Hong
257

Cho mt dy gm n ( n <= 1000) s nguyn dng A1, A2, ..., An v s nguyn dng k (k <= 50). Hy tm
dy con gm nhiu phn t nht ca dy cho sao cho tng cc phn t ca dy con ny chia ht cho k.
Input
Dng u tin cha hai s n, k ghi cch nhau bi t nht 1 du trng.
Cc dng tip theo cha cc s A1, A2, ..., An c ghi theo ng th t cch nhau t nht mt du trng
hoc xung dng
Output
Gm 1 dng duy nht ghi s lng phn t ca dy con di nht tho mn
Example
Input:
10 3
2 3 5 7
9 6 12 7
11 15
Output:
9
ng i c tng ln nht
Ngy:
11-06-2008
im:
0.4
M bi:
QBMAX
S ngi gii c/
lm:
154 / 174
Loi bi:
acm
T l ng:
32.4%
Thi gian chy:
1s
Bi chy tt nht:
tungcitytia (100 im 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt bng A kch thc m x n (1 <= m, n <= 100), trn ghi cc s nguyn aij (|aij| <= 100). Mt ngi
xut pht ti no ca ct 1, cn sang ct n (ti no cng c).
Quy tc i: T (i, j) ch c quyn sang mt trong 3 (i, j + 1); (i - 1, j + 1); (i + 1, j + 1)
Input
258

Dng 1: Ghi hai s m, n l s hng v s ct ca bng.
M dng tip theo, dng th i ghi n s trn hng i ca bng theo ng th t t tri qua phi
Output
Gm 1 dng duy nht ghi tng ln nht tm c
Example
Input:
5 7
9 -2 6 2 1 3 4
0 -1 6 7 1 3 3
8 -2 8 2 5 3 2
1 -1 6 2 1 6 1
7 -2 6 2 1 3 7
Output:
41
Hon v ch ci
Ngy:
11-06-2008
im:
0.6
M bi:
QBHV
S ngi gii c/
lm:
95 / 105
Loi bi:
acm
T l ng:
50.2%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.06s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
L Minh Hong
Cho mt xu S ch gm cc ch ci in hoa, 1 <= di <= 9.

Yu cu:
1: C bao nhiu cch hon v cc ch ci ca xu S
2: Lit k cc hon v theo th t t in
Input
Gm 1 dng duy nht cha xu S
259
Output
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
Example
Input:
ABAB
Output:
6
AABB
ABAB
ABBA
BAAB
BABA
BBAA
Hng i c u tin
Ngy:
12-06-2008
im:
0.6
M bi:
QBHEAP
S ngi gii c/
lm:
102 / 120
Loi bi:
acm
T l ng:
24.2%
Thi gian chy:
1s
Bi chy tt nht:
hcmut (100 im - 0.24s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
L Minh Hong
Cho trc mt danh sch rng. Ngi ta xt hai thao tc trn danh sch :
Thao tc "+V" ( y V l mt s t nhin <= 1000000000): Nu danh sch ang c t hn 15000 phn t
th thao tc ny b sung thm phn t V vo danh sch; Nu khng, thao tc ny khng c hiu lc.
Thao tc "-": Nu danh sch ang khng rng th thao tc ny loi b tt c cc phn t ln nht ca danh
sch; Nu khng, thao tc ny khng c hiu lc
Input
Gm nhiu dng, mi dng ghi mt thao tc. Th t cc thao tc trn cc dng c lit k theo ng th t
s thc hin
260
Output
Dng 1: Ghi s lng nhng gi tr cn li trong danh sch.
Cc dng tip theo: Lit k nhng gi tr theo th t gim dn, mi dng 1 s
Example
Input:
+1
+3
+2
+3
+4
+4
+2
+9
+7
+8
Output:
4
8
7
2
1
Cc thng nc
Ngy:
12-06-2008
im:
0.6
M bi:
IOIBIN
S ngi gii c/
lm:
93 / 111
Loi bi:
acm
T l ng:
31.5%
Thi gian chy:
1s
Bi chy tt nht:
hcmut (100 im - 0.08s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP3
261

C N thng nc c nh s t 1 n N, gia 2 thng bt k u c mt ng ni c mt van c th kha
hoc m. trng thi ban u tt c cc van u ng.
Bn c cho mt s yu cu, trong mi yu cu c 2 dng:
Dng X Y 1 c ngha l bn cn m van ni gia 2 thng X v Y.
Dng X Y 2 c ngha l bn cn cho bit vi trng thi cc van ang m / kha nh hin ti th 2 thng X
v Y c thuc cng mt nhm bnh thng nhau hay khng? Hai thng c coi l thuc cng mt nhm
bnh thng nhau nu nc t bnh nyc th chy n c bnh kia qua mt s ng c van ang m.
Input
Dng u tin ghi mt s nguyn dng P l s yu cu.
Trong P dng tip theo, mi dng ghi ba s nguyn dng X, Y, Z vi ngha c yu cu loi Z vi 2 thng
X v Y.
Output
Vi mi yu cu dng X Y 2 (vi Z = 2) bn cn ghi ra s 0 hoc 1 trn 1 dng ty thuc 2 thng X v Y
khng thuc hoc thuc cng mt nhm bnh.
Example
Input:
9
1 2 2
1 2 1
3 7 2
2 3 1
1 3 2
2 4 2
1 4 1
3 4 2
1 7 2
Output:
0
0
1
0
1
0
Gii hn
262
1 N 10000
1 P 50000
Cy khung nh nht ( HEAP )

Ngy:
12-06-2008
im:
0.5
M bi:
QBMST
S ngi gii c/
lm:
112 / 128
Loi bi:
acm
T l ng:
33.6%
Thi gian chy:
1s
Bi chy tt nht:
ldt (100 im - 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Cho n th v hng lin thng G = (V, E) gm n nh v m cnh, cc nh c nh s t 1 ti n v

cc cnh c nh s t 1 ti m. Hy tm cy khung nh nht ca th G
Input
Dng 1: Cha hai s n, m (1 <= n <= 10000; 1 <= m <= 15000)
M dng tip theo, dng th i c dng ba s nguyn u, v, c. Trong (u, v) l ch s hai nh u mt ca
cnh th i v c trng s ca cnh (1 <= u, v <= n; 0 <= c <= 10000).
Output
Gm 1 dng duy nht: Ghi trng s cy khung nh nht
Example
Input:
6 9
1 2 1
1 3 1
2 4 1
2 3 2
2 5 1
3 5 1
3 6 1
4 5 2
5 6 2
Output:
263

5
S hiu hon v
Ngy:
12-06-2008
im:
0.6
M bi:
SHHV
S ngi gii c/
lm:
97 / 117
Loi bi:
acm
T l ng:
28.6%
Thi gian chy:
1s
Bi chy tt nht:
canhteo (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP
Xt tt c cc hon v ca dy s t nhin (1, 2,..., n) (1 <= n <= 12)

Gi s rng cc hon v c sp xp theo th t t in.
Yu cu:
1: Cho trc 1 hon v. Tm s hiu ca hon v trong dy sp xp
2: Cho trc s hiu ca 1 hon v trong dy hon v sp xp. Tm hon v
Input
Dng 1: Cha n s a1, a2, , an ( dy hon v n phn t )
Dng 2: Cha s p ( s hiu ca hon v trong dy hon v n phn t )
Output
Dng 1: Ghi s q ( s hiu ca dy hon v ai )
Dng 2: Ghi n s b1, b2, , bn ( dy hon v c s hiu p )
Example
Input:
2 1 3
4
Output:
3
2 3 1
264
X l s nguyn ln
Ngy:
12-06-2008
im:
0.6
M bi:
BIGNUM
S ngi gii c/
lm:
87 / 123
Loi bi:
acm
T l ng:
18.4%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
C C++ PAS fpc
Ngun bi:
c add ln bi V
Khnh Trung
Cho hai s nguyn dng A v B ( A & B c khng qu 1000 ch s )

Yu cu:
Tnh A + B, A - B, A * B
Ch :
Bi ny ch c np vi 3 ngn ng: Pascal, C, C++
Khi kt qu l 0 cc bn phi in ra 0, nu in -0 l sai
Cc ch s 0 khng c ngha u khng c in ra. VD 013 th phi in ra l 13, ch s 0 u khng c
ngha
V cch chm y l so snh 2 FILE kt qu
Input
Dng 1: s nguyn A
Dng 2: s nguyn B
Output
Dng 1: Kt qu A + B
Dng 2: Kt qu A - B
Dng 3: Kt qu A * B
Example
265
Input:
10
11
Output:
21
-1
110
Chui i xng
Ngy:
12-06-2008
im:
0.5
M bi:
NKPALIN
S ngi gii c/
lm:
126 / 161
Loi bi:
oi
T l ng:
34.0%
Thi gian chy:
1s
Bi chy tt nht:
jetli (100 im - 0.27s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:
VNOI Marathon '08 Practice Round

Problem Setter: Ng Minh
c
Ngn ng cho php:
Tt c
Mt chui c gi l i xng (palindrome) nu nh khi c chui ny t phi sang tri cng thu c
chui ban u.
Yu cu: tm mt chui con i xng di nht ca mt chui s cho trc. Chui con l chui thu c khi
xa i mt s k t t chui ban u.
D liu vo
Gm mt dng duy nht cha chui s, ch gm nhng ch ci in thng.
Kt qa
Gm mt dng duy nht l mt xu con i xng di nht ca xu s. Nu c nhiu kt qu, ch cn in ra mt
kt qu bt k.
Gii hn
Chui s c di khng vt qu 2000.
V d
266
D liu mu
lmevxeyzl
Kt qa
level
Dy s
Ngy:
12-06-2008
im:
0.6
M bi:
NKSEQ
S ngi gii c/
lm:
97 / 147
Loi bi:
oi
T l ng:
24.6%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

Source: Russian Winter
Training Camp 2004
Ngn ng cho php:
Tt c
Cho dy s nguyn a1, a2, ..., an (1 n 100000), mi s khng vt qa 10000. Dy s ny c vit trn
mt vng trn. Ngha l, khi ct vng trn ti v tr j, ta thu c:
aj, aj+1,..., an, a1, a2, ..., aj1
V tr j c gi l v tr tt, nu cc iu kin sau y c tha mn:
aj > 0
aj + aj+1 > 0
....
aj + aj+1 + ... + an > 0
aj + aj+1 + ... + an + a1 > 0
...
aj + aj+1 + ... + an + a1 + a2 + ... + aj2 > 0
aj + aj+1 + ... + an + a1 + a2 + ... + aj2 + aj1 > 0
Yu cu: hy m s v tr tt.
D liu vo
267
Dng u tin cha s nguyn n.
Dng th 2 cha dy s a1, a2,...,an.
Kt qa
In ra 1 s nguyn duy nht l s v tr tt.
V d
D liu mu
5
0 1 -2 10 3
Kt qa
2
Hang ng
Ngy:
12-06-2008
im:
1.1
M bi:
NKSPILJA
S ngi gii c/
lm:
34 / 47
Loi bi:
oi
T l ng:
32.7%
Thi gian chy:
1s
Bi chy tt nht:
tienpro (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

Source: Croatian OI 2004
Ngn ng cho php:
Tt c
Gn ngi lng c mt hang ng t tin ca Mirko sng hng nghn nm v trc. Mun l ngi u
tin pht hin ra nhng di vt c i ny, Mirko chun b cho chuyn i khm ph hang ng. Do hang ng
khng c in nn Mirko phi mua mt ngn n. Mirko mun chn mt v tr t c th nhn thy
ton b nn hang ng.
Tng tng rng nn hang ng l mt ng gp khc trong h ta gm N nh t1, t2,..., tN. Nn hang
ng lun chy t tri sang phi, ngha l vi mi i=1,2,...,N-1 ta x ca ti lun b hn ta x ca ti+1.
V d: (mt li gii cho v d 3)
268
Ngn n phi t mt im no "pha trn" nn hang ng sao cho chiu sng c ton b nn hang
ng. Chnh xc hn, ta x ca ngn n phi c t gia ta x ca im u v im cui ca
hang ng, v ta y ca ngn n phi ln hn hoc bng ta y ca im nm trn nn hang ng
cng ta x.
Ngn n chiu sng ton b hang ng nu vi mi im thuc nn hang ng, on thng ni im v
ngn n khng ct ng gp khc th hin nn hang ng. Tuy nhin, on thng v ng gp khc c
th giao nhau ti cc nh hoc dc theo mt on thng thuc ng gp khc.
Yu cu: hy gip Mirko xc nh cao nh nht c th t ngn n chiu sng ton b nn hang
ng. Bit rng kt qu khng vt qu 1000000.
D liu vo
Dng u tin cha s nguyn N (2 N 5000) l s nh ca nn hang ng.
Dng th i trong N dng tip theo cha 2 s nguyn Xi, Yi (0 Xi, Yi 100000), l ta nh th i
ca nn hang ng. Cc gi tr Xi c th t tng dn.
Kt qa
In ra 1 s nguyn duy nht l ta y b nht c th t c ngn n, vi chnh xc 2 ch s thp
phn.
V d
D liu mu
6
0 0
10 0
269

11 1
15 1
16 0
25 0
Kt qa
3.00
D liu mu
6
1 1
4 2
5 0
9 2
12 3
16 4
Kt qa
2.00
D liu mu
6
0 10
3 7
5 0
6 1
7 4
10 5
Kt qa
3.75
S huyn b
Ngy:
12-06-2008
im:
0.6
M bi:
MYSTERY
S ngi gii c/
lm:
89 / 107
Loi bi:
oi
T l ng:
30.9%
Thi gian chy:
1s
Bi chy tt nht:
d_k_phong (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
270
Ngn ng cho php:
Tt c
Ngun bi:

c
t nc Vn Lang thi c xa c nhng hiu bit tn tin v s hc. Tng truyn rng, vua Hng
Vng th 17 cng cc trng lo trong triu nh pht minh ra cc s huyn b. Cc s ny gip ch dn
ng vo kho tng ca t nc.
Theo cc chng tch kho c, cc nh khoa hc kt lun rng s huyn b c s a bng tch ca (3d-1) vi
mi c s d > 0 ca a.
Bm thch s hc ng thi cng rt thch tm hiu lch s t nc. Bn hy gip Bm tnh s huyn b c
s a (1 a 109). Do kt qu c th rt ln, bn ch cn in ra phn d ca s huyn b c s a khi chia cho
20122007.
D liu
Gm mt s nguyn a duy nht.
Kt qa
In ra s nguyn duy nht l phn d ca s huyn b c s a khi chia cho 20122007.
V d
D liu:
10
Kt qa
7291779
S nguyn t ghp
Ngy:
12-06-2008
im:
0.5
M bi:
MPRIME
S ngi gii c/
lm:
116 / 133
Loi bi:
oi
T l ng:
31.6%
Thi gian chy:
2s
Bi chy tt nht:
blake (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
271

Xt dy A cc s nguyn t
2, 3, 5, 7, 11, 13, 17, 19,...
v dy B gm cc s thu c t dy A bng cch ghp hai s lin tip trong A:
23, 57, 1113, 1719, ...
Trong dy B c nhng phn t l s nguyn t. Chng hn 23, 3137, 8389, 157163...
Cc s nguyn t trong dy B gi l s nguyn t ghp.
Yu cu: Cho trc s nguyn dng K 500, hy tm s nguyn t ghp th K.
D liu
Gm 1 s nguyn dng K duy nht.
Kt qa
In ra 1 s nguyn dng duy nht l s nguyn t ghp th K.
V d
D liu:
2
Kt qa
3137
Ni mng
Ngy:
12-06-2008
im:
0.5
M bi:
NKCABLE
S ngi gii c/
lm:
118 / 133
Loi bi:
oi
T l ng:
57.8%
Thi gian chy:
1s
Bi chy tt nht:
nevergiveup (100 im 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Cc hc sinh khi n thc tp trong phng my tnh thng hay chi tr chi in t trn mng. ngn
nga, ngi trc phng my ngt tt c cc my tnh ra khi mng v xp chng thnh mt dy trn mt
272

ci bn di v gn cht my xung mt bn ri nh s th t cc my t 1 n N theo chiu t tri sang
phi. Cc hc sinh tinh nghch khng chu thua, h quyt nh tm cch ni cc my trn bn bi cc
on dy ni sao cho mi my c ni vi t nht mt my khc. tin hnh cng vic ny, h o
khong cch gia hai my lin tip. Bn hy gip cc hc sinh ny tm cch ni mng tho mn yu cu t
ra sao cho tng di cp ni phi s dng l t nht.
D liu
Dng u tin cha s lng my N (1 N 25000).
Dng th i trong s N-1 dng tip theo cha cc khong cch t my i n my i+1 (i=1,2,...,N-1).
Gi thit rng khong cch t my 1 n my N khng vt qu 106.
Kt qu
Ghi ra di ca cp ni cn s dng.
V d
D liu:
6
2
2
3
2
2
Kt qa
7
Ct g
Ngy:
13-06-2008
im:
1.3
M bi:
CATGO
S ngi gii c/
lm:
20 / 27
Loi bi:
oi
T l ng:
34.4%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngun bi:

Problem Setter: Khc Anh
Tun
Ngn ng cho php:
Tt c
273

mt xng g c rt nhiu on g tha. t nng sut cao, ngi ta mun tn dng nhng thanh g
ny. Tt nhin gi tr ca mi on g s ph thuc vo di ca chng. Tuy nhin s ph thuc ny
khng n gin ch l s ph thuc tuyn tnh: cc thanh g cng di cng c gi tr cao. Do , nu cn
thit, ngi ta s ct cc thanh g ny ra lm nhiu on nh hn.
Ngi ta c mt my ct, mi ln c th ct mt thanh g ra lm hai thanh c di ngn hn. Do li ca
s mn dn trong qu trnh ct, chi ph ca mi ln ct s c tnh nh sau: ln u s mt 1VN, ln th 2
s l 2VN, ln th 3 s l 3VN,...
Nhim v ca bn s l tnh li nhun ln nht c th thu c t cc on g tha ny.
D liu
Dng u ghi s N, s thanh g tha.
N dng sau, mi dng ghi mt s nguyn dng l di ca mt thanh g.
Dng tip theo ghi s M, s di c gi tr.
M dng tip theo, mi dng ghi 2 s nguyn dng ln lt l di ca mt on g v gi tr thu

c (tnh bng VN) nu ta c on g .
Kt qu
Ghi ra mt s duy nht l li nhun ln nht c c, ng qun tnh c chi ph dng ct g.
Gii hn
1 N 50.
1 M 50.
di ca mt thanh g khng qu 50.
Gi tr thu c ca mt on g khng qu 50.
V d
D liu
2
3
4
2
1 10
2 11
Kt qu
55
274
Xc xc
Ngy:
13-06-2008
im:
1.3
M bi:
XUCXAC
S ngi gii c/
lm:
20 / 30
Loi bi:
oi
T l ng:
37.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
Khc Anh Tun
Mt mt bn nm ngang c chia lm li vung, trong mi c ghi mt s t nhin.

Cho 1 con xc xc nm va vn trn mt ca li. Mi mt ca xc xc l mt s t 1 n 6. Ban u, mt
trc l s 1, mt trn l s 2 v mt bn phi l s 3, cc mt i din c tng s l 7. Mi ln, con xc xc
c th ln v pha tri, phi, trc, sau. Mi ln tip xc vi mt bn, ta mt mt chi ph bng s ghi trn
m xc xc ang nm trn nhn vi s trn mt ca xc xc ang tip xc vi mt bn.
Hy tm cch ln t mt n mt khc trn mt bn t chi ph nh nht.
D liu
Dng u ghi 2 s M, N ln lt l s dng v s ct ca li trn mt bn.
M dng sau, mi dng ghi N s nguyn khng qu 100 l s ghi trn cc li ca mt bn. Cc
dng c lit k theo th t t xa n gn, cc s trn mi dng lit k t tri sang phi.
Dng cui ghi 2 cp s ln lt l ta (dng, ct) ca bt u v kt thc.
Kt qu
Ghi ra mt s duy nht l chi ph nh nht tm c.
Gii hn
1 M,N 50.
V d
D liu
3 3
1 2 3
4 5 6
7 8 9
2 2 3 3
275

Kt qu
52
m s
Ngy:
13-06-2008
im:
1.2
M bi:
DEMSO
S ngi gii c/
lm:
26 / 31
Loi bi:
oi
T l ng:
51.5%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngun bi:

Tun
Ngn ng cho php:
Tt c
Vi mt s t nhin c vit trong h c s 10, ta nh ngha v tr xu l v tr m ch s ti vi ch s

k sau n c chnh lch khng qu D. Nu mt s c khng qu K v tr xu th l s p.
Hy m s lng s p trong khong t A n B.
D liu
Gm mt dng duy nht l 4 s A, B, D, K.
Kt qu
Gm mt dng duy nht l s lng s m c.
Gii hn
1 A B 1015
V d
D liu
1 13 1 0
Kt qu
10
276
Hnh vung 0 1
Ngy:
13-06-2008
im:
0.6
M bi:
QBSQUARE
S ngi gii c/
lm:
85 / 100
Loi bi:
acm
T l ng:
30.7%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.29s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Cho mt bng kch thc MxN, c chia thnh li vung n v M dng N ct ( 1 <= M, N <= 1000 )
Trn cc ca bng ghi s 0 hoc 1. Cc dng ca bng c nh s 1, 2... M theo th t t trn xung
di v cc ct ca bng c nh s 1, 2..., N theo th t t tri qua phi
Yu cu:
Hy tm mt hnh vung gm cc ca bng tho mn cc iu kin sau:
1 - Hnh vung l ng nht: tc l cc thuc hnh vung phi ghi cc s ging nhau (0 hoc 1)
2 - Cnh hnh vung song song vi cnh bng.
3 - Kch thc hnh vung l ln nht c th
Input
Dng 1: Ghi hai s m, n
M dng tip theo, dng th i ghi N s m s th j l s ghi trn (i, j) ca bng
Output
Gm 1 dng duy nht ghi kch thc cnh ca hnh vung tm c
Example
Input:
11 13
0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
277

0 0 1 1 1 1 1 1 1 0 0 0 0
0 1 1 1 1 1 1 1 1 1 0 0 0
1 1 1 1 1 1 1 1 1 1 1 0 0
0 1 1 1 1 1 1 1 1 1 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 1 1
0 0 0 0 0 1 0 0 0 0 0 1 1
Output:
7
Bn c th
Ngy:
13-06-2008
im:
0.8
M bi:
CHESSCBG
S ngi gii c/
lm:
60 / 71
Loi bi:
oi
T l ng:
43.7%
Thi gian chy:
1s
Bi chy tt nht:
kh_cat_be_tong (100
im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
soncbg
Ngn ng cho php:
Tt c
Ngun bi:
Su tm
Mt bn c th l mt bng gm 4 dng, 4 ct. Mi th c l mt cch sp xp 8 qun c, hai qun khc

nhau hai khc nhau. Bi ton t ra l cho hai th c 1 v 2, hy tm mt s t nht bc di chuyn qun
chuyn t th 1 sang th 2; mt bc di chuyn qun l mt ln chuyn qun c sang trng k cnh vi
qun c ang ng.
D liu vo
T file vn bn gm 8 dng, mi dng l mt xu nh phn di 4 m s 1/0 tng ng vi v tr c hoc
khng c qun c. Bn dng u l th c 1, bn dng sau l th c 2.
D liu ra
Gm 1 dng duy nht l s bc chuyn qun t nht
V d
D liu vo:
1111
0000
1110
278

0010
1010
0101
1010
0101
D liu ra :
4
IOI2008
Ngy:
13-06-2008
im:
2.0
M bi:
IOI2008
S ngi gii c/
lm:
0/7
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
company_1 (0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
L Minh Hong
IOI 2008 din ra trong n + 1 ngy, cc bi ton ca IOI c nh s t 1 ti n.(n+1) v c phn b vo

cc ngy thi theo lch sau (mi ngy thi c n bi ton):
Ngy 1: Cc bi ton t 1 ti n
Ngy 2: Cc bi ton t n + 1 ti 2n
...
Ngy i: Cc bi ton t (i - 1).n + 1 ti i.n
...
Ngy n+1: Cc bi ton t n.n + 1 ti n.(n+1)
Cc bi thi c mt trong k dng, bi th j c dng l rj (1 <= rj <= k)
Th thc thi c thng bo cho mi on nh sau:
- Mi on s c n + 1 hc sinh tham gia
- Hng ngy, Ban t chc s a mt hc sinh ca on i tham quan thnh ph, vic chn hc sinh no cho
i tham quan l quyn ca trng on, nhng phi m bo iu kin:
279

Cho n khi IOI kt thc, hc sinh no ca on cng c i tham quan thnh ph. Nh vy mi ngy
on s cn li n hc sinh tham gia thi, vic giao cho hc sinh no lm bi no l quyn ca ph on nhng
mi hc sinh ch c giao mt bi v hai hc sinh khc nhau s phi nhn hai bi khc nhau.
Kt thc IOI, im ng i ca mi on s c tnh bng tng im ca tt c cc li gii cc bi ton
cho.
Cc thy gio trng, ph on Vit Nam d on rng nu hc sinh th i ca on lm bi ton dng j th
c th thu c s im l cij (cij = 0 tng ng vi li d on rng hc sinh th i khng lm c bi
ton dng j).
Hi cc thy s sp xp lch thi u cho cc hc sinh nh th no theo d on, on Vit Nam s thu
c s im nhiu nht c th.
Input
Dng 1: Cha hai s n, k (1 <= n <= 100; 1 <= k <= 1000)
Dng 2: Cha n.(n+1) s, s th p l rp.
Cc dng tip, mi dng cha ba s nguyn dng i, j, p cho bit mt iu d on ca cc thy: hc sinh
th i c th lm c bi ton dng j v t c s im l p (=c[i, j]). (1 <= p <= 100)
Output
Gm 1 dng duy nht : Ghi im ng i m theo d on on Vit Nam c th t
Example
Input:
3 4
1 2 4 4 3 3 1 4 2 3 2 2
1 1 2
1 2 3
1 4 6
2 3 4
2 1 3
2 4 7
3 2 1
3 1 4
4 1 2
4 3 9
4 2 8
Output:
65
I hope and expect that you will have much success in IOI 2008 ^^
280
Hnh ch nht 0 1
Ngy:
14-06-2008
im:
0.8
M bi:
QBRECT
S ngi gii c/
lm:
66 / 89
Loi bi:
acm
T l ng:
33.0%
Thi gian chy:
0.5s-1s
Bi chy tt nht:
raptor724 (100 im 0.3s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Cho mt bng kch thc MxN, c chia thnh li vung n v M dng N ct ( 1 <= M, N <= 1000 )
Trn cc ca bng ghi s 0 hoc 1. Cc dng ca bng c nh s 1, 2... M theo th t t trn xung
di v cc ct ca bng c nh s 1, 2..., N theo th t t tri qua phi
Yu cu:
Hy tm mt hnh ch nht gm cc ca bng tho mn cc iu kin sau:
1 - Hnh ch nht ch gm cc s 1
2 - Cnh hnh ch nht song song vi cnh bng
3 - Din tch hnh ch nht l ln nht c th
Input
Dng 1: Ghi hai s M, N
M dng tip theo, dng th i ghi N s m s th j l s ghi trn (i, j) ca bng
Output
Gm 1 dng duy nht ghi din tch ca hnh ch nht tm c
Example
Input:
11 13
0 0 0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 0 0
281

0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 1 1 1 1 1 1 1 1 1 0 0 0
1 1 1 1 1 1 1 1 1 1 1 0 0
0 1 1 1 1 1 1 1 1 1 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 1 1 1 1 1 1 1 0 0 0 0
0 0 0 0 1 1 1 0 0 0 0 1 1
0 0 0 0 0 1 0 0 0 0 0 1 1
Output:
49
Cc on nguyn
Ngy:
14-06-2008
im:
0.7
M bi:
PBCSEQ
S ngi gii c/
lm:
67 / 75
Loi bi:
oi
T l ng:
35.4%
Thi gian chy:
1s
Bi chy tt nht:
mr_luu91 (100 im 1.05s)
Gii hn m ngun:
50000B
Ngi gi:
naruto238
Ngn ng cho php:
Tt c
Ngun bi:
Croatia open contest 07-08
Mirko c mt tp hp cc on nguyn. u tin, anh y ly ra 1 on bt k. Sau thc hin ly cc on

khc, sao cho: on ly ra nm trong on va c ly trc n. Mirko tip tc cho n khi khng tm
c on tho mn na.
Yu cu
Tm s on ln nht c th ly ra.
D liu
Dng u tin cha s nguyn N, l s on nguyn trong tp hp.
Dng th i trong s N dng sau, cha 2 s nguyn A,B biu th cho on i.
Kt qu
Mt s duy nht l kt qu ca bi ton.
282
Gii hn
1 <= N <= 100000
1 <= A < B <= 1000000
V d
D liu
3
1 6
2 5
3 4
Kt qu
3
D liu
6
1 4
1 5
1 6
1 7
2 5
3 5
Kt qu
5
Ch : O(N^2) n c 50% s test.
Help Conan 5 !
Ngy:
15-06-2008
im:
1.8
283

M bi:
CDMUSIC
S ngi gii c/
lm:
5 / 10
Loi bi:
oi
T l ng:
20.8%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
COCI 2007-2008
Input:
Dng u tin gm 2 s nguyn N v K (1<=K<=N<=1 000 000 000), s bi ht trong b s tp v s bi
hin th dc.
Dng th 2 gm s nguyn M (1<=M<=300 000), s bi ht Quang V mun nghe
M dng tip theo gm th t chi nhc m Quang V mun. tt c cc s u phi t 1 n N, v ko c bi
no lp li.
Output:
Output gm 1 dng duy nht cho bit s file cn thm vo nh nht c th khi ang chi nhc trong danh
sch bi nhc ca Quang V.
V d:
D liu:
10 3
5
4
5
8
7
6
Kt qu:
5
Xp hng mua v
Ngy:
15-06-2008
im:
0.4
M bi:
NKTICK
S ngi gii c/
lm:
163 / 186
284

Loi bi:
oi
T l ng:
44.5%
Thi gian chy:
1s
Bi chy tt nht:
raptor724 (100 im 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
C N ngi sp hng mua v d bui ho nhc. Ta nh s h t 1 n N theo th t ng trong hng. Mi

ngi cn mua mt v, song ngi bn v c php bn cho mi ngi ti a hai v. V th, mt s ngi
c th ri hng v nh ngi ng trc mnh mua h v. Bit ti l thi gian cn thit ngi i mua xong
v cho mnh. Nu ngi i+1 ri khi hng v nh ngi i mua h v th thi gian ngi th i mua c
v cho c hai ngi l ri.
Yu cu: Xc nh xem nhng ngi no cn ri khi hng v nh ngi ng trc mua h v tng thi
gian phc v bn v l nh nht.
D liu
Dng u tin cha s N (1 N 60000).
Dng th 2 ghi N s nguyn dng t1, t2, ..., tN. (1 ti 30000)
Dng th ba ghi N-1 s nguyn dng r1, r2, ..., rN-1. (1 ri 30000)
Kt qa
In ra tng thi gian phc v nh nht.
V d
D liu:
5
2 5 7 8 4
4 9 10 10
Kt qa
18
D liu:
4
5 7 8 4
50 50 50
Kt qa
24
285
Triangles
Ngy:
15-06-2008
im:
1.2
M bi:
VTRI
S ngi gii c/
lm:
27 / 54
Loi bi:
oi
T l ng:
29.7%
Thi gian chy:
1s
Bi chy tt nht:
canhteo (100 im 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:
VNOI Marathon '08 Round 1/DivA

c
Ngn ng cho php:
Tt c
Trn mt phng ta , cho mt li ch nht c cnh song song vi cc trc ta , c gc di tri l gc

ta (0, 0) v gc trn phi c ta (X, Y).
Bn hy lp trnh m s hnh tam gic c nh l cc im c ta nguyn nm trong li ch nht
cho, v c din tch ng bng gi tr nguyn S.
D liu
Gm 1 dng duy nht cha 3 s nguyn: X, Y, S (1 X, Y 30, 1 S X*Y/2).
Kt qu
Gm 1 s nguyn duy nht: s tam gic c nh l cc im c ta nguyn nm trong li ch nht v c
din tch ng bng S.
Hn ch
C 50% s test, tng ng vi 50% s im, c 1X, Y10.
V d
D liu
2 1 1
Kt qu
6
286
Tam gic 2
Ngy:
15-06-2008
im:
1.3
M bi:
VTRI2
S ngi gii c/
lm:
23 / 32
Loi bi:
oi
T l ng:
31.5%
Thi gian chy:
2s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
Tt c
Ngun bi:
VNOI Marathon 2008
Tng t nh bi VTRI, nhng trong ton b cc test, 200 X, Y 250.

Bit kt qu nm trong gii hn kiu s nguyn 64-bit.
V d
D liu
200 200 1
Kt qu
1488042840
Steps
Ngy:
18-06-2008
im:
0.4
M bi:
VSTEPS
S ngi gii c/
lm:
142 / 160
Loi bi:
oi
T l ng:
45.3%
Thi gian chy:
1s
Bi chy tt nht:
tinams (100 im - 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:
VNOI Marathon '08 Round 1/DivB

c
Ngn ng cho php:
Tt c
Bm chi tr chi in t Lucky Luke n mn phi iu khin Lucky leo ln mt cu thang gm n bc.
287

Cc bc thang c nh s t 1 n n t di ln trn. Lucky c th i ln mt bc thang, hoc nhy mt
bc ln hai bc thang. Tuy nhin mt s bc thang b thng do c k v Lucky khng th bc chn ln
c. Bit ban u, Lucky ng bc thang s 1 (bc thang s 1 khng bao gi b thng).
Chi n y, Bm cht ny ra cu hi: c bao nhiu cch Lucky leo ht c cu thang? (ngha l leo
n bc thang th n). Bm mun nh bn tr li cu hi ny.
D liu
Dng u tin: gm 2 s nguyn n v k, l s bc ca cu thang v s bc thang b hng (0 k < n

100000).
Dng th hai: gm k s nguyn cho bit ch s ca cc bc thang b hng theo th t tng dn.
Kt qa
In ra phn d ca s cch Lucky leo ht cu thang khi chia cho 14062008.
V d
D liu
4 2
2 3
Kt qa
0
D liu
90000 1
49000
Kt qa
4108266
Chessboard
Ngy:
22-06-2008
im:
0.6
M bi:
VBOARD
S ngi gii c/
lm:
103 / 119
Loi bi:
oi
T l ng:
51.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
288
Ngn ng cho php:
Tt c
Ngun bi:

c
Cho mt bn c vua kch thc nxn, trn mi ca bn c c ghi mt con s. Bit trn tri ca bn c vua
l trng (cc ca bn c vua c dng xen k trng en). Cc ct c nh s t 1 n n t tri sang
phi, cc hng c nh s t 1 n n t trn xung di. hng i, ct j ca bn c c k hiu l (i,
j).
Cui a ra nhng cu cho Bm nh sau: Cui s cho Bm bit cc vng hnh ch nht trn bn c,
nhim v ca Bm l phi tnh gi tr tuyt i ca chnh lch gia tng gi tr cc trng v tng gi tr
cc en trn vng hnh ch nht . Bn hy lp trnh gip Bm tr li cc cu ca Cui.
D liu
Dng u tin: cha s nguyn n (1 n 500).
Dng th i trong s n dng tip theo cha n s nguyn ai1, ai2, ..., aij, cho bit cc s trn hng i ca
bn c (0 aij < 100).
Dng th n+2: cha s q, cho bit s cu ca Cui (1 q 10000).
q dng tip theo, mi dng cha 4 s nguyn i1, j1, i2, j2 cho bit cc ta ca vng hnh nht trong
mt cu ca Cui: ta nh tri trn l (i1, j1) v nh di phi l (i2, j2).
Kt qu
In ra q dng, mi dng cho bit p n ca Bm i vi cu tng ng ca Cui.
Gii hn
C 50% s test, tng ng vi 50% s im, trong 1 n 100 v 1 q 2000.
V d
D liu
3
1 3 5
2 4 6
0 10 5
2
1 1 2 2
1 2 3 3
Kt qu
0
5
289
The secret key

Ngy:
22-06-2008
im:
1.8
M bi:
MAKHOA
S ngi gii c/
lm:
5 / 18
Loi bi:
oi
T l ng:
13.3%
Thi gian chy:
1s
Bi chy tt nht:
trunghieuhf (100 im 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

Tun
Ngn ng cho php:
Tt c
H v! Ktuan t ha s lm mt vic g c ch trong h ny, v by gi l lc ktuan bt u.

Ktuan i thuyn ti mt hn o giu vng. Sau nhiu ngy tm kim, ktuan pht hin ra mt chic hm
b kha. Hin nhin ktuan khng th ph kha v h thng kch n s hot ng, v ci ktuan nhn c s
ch l mt ng tro. Do vic tm cha kha m chic hm l rt cn thit.
Cha kha ny l mt dy s nh phn (tc l dy s ch gm s 0 v 1) c di n. Cc ch s c nh
s th t 1 n n t tri sang phi. Ktuan thu thp c mt s ch s ca dy s. Ngoi ra, ktuan cn thu
thp c thm mt s thng tin t nhng ngi n trc (nhng tht bi trong vic m kha). Mi thng
tin c dng: "Tn ti k ch s x lin tip t v tr a n v tr b".
V d, nu ktuan bit dy s c 5 ch s c dng 1???? vi ? l ch s cha bit, v bit thm "tn ti 3
ch s 0 lin tip t v tr 2 n v tr 5", th dy s c th l 10001, 10000 hoc 11000. Do ktuan c th
chc chn rng ch s th 3 v th 4 l 0. Nh vy dy s c dng 1?00?.
Cho dng ca dy s v cc thng tin, gip ktuan xc nh cc ch s cn li ca m kha.
D liu
Dng u ghi 2 s n, m l s lng ch s ca dy v s lng thng tin bit (1 n 50, 1 m

25).
Dng sau ghi n k t l '0', '1' hoc '?' tng ng l ch s 0, ch s 1 hoc ch s cha r.
m dng sau, mi dng ghi 4 s k, x, a, b tng ng vi 1 cu thng tin.
Kt qu
Ghi 1 dng n k t th hin m kha, nhng k t khng th xc nh c thay bng '?'.
290
Nu cc thng tin mu thun, ghi ra "mau thuan" (v iu ny s thc s l mt cn c mng i vi

ktuan).
Hn ch
C 30% s test, tng ng vi 30% s im, trong 1 n 20 v 1 m 20
V d
D liu
5 1
1????
3 0 2 5
Kt qu
1?00?
The FA cup
Ngy:
29-06-2008
im:
1.4
M bi:
FACUP
S ngi gii c/
lm:
16 / 30
Loi bi:
oi
T l ng:
42.0%
Thi gian chy:
1s
Bi chy tt nht:
nobody (100 im - 0.09s)
Gii hn m ngun:
50000B
Ngi gi:
beo_chay_so
Ngun bi:
VNOI Marathon'08Round3/DivA
Problem
Setter:LnKhu
Origin:UVA
Ngn ng cho php:
Tt c
Cp FA l cp bng lu i nht t trc ti nay. Cup FA theo th thc loi trc tip. Gii u gm
2^N i, trong N vng. Vng u tin c 2^(N 1) trn u, 2^(N 1) i thng s vo vng 2. 2^(N
1) i thua b loi. C tip tc cho n khi ch cn 1 i duy nht v l i v ch.
Vng 1 c 2^(N 1) trn u c nh s t 1 n 2^(N 1). vng 1, i 1 gp i 2, 3 gp 4, , i
(2k + 1) gp i (2k + 2). vng 2, i thng trn 1 s gp i thng trn 2, , i thng trn (2k + 1) gp
i thng trn 2k + 2.
Vng 2 s c 2^(N 2) trn u. Cc trn c nh s li t 1 n 2^(N 2). vng 3, i thng trn 1 s
gp i thng trn 2, , i thng trn (2k + 1) gp i thng trn 2k + 2.
291

Cc trn u s khng c t s ha (nu ha 2 i s penalty). Bn bit kt qu bc thm ban u, v t
l kh nng thng, thua gia hai i bt k. Hy sp xp cc i theo kh nng i v ch gim dn.
D liu
Dng th nht ghi s N. (1 N 8)
Tip theo l ma trn P gm cc s nguyn trong khong [0, 100] kch thc 2^N * 2^N. Trong P[x, y] l
t l phn trm kh nng i x thng c i y khi 2 i gp nhau. D liu m bo P[x, y] + P[y, x] = 100;
P[x, x] = 0.
Kt qu
Ghi ra 2^N dng mi dng ghi ra s hiu ca mt i c sp xp gim dn theo c hi v ch ca i .
Nu 2 i c cng c hi v ch nh nhau th in ra i c s hiu nh hn trc.
V d
D liu
2
0 90 50 50
10
0 10 10
50 90
0 50
50 90 50
Kt qu
1
3
4
2
Gii thch
Hy coi cc i ln lt l MANCHESTER, FULHAM, ARSENAL, CHELSEA. 3 ng ln
MANCHESTER, ARSENAL, CHELSEA khi gp FULHAM u c kh nng thng l 90%, thua l 10%.
Khi 3 i ny gp nhau th kh nng thng l chia u 50-50. Nhng do MANCHESTER c li th v lch
thi u nn kh nng v ch ca h l cao nht.
MANCHESTER v ch nu mt trong hai trng hp sau xy ra:

- MANCHESTER thng FULHAM, MANCHESTER thng ARSENAL v ARSENAL thng CHELSEA. T
l ny l 90% * 50% * 50% = 22.5%
- MANCHESTER thng FULHAM, MANCHESTER thng CHELSEA v CHELSEA thng ARSENAL. T
l ny l 90% * 50% * 50% = 22.5%
292

Tng cng MANCHESTER c 45% c hi v ch.
ARSENAL v ch nu:
- ARSENAL thng CHELSEA, ARSENAL thng MANCHESTER, MANCHESTER thng FULHAM. T
l ny l 50% * 50% * 90% = 22.5%
- ARSENAL thng CHELSEA, ARSENAL thng FULHAM, FULHAM thng MANCHESTER. T l ny
l 50% * 90% * 10% = 4.5% Tng cng ARSENAL c 27% c hi v ch.
CHELSEA c tnh tng t nh ARSENAL v cng c 27% c hi v ch.
FULHAM v ch nu:
- FULHAM thng MANCHESTER, FULHAM thng ARSENAL, ARSENAL thng CHELSEA. T l ny
l 10% * 10% * 50% = 0.5%
- FULHAM thng MANCHESTER, FULHAM thng CHELSEA, CHELSEA thng ARSENAL. T l ny
l 10% * 10% * 50% = 0.5% Tng cng FULHAM ch c 1% c hi v ch.
Counting paths in a complete graph

Ngy:
29-06-2008
im:
0.6
M bi:
CWAY
S ngi gii c/
lm:
101 / 124
Loi bi:
oi
T l ng:
43.2%
Thi gian chy:
1s
Bi chy tt nht:
komodos (100 im 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
beo_chay_so
Ngun bi:

Problem Setter: L n
Khu
Ngn ng cho php:
Tt c
Mt th y N nh l th m gia mi cp nh u c cnh ni. Bn hy m s ng i gia 2

nh bt k ca th. Lu rng mt ng i khng c i qua mt nh qu mt ln.
D liu
Ghi duy nht mt s N l s nh ca th (2 N 1000).
Kt qu
In ra mt s duy nht l s lng ng i gia 2 nh bt k.
293
V d
D liu
4
Kt qu
5
Gii thch
Gia 2 nh bt k v d nh 1 v 2 c 5 ng i:
1-2
1-3-2
1-3-4-2
1-4-2
1-4-3-2
The Nth digit

Ngy:
30-06-2008
im:
1.6
M bi:
NDIGIT
S ngi gii c/
lm:
11 / 19
Loi bi:
oi
T l ng:
41.9%
Thi gian chy:
3s
Bi chy tt nht:
Gii hn m ngun:
10000B
Ngi gi:
beo_chay_so
Ngun bi:

Problem Setter: L n
Khu
Ngn ng cho php:
Tt c
S A(K) l dy thu c bng cch ghp lin tip cc s 1^K, 2^K, 3^K, ... S nh hn pha sau (bn
phi).
Vi K = 1, A(K) = ...181716151413121110987654321.
Vi K = 2, A(K) = ...169144121100816449362516941.
Xt tng S = A(1) + A(2). on cui ca S l: ...350860272513937560350171262
Cho N, K1, K2, hy tm ch s th N tnh t phi sang ca tng S = A(K1) + A(K2) (s ngai cng bn phi
ca tng S c tnh l ch s th 1)
294
D liu
Mi input gm 3 test, mi test c ghi trn 1 dng gm 3 s N K1 K2. 1 K1, K2 5. 1 N
1,000,000,000
Kt qu
In ra 3 p s tng ng.
Chm im
Nu ng 3/3 bn c 5 im.
Ngoi ra, bn khng c im.
V d
D liu
1 1 2
3 1 2
5 1 2
Kt qu
2
2
7
Integers
Ngy:
06-07-2008
im:
0.7
M bi:
INTEGER7
S ngi gii c/
lm:
72 / 111
Loi bi:
oi
T l ng:
27.5%
Thi gian chy:
1s
Bi chy tt nht:
anh_cvp (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngun bi:
VNOI Marathon '08 Round 4

Problem Setter: Nguyn
Minh Hiu
Ngn ng cho php:
Tt c
295

Tm hai s nguyn khng m x1 v x2 tha mn a1 * x1 + b1 = a2 * x2 + b2 v x1 + x2 l nh nht. Bit rng
lun tn ti s x1, x2 tha mn.
D liu
Gm 1 dng 4 s nguyn a1, b1, a2, b2 (cc s nguyn khng m trong phm vi [0..231 - 1]).
Kt qu
Ghi ra 2 s x1, x2 tha mn yu cu bi.
V d
D liu
3 4 5 5
Kt qa
2 1
Exploring the maze

Ngy:
06-07-2008
im:
1.0
M bi:
PCYCLE
S ngi gii c/
lm:
40 / 59
Loi bi:
oi
T l ng:
24.7%
Thi gian chy:
1s
Bi chy tt nht:
topwin (100 im - 0.11s)
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngun bi:
VNOI Marathon '08 Round 4

Minh Hiu
Ngn ng cho php:
Tt c
Mt m cung gm c N phng v M hnh lang ni cc phng, gia hai phng bt k c khng qu mt hnh
lang ni chng.
Mt ngi mun khm ph m cung, anh ta s xut pht t mt phng v i dc theo tt c cc hnh lang
sao cho mi hnh lang c i qua ng mt ln, ri li tr v v tr xut pht. Mi hnh lang c mt gi tr
c cho bit khi i qua n th nng lng nh thm him s cng thm vi c (c c th m hay dng). Nh
thm him bt u xut pht vi nng lng bng 0, anh ta s cht nu sau khi i ht mt hnh lang no
m mc nng lng nh hn 0.
Yu cu: Hy gip nh thm him tm ra mt hnh trnh an ton tha mn cc yu cu a ra.
D liu
296
Dng 1 l 2 s nguyn N, M. ( 1 N 200 )
M dng tip theo, dng th i gm 3 s nguyn u, v, c cho bit c 1 hnh lang ni phng u vi phng
v v gi tr nng lng l c. ( |c| 10000 ) .
Kt qu
Nu c khng c hnh trnh no an ton th ghi ra -1. Ngc li ghi ra M+1 s nguyn l ch s
phng trn ng i. T phng xut pht, qua cc phng, hnh lang ri quay tr v phng xut pht.
V d
D liu
3 3
1 2 2
1 3 -1
2 3 -1
Kt qa
2 1 3 2
Brainfck thch
Ngy:
10-07-2008
im:
0.6
M bi:
BFCHAL
S ngi gii c/
lm:
95 / 100
Loi bi:
oi
T l ng:
64.1%
Thi gian chy:
1s
Bi chy tt nht:
komodos (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
baochi810
Ngn ng cho php:
BF
Ngun bi:
y l bi tp Brainfuck c thm vo phng theo mong mun ca nhiu bn, mnh add vo mi ngi
tha sc tm hiu ngn ng th v ny. V nhng dng bi tp nhp xut kiu ny tng i d. Nn bi
tng i gn ng vi ci tn thch :P
NHN TEST M ON ^^
Gii hn : chui khng qu 100 k t, eof = -1
Input:
iamvietnamese
297

Output:
IAMVIETNAMESE
Removing digits
Ngy:
13-07-2008
im:
0.8
M bi:
KDEL
S ngi gii c/
lm:
61 / 96
Loi bi:
oi
T l ng:
22.5%
Thi gian chy:
6s
Bi chy tt nht:
iamme (100 im - 0.39s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

c
Ngn ng cho php:
Tt c
Bm rt yu thch 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 tnh 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 phi. Cc s u tin ca dy s c tnh cht ny l:
2, 23, 235, 2357, 235711,...
Bm k hiu s th n ca dy s l an.
Trong bi ton ny, bn cn lp trnh gip Bm xa k ch s ra khi s an sao cho s cn li thu c l ln
nht c th.
D liu
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).
Kt qu
Gm mt dng duy nht cha s ln nht thu c sau khi xa ng k ch s ra khi s an.
V d
D liu
5 4
Kt qa
298

71
Blocks
Ngy:
13-07-2008
im:
1.4
M bi:
VBLOCKS
S ngi gii c/
lm:
18 / 32
Loi bi:
oi
T l ng:
41.3%
Thi gian chy:
1s
Bi chy tt nht:
timberlake (100 im 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

c
Ngn ng cho php:
Tt c
Bm v Cui cng nhau chi tr chi xp hnh. Tr chi gm mt di gm L vung c kch thc 1x1 v
cc thanh ngang c kch thc 1xS (gm S khi hp 1x1 gn lin nhau). Nhim v ca Bm l xp mt s
thanh ngang ny ln di vung, sao cho hai thanh ngang lin tip phi cch nhau t nht D vung (ngha
l c t nht D trng gia hai thanh ngang).
tng kh ca tr chi, Cui cn a ra mt s iu kin cho Bm. Mi iu kin ca Bm c dng:
th i phi c khi hp hoc th i khng c c khi hp.
Hy gip Bm xc nh xem c tn ti cch xp tha mn yu cu ca Cui hay khng. Nu tn ti, hy cho
bit s thanh ngang nhiu nht m Bm xp c l bao nhiu.
D liu
Dng u tin: cha 3 s nguyn L, S, D (1 L 100000).
Dng th hai: cha s nguyn K l s yu cu ca Cui.
K dng tip theo, mi dng cha hai s nguyn i, d (d=1 hoc d=2) th hin mt yu cu ca Cui:
d=1 cho bit i phi c khi hp cn d=2 cho bit i khng c c khi hp. Cc gi tr i
c a ra theo th t tng dn.
Kt qu
Nu khng tn ti cch xp tha mn yu cu ca Cui, in ra -1. Nu khng, in ra s thanh ngang nhiu nht
m Bm c th s dng.
Hn ch
C 50% s lng test, tng ng vi 50% s im c 1 L 1000.
299
V d
D liu
10 4 2
2
2 1
5 2
Kt qu
2
D liu
4 2 1
2
1 1
3 1
Kt qu
-1
Help Conan 8 !! Hurry up !!

Ngy:
15-07-2008
im:
2.0
M bi:
CONANGSS
S ngi gii c/
lm:
0/8
Loi bi:
oi
T l ng:
0.0%
Thi gian chy:
0.5s-10s
Bi chy tt nht:
tnga (0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
conankudo
Ngn ng cho php:
Tt c
Ngun bi:
Own
D tm mi cch t st nhng m khng th no t st c v qu ngoan,Conan tht vng trn

tr,quay tr li vi VOJ,nhn nhng bi Accepted,Conan bng ny ra mt ,ti sao khng kt hp nhng
bi vi nhau nh,v cui cng anh quyt nh kt hp hai bi QMAX2 v GSS li vi nhau tr thnh
problem CONANGSS nh sau :
Cho mt dy s n phn t ( tt c khi to bng 0 ),v m cu hi (n<=20.000,m<=20.000). Mi cu hi c
dng:
U u v val tc l tng c on (u,v) ln val n v ( val c th m )
Q u v ,khi gp cu hi ny bn phi tr li ra on con c tng ln nht trong on (u,v) (nh ngha on
con ging bi GSS).
300
Input
-Dng u ghi 2 s n,m
-m dng sau mi dng ghi 1 trong 2 loi cu hi nh trn
Output
Vi mi cu hi dng Q in ra kt qu
Example
Input:
4 2
U 1 3 2
Q 1 4
Output:
6
Ch :
Nghim cm for tru di mi hnh thc :))/
/
Help Conan 9 !
Ngy:
15-07-2008
im:
1.6
M bi:
QVESCAPE
S ngi gii c/
lm:
10 / 14
Loi bi:
oi
T l ng:
16.1%
Thi gian chy:
1s-1.5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
COCI 2007-2008
Anh Quang V do ny kh h hng, sut ngy c chi bi lu lng nn b bn Nh Qunh trng pht.
Nhng bn Nh Qunh rt nng tay nn ch th anh anh Quang V bng cch nm vo ngc ti bi vua
bng ti xc nh ngoan ca anh ta. Ci ngc c to dng thnh mt hnh lp phng vi nhng bc
tng ln. Nhng cn phng c ni bi nhng li i nn v vy ton b ngc ti khi nhn t pha trn
trng ging nh mt ng xon c. Nhng cn phng c nh s nh sau:
... 15 14 13
5 4 3 12
301

6 1 2 11
7 8 9 10
Sau mt trn ng t ln mt s bc tng b ph hy v nhng li i mi c hnh thnh gia nhng
phng k bn
Anh Quang V ang phng 1 . ng y bit rng li thot c t phng N, v mun chy thot trong lc
mi ngi ang hong lon v trn ng t, bi v vua bng ti ang canh gc ngc ti, anh Quang V
mun dng con ng i nhanh nht thot khi ngc ti.
Vit chng trnh a ra v tr ca li thot N v danh sch nhng li i mi, xc nh s on ng phi
i nh nht m anh Quang V phi i qua trc khi that khi ngc.
Input:
Dng u tin ca input cha mt s nguyn N(1<=N<=10^15), phng m li thot .
Dng th hai cha 1 s nguyn K (1<=K<=100000), s ca con ng mi.
Mi dng K cha 1 s nguyn B(4<=B<=10^15) ngha l mt con ng mi c ni vo hai phng A,B
cnh nhau, ni m A
Output:
Output cha 1 s nguyn, s con ng nh nht m anh Quang V phi i qua trc khi thot.
Nu khng thot ra, anh V s b t o ti hang ng ny, hy vng cc bn s gip anh V thot khi hang.
P/S: 50% s test c N<=10^5
Ex:
Input
31
9
15
25
30
6
9
19
24
27
4
Output
6
302
Chuyn
Ngy:
17-07-2008
im:
0.7
M bi:
NKSTEP
S ngi gii c/
lm:
72 / 88
Loi bi:
oi
T l ng:
37.4%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Yu cu: Cho 2 s nguyn x v y (0 x, y 231). Hy xc nh s bc i ti thiu i t x n y vi bc i

ban u v bc i cui cng u c di 1.
V d, vi x = 45, y = 50 s bc i ti thiu l 4:
45 46 48 49 50
D liu
Dng u tin cha s nguyn T la s l ng test.
T dng sau, mi dng cha 2 s nguyn x, y.
Kt qu
a ra kt qu mi test trn 1 dng.
V d
D liu:
3
45 48
45 49
45 50
Kt qa
3
3
4
Th t t in
303

Ngy:
17-07-2008
im:
1.1
M bi:
NKLEXIC
S ngi gii c/
lm:
33 / 56
Loi bi:
oi
T l ng:
21.2%
Thi gian chy:
1s
Bi chy tt nht:
buiminhtri (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Cho tp gm N (1 N 26) ch ci u tin trong bng ch ci Latin v s nguyn dng M (1 M N).

Cp s (N,M) xc nh mt tp hp tt c cc t gm M ch ci khc nhau t N ch ci cho. Cc t trong
tp hp ny c sp xp thnh dy theo th t t in. Khi , ta gi s th t t in ca mt t l s th
t ca n trong dy t c sp xp.
V d, cp (N=3, M=2) xc nh tp {ab, ac, ba, bc, ca, cb}. T 'bc' tng ng vi 4, t 'ab' tng ng vi 1,
t 'ca' tng ng vi 5,....
Yu cu: Gi s bit cp s nguyn (N,M), khi cho mt t bn cn xc nh s th t t in ca n,
ngc li cho bit s th t t in ca mt t bn cn a ra t . Trong c hai tnh hung, bn phi kim
tra xem d liu c ng n hay khng: trong tnh hung th nht, d liu l ng n nu t cho thuc
tp t c xt, cn trong tnh hung th hai, d liu l ng n nu tm c t trong tp t c s th t
cho.
D liu
Dng u tin l s nguyn K l s b d liu.
Tip theo l K nhm dng m t K b d liu, mi nhm gm hai dng:

o
Dng u tin cha hai s N, M.
Dng th hai bt u bi ch 'P' hoc ch 'W' tng ng vi vic bn cn xc nh s th t

t in ca t cho trc hay xc nh t tng ng vi s th t ca n. Sau ch 'P' hoc ch
'W' l mt khong trng, tip n l t gm M ch ci latinh in thng nu ch u dng l
'P' v l s nguyn dng nu ch ci u dng l 'W'.
Kt qu
Ghi ra K dng, mi dng l cu tr li cho mt b d liu tng ng trong file d liu v cha thng tin sau:
Nu b d liu cho l khng ng n cn ghi thng bo 'Incorrect data'.
Nu b d liu cho l ng n bn cn ghi ra t hoc s th t t in cn tm ph thuc vo cu

hi ca b d liu.
Ch
304

Trong trng hp d liu l ng n, lun m bo s th t thuc phm vi [1, 2000000000] khi xc nh
t c s th t cho trc v th t ca t thuc phm vi [1, 2000000000] khi xc nh s th t ca t cho
trc.
V d
D liu:
4
3 2
P bc
4 3
W 6
3 3
P vba
3 3
W 9
Kt qa
4
adc
Incorrect data
Incorrect data
Cuc u cn no
Ngy:
17-07-2008
im:
1.7
M bi:
NCOB
S ngi gii c/
lm:
7 / 16
Loi bi:
oi
T l ng:
24.4%
Thi gian chy:
1s-4s
Bi chy tt nht:
topwin (100 im - 1.92s)
Gii hn m ngun:
1024B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
^Nuga Ci^
Ngi hnh tinh BrainPower va mi Nuga tham d mt cuc thi u th v. l gii C Chy lin
hnh tinh.
C Chy l th loi c do Co & Da ngi hnh tinh BP a ra vo nm 3101. Mi vn c 2 ngi chi,
lun phin nhau thc hin nc i ca mnh, bc thm chn ngi chi trc. Bn c l mt dy N
vung, nh s t 1 n N t tri sang phi, v ch c 2 qun c duy nht, ban u c t 2 vung do
2 ngi chi t do la chn (hai vung ny c th trng nhau). Gi s 2 qun c ang 2 vung c ch
s l X v Y ( X Y). Ngi chi thc hin nc i bng cch di chuyn qun c v tr Y i K v bn
tri, sao cho K phi l mt bi s dng ca X, v qun c vn trn bn c. Ni cch khc, v tr mi ca
305

qun c Y l Y = Y K, Y 1. Tr chi kt thc khi khng th thc hin c nc i no na. V ngi
khng thc hin c nc i ca mnh l ngi thua cuc.
Cuc thi c nhiu vng, mi vng gm cc cp u loi trc tip. Ngi thng c lt vo vng trong.
Ngi thng trong tt c cc trn, tt nhin, tr thnh Nh v ch, v c thng 100 Triu USD.
Nuga rt mun ginh c s tin khng l ny v c b ang c nh tn trang li con tu siu tc ca
mnh. Nhng ngi tham gia tr chi u l nhng b c v i n t cc hnh tinh khc nhau, h u chi
ti u cho mi nc i, v th, Nuga phi chun b trc mt s kh nng chn ban u t qun c sao
cho mnh chc chn thng. Cho mt lot cp 2 s X, Y l ch s ca 2 vung ban u t 2 qun c. Bn
hy gip Nuga xc nh xem Nuga phi i trc hay i sau th chc chn s thng?
(P/S: Nuga ha s chia cho bn mt na gii thng nu V ch! :P)
D liu
Gm nhiu dng, mi dng ghi 2 s nguyn dng X Y. Kt thc bng cp s 0 0.
Kt qu
Tng ng vi mi X Y, ghi ra trn mt dng, T nu Nuga phi i trc, S nu Nuga phi i sau chc
chn thng.
Gii hn
X, Y 2^31 1
Trong 50% s im, c X, Y 1000
Thi gian: 1s
V d
D liu:
1 1
9 2
0 0
Kt qu:
S
T
Help Conan 10 !
Ngy:
17-07-2008
im:
1.7
306

M bi:
QVSICK
S ngi gii c/
lm:
6/7
Loi bi:
oi
T l ng:
66.6%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 2.49s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
COCI 2007-2008
Hm nay, anh Conankudo ngoan ca chng ta ang b m,th m anh ta li phi cng u chin u vi 1
li thch t anh Qunh. Conankudo khng th gii c v anh ta ang lm trng bnh, cc bn hy th
gip anh ta xem.
Sn phm s ca 1 s nguyn dng l kt qu khi ly tch ca cc ch s to nn s nguyn . V
d, sn phm s ca 2612 l 2.6.1.2=24
Sn phm bn thn ca 1 s l tch ca n vi sn phm s. v d sn phm bn thn ca 2612 l
2612.24=62 688
Vit chng trnh, bit 2 s nguyn dng A v B, tnh s nguyn dng c sn phm bn thn trong
on [A;B].
Input:
Dng duy nht gm 2 s nguyn A v B (1<=A<=B<=10^18)
Output:
Ch gm 1 s nguyn, l s s nguyn dng c kt qu trong khong [A;B].
Ex:
Input:
20 30
Output:
2
Brainfuck Cng
Ngy:
18-07-2008
im:
0.6
M bi:
NBFA
S ngi gii c/
lm:
94 / 96
Loi bi:
oi
T l ng:
67.3%
307

Thi gian chy:
1s
Bi chy tt nht:
dark_magican (100 im
- 0s)
Gii hn m ngun:
50B
Ngi gi:
racer
Ngn ng cho php:
BF
Ngun bi:
^Nuga Ci^
Mi cc bn thng thc bi ton d sau, trc khi chuyn sang bi Brainfuck Nhn :P
Cho 2 s t nhin c 1 ch s. In ra tng ca chng, bit rng tng ny cng ch c 1 ch s.
D liu
2 s t nhin trn 1 dng, khng cha du cch.
Kt qu
Tng ca 2 s, ghi trn 1 dng duy nht.
V d
D liu:
45
Kt qu:
9
Brainfuck Nhn
Ngy:
18-07-2008
im:
0.6
M bi:
NBFM
S ngi gii c/
lm:
88 / 89
Loi bi:
oi
T l ng:
75.6%
Thi gian chy:
1s
Bi chy tt nht:
huy391992 (100 im 0s)
Gii hn m ngun:
100B
Ngi gi:
racer
Ngn ng cho php:
BF
Ngun bi:
^Nuga Ci^
Bi ny tru hn NBFA :P
Cho 2 s t nhin c 1 ch s. Hy in ra tch ca 2 s , bit rng tch cng c 1 ch s.
D liu
308

2 s nguyn vit lin tip.
Kt qu
Tch ca 2 s nguyn.
V d
D liu:
23
Kt qu:
6
Brainfuck Chia
Ngy:
18-07-2008
im:
0.7
M bi:
NBFD
S ngi gii c/
lm:
79 / 83
Loi bi:
oi
T l ng:
79.4%
Thi gian chy:
1s
Bi chy tt nht:
crazycholon1 (100 im 0s)
Gii hn m ngun:
200B
Ngi gi:
racer
Ngn ng cho php:
BF
Ngun bi:
^Nuga Ci^
Bi tru b y :P
Cho 2 s t nhin c 1 ch s x v y (y khc 0). In ra phn nguyn ca php chia x cho y.
D liu
2 s t nhin x,y lin tip.
Kt qu
Phn nguyn ca x/y
V d
D liu:
52
Kt qu:
309

2
Help the PM!

Ngy:
20-07-2008
im:
1.1
M bi:
HELPPM
S ngi gii c/
lm:
33 / 69
Loi bi:
oi
T l ng:
14.0%
Thi gian chy:
5s
Bi chy tt nht:
gerrob (100 im - 1.35s)
Gii hn m ngun:
50000B
Ngi gi:
beo_chay_so
Ngun bi:

Problem Setter: L n
Khu
Ngn ng cho php:
Tt c
Nu khng tn ti vng khai thc g no cho g xut khu, in ra -1. Ngc li in ra:
Dng th nht ghi din tch nh nht c th ca vng khai thc g.
Dng tip theo ghi bn s l ch s ca gc tri trn v gc phi di ca vng khai thc g. Nu c
nhiu vng cng tha mn th in ra ta ca mt vng bt k.
V d
D liu
3 3 19
5 4 0
4 7 0
0 0 2
Kt qu
4
1 1 2 2
Query on a tree again!

Ngy:
21-07-2008
im:
1.2
M bi:
QTREE3
S ngi gii c/
lm:
24 / 30
Loi bi:
oi
T l ng:
34.2%
310

Thi gian chy:
1.5s
Bi chy tt nht:
gerrob (100 im - 2.8s)
Gii hn m ngun:
50000B
Ngi gi:
john_jones
Ngun bi:

Problem Setter: Blue Mary
Ngn ng cho php:
Tt c
Cho mt cy ( th v hng phi chu trnh) c N nt. Cc nt ca cy c nh s t 1 n N. Ban u,

mi nt u c mu trng.
Bn phi thc hin cc thao tc c dng sau:
0 i: i mu nt th i (t en thnh trng, hoc t trng thnh en)
1 v: tm ch s ca nt en u tin trn ng i t nt 1 n nt v. Nu khng tn ti, hy tr v -1.
D liu
Dng th nht gm hai s nguyn N v Q.
N-1 dng sau, mi dng gm hai s nguyn a b m t mt cnh ni gia nt a v nt b.
Q dng sau cha cc thao tc dng "0 i" hoc "1 v" (1 i, v N).
Kt qu
Vi mi thao tc dng "1 v", in ra mt s nguyn l kt qu.
V d
D liu
9 8
1 2
1 3
2 4
2 9
5 9
7 9
8 9
6 8
1 3
0 8
1 6
1 7
0 2
1 9
0 2
1 9
311
Kt qu
-1
8
-1
2
-1
Gii hn
C 12 test:
Trong 1/3 s test, N=5000, Q=400000.
Trong 1/3 s test tip theo, N=10000, Q=300000.
Trong 1/3 s test tip theo, N=100000, Q=100000.
Chia nhm
Ngy:
21-07-2008
im:
0.7
M bi:
BCDIV
S ngi gii c/
lm:
67 / 71
Loi bi:
oi
T l ng:
55.6%
Thi gian chy:
0.5s
Bi chy tt nht:
duyhung123abc (100
im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
baochi810
Ngn ng cho php:
Tt c
Ngun bi:
Trn tri rt xung :))
Mt hm tri nng nng bc, Ch Pho nh ta li n nh B kin i tin mua ru. Oi om thay, tn B
Kin keo kit hm nay li d chng bt Ch phi thc hin yu cu ca mnh ri mi cho tin. Ch tc ti
lm nhng v qu ghin ru nn hn nh phi chp nhn iu kin m c th l gii 1 bi ton.
Bi ton c ni dung nh sau : Cho n phn t khc nhau, hi c bao nhiu cch chia n phn t thnh k
nhm m mi nhm c t nht 1 phn t (cc hon v ca cc nhm c xem l 1 cch).
V tht hc nn Ch ngh mi khng ra, cc bn gip Ch 1 tay nh, khng th hn ta cht v thm ru mt
^^
D liu vo : Dng u tin cha s T l s test. T dng tip theo mi dng cha 2 s N v K, vi
1<=K<=N<=25 D liu ra : T dng, mi dng l s cch vi test tng ng.
Input:
1
4 2
312
Output:
7
Gii thch : 7 cch chia l (ABC)(D) , (ABD)(C) , (ADC)(B) , (DBC)(A) , (AB)(CD) , (AC)(BD) ,
(BC)(AD)
Xp toa
Ngy:
21-07-2008
im:
2.0
M bi:
NRS
S ngi gii c/
lm:
1/1
Loi bi:
oi
T l ng:
99.0%
Thi gian chy:
1s
Bi chy tt nht:
phaleq (100 im - 0.16s)
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
Adrian Kuegel
Mt cng ty vn ti thu 1 on tu ha ch hng cho khch. Tuy nhin sau khi xp hng ln ht th
nhn c thm yu cu t khch l hng phi c xp sao cho toa nng phi pha trc toa nh, ni
cch khc l cc toa phi c sp xp theo v tr gim dn v trng lng hng ha trong toa.
Cc toa c nim phong nn khng th chuyn hng gia cc toa c. Cch duy nht l yu cu nh ga
dng 1 chic cn cu chuyn v tr cc toa. V tr cc toa c nh s t 1 tr i, bt u t toa pha
trc nht.
Khi cn cu chuyn toa t v tr I sang v tr J, v tr sp xp tng i gia cc toa cn li khng b thay i.
Nu I > J th s th t v tr ca cc toa gia J v I-1 s tng thm 1. Ngc li, nu I < J th s th t v tr
ca cc toa gia I+1 v J s gim i 1. Chi ph cho mi ln cu toa I sang v tr J l I+J n v gi.
Nhim v ca bn l tm cch chuyn hng sao cho tng s chi ph l thp nht.
D liu
Dng u tin gm 1 s nguyn dng N (2 N 1000) l s lng toa c dng xp hng. Trong
N dng tip theo, mi dng gm 1 s nguyn Si (0 Si 1000000) l trng lng ca toa hng tng ng
theo th t t 1 n N.
Gii hn: 30%Test c N 10
Kt qu
Mt dng duy nht ghi tng chi ph nh nht chuyn cc toa theo v tr yu cu ca khc hng.
V d
313

D liu:
5
15
40
1
8
6
Kt qu:
11
Phn Trang
Ngy:
21-07-2008
im:
0.8
M bi:
PTRANG
S ngi gii c/
lm:
62 / 65
Loi bi:
oi
T l ng:
53.0%
Thi gian chy:
1s
Bi chy tt nht:
tiensusu (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:

PAS fpc JAVA C# ASM Ngun bi:
BASH PYTH RUBY BF
thi chn i tuyn

quc gia 99
Vn bn l mt dy gm N tnh s t 1 n N. T th i c di l wi (i=1, 2,... N). Phn trang l mt

cch xp ln lt cc t ca vn bn vo dy cc dng, mi dng c di L, sao cho tng di ca cc t
trn cng mt dng khng vt qu L.Ta gi h s pht ca mi dng trong cch phn trang l hiu s (LS), trong S l tng di ca cc t xp trn dng . H s pht ca cch phn trang l gi tr ln nht
trong s cc h s pht ca cc dng.Tm cch phn trang vi h s pht nh nht.
Input
Dng 1 cha 2 s nguyn dng N, L (N<=6000,L<=1000)
Dng th i trong s N dng tip theo cha s nguyn dng wi (wi<=L), i=1, 2,.., N
Output
In ra h s pht nh nht
V d
Input:
314

4 5
3
2
2
4
Output:
2
Tam gic
Ngy:
22-07-2008
im:
1.3
M bi:
EQUTRI
S ngi gii c/
lm:
22 / 28
Loi bi:
oi
T l ng:
19.0%
Thi gian chy:
1s
Bi chy tt nht:
thoiroiluomoi (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
kvd
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt tam gic u c cnh bng N. Ba nh ca tam gic ban u c nh du bng 3 s nguyn
dng i mt khc nhau. KVD chia tam gic cho thnh N^2 tam gic u nh c cnh 1 v gn vo nh
ca cc tam gic mi 1 s thc sao cho nu ABC v BCD l 2 trong cc tam gic nh th tng cc s nh
trn 2 nh A,D bng tng cc s nh trn hai nh B,C.
Tuy nhin, sau c bui gn s nh vy KVD mun tnh tng cc s nh. Nhng do qu mt mi nn
KVD mun nh cc bn lp trnh tnh tng cc s c gn.
Input
Gm mt dng duy nht cha 4 s N,a,b,c(a,b,c l 3 s c nh vo 3 nh ca tam gic ban u).
Output
In ra s duy nht l phn nguyn tng ca cc s c nh.
Gii hn
0< N <=1000000000.
0=< a,b,c <=1000000.
V d
Input
315

5 1 2 3
Output
42
Tch T
Ngy:
24-07-2008
im:
1.0
M bi:
NKH
S ngi gii c/
lm:
38 / 62
Loi bi:
oi
T l ng:
20.9%
Thi gian chy:
0.5s-1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:

PAS fpc JAVA C# D
Ngun bi:
BASH PYTH RUBY BF
thi khi khng chuyn

- Olympic sinh vin 2003.
H iu hnh XP cho php iu khin cng lc hai bn phm. Hai anh em Tun v Nam va c thng
mt my tnh mi nn rt mun th tnh nng ny ca XP. Tun v Nam, mi ngi dng mt bn phm v
ng thi g vo mt t ang ngh trong u tng ng l S1 v S2. Do g ng thi v tc g khc
nhau nn kt qu l trn mn hnh hin ra mt chui k t S l kt hp ca cc k t trong S1 v S2. Cc k
t ny an xen nhau theo mt trnh t no khin Tun v Nam khng cn nhn ra k t no do mnh
g.
Yu cu:
Hy gip Tun v Nam xc nh nhng k t no c th l ca mnh theo ngha nu tch nhng k t

ra v ghp li theo ng th t th ta nhn c ng t m Tun v Nam g.
D Liu
D liu vo gm 3 dng, trong :
Dng u tin cha t S1 do Tun g. Dng th hai cha t S2 do Nam g.
Dng cui cng cha chui S. S1 v S2 ch cha cc ch ci latin (a, A, b, B.. ) v s lng k t
trong mi chui khng vt qu 100.
Kt Qu
Kt qu ghi ra ch c mt dng duy nht cha chui k t c chiu di bng chiu di chui S, trong
k t th I s bng k t 1 nu k t tng ng S[I] do Tun g v bng 2 nu S[I] do Nam g.
Trong trng hp c nhiu hn mt kh nng ch cn ghi mt trong cc kh nng .
V D
316
Input:
papa
mama
mpapamaa
Output:
21112212
C s H
Ngy:
26-07-2008
im:
0.5
M bi:
BASEH
S ngi gii c/
lm:
113 / 124
Loi bi:
oi
T l ng:
49.3%
Thi gian chy:
1s
Bi chy tt nht:
phaleq (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
kvd
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt dy s a[1],a[2],a[3],...,a[n] v hai s K,H c xc nh nh sau:
a[1]=1;
Nu K chn th a[K]=H*a[K/2].
Nu K l th a[K]=H*a[(K-1)/2]+1.
Cc bn hy lp trnh tnh s th K ca dy vit trong h c s H.
Input
Gm mt dng duy nht cha 2 s K,H.
Output
In ra s duy nht l kt qu bi ton.
Gii hn
0< K <=1000000000.
0=< H <=2008.
V d
Input
317

7 110
Output
111
Harry Potter and the Deathly Maze

Ngy:
03-08-2008
im:
1.6
M bi:
NHP
S ngi gii c/
lm:
9 / 12
Loi bi:
oi
T l ng:
23.7%
Thi gian chy:
0.5s-1.5s
Bi chy tt nht:
gerrob (100 im - 3.64s)
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngun bi:

Problem Setter: Phm L
Quang
Ngn ng cho php:
Tt c
Trong chuyn phiu lu tm kim nhng bo bi t thn, Harry cng cc bn ca cu lc vo mt m

cung b mt. Ngay khi h va bc chn vo, cc bc tng lp tc mc ln bn pha, chia m cung thnh
N*N phng c kch thc 1*1 v nhm ca Harry b nht trong mt s phng. Mi phng u c 4 cnh
ca, mi chic nm trn 1 bc tng ca phng .
Cc con qui vt ch xut hin trong cc phng c Harry v cc bn ca cu. S qui vt mt phng lun
lun bng s ngi trong phng. iu ny c ngha l khi 1 ngi di chuyn t phng X sang phng Y, th
phng Y s c thm 1 con qui vt.
sng st, buc Harry v cc bn phi chin u vi l qui vt v tm ng thot ra ngoi. Thi gian
tiu dit 1 con qui vt phng (I, J) l A[I, J]. (nh s cc phng t tri sang phi, t trn xung di).
Mt ngi ch c th cng 1 lc chin u vi 1 con qui vt, v bt buc phi tiu dit xong qui vt
mi c th chuyn sang phng khc.
Nh tm bn o tc, Harry bit c nhng ngi bn ca mnh ang phng no. Cu cng pht hin
ra rng, mi phng nht bn mnh u c sn bng mt mu ring bit, v cc cnh ca nm trn 4 bc
tng bao ngoi ca m cung cng c nhiu mu sc khc nhau. By gi cu cn phi hng dn tng ngi
chy ti cnh ca cng mu vi phng nht ngi . Nhng khi c mt ngi thot ra ngoi m cung, th
ngay lp tc, qui vt trong m cung s hi phc li sc mnh nh ban u, v 4 bc tng ca cn phng b
mt s quay 1 n v theo chiu kim ng h, lm cc cnh ca mu trn cng quay theo. Hay ni cch
khc, nu ta i dc theo 4 bc tng ca cn phng b mt theo chiu kim ng h th mi cnh ca m ta i
ti s i sang mu c ca cnh ca ngay pha sau ta (Xem hnh v).
318
Do tnh th kh khn nn ch khi mt ngi thot khi m cung th Harry mi hng dn ngi tip theo.
Bn hy gip Harry hng dn cho tt c cc bn ca mnh thot khi m cung trong thi gian ngn nht!
(P/s: Nu bn hi Harry hng dn cho cc bn mnh bng cch no? Cu y dng thn ch Sonorus! (m
vang) lm ging ni ca mnh vang vng khp m cung. :D)
D liu
Dng u ghi 2 s nguyn dng N, K. Vi N l kch thc ca m cung, K l s ngi trong nhm bn ca
Harry.
Trong I dng tip theo, mi dng ghi J s nguyn khng m. S th J trn dng I l A[I, J] th hin thi gian
cn thit tiu dit qui vt trong phng (I, J).
Trong K dng tip, mi dng ghi 1 b 3 s nguyn khng m I, J, C. B s (I, J, C) trn dng th X th hin
rng ngi bn th X ang phng (I, J) v phng ny c sn mu C.
Dng cui cng ghi 4*N s nguyn khng m, l mu ca cc cnh ca trn 4 bc tng bao quanh m
cung, ln lt theo chiu kim ng h, bt u t cnh ca bc tng pha trn ca phng nh (1,1). (Th
t ging nh trong hnh 1)
Kt qu
Mt s nguyn duy nht l thi gian nh nht tt c mi ngi trong nhm bn ca Harry c th thot
khi m cung.
Gii hn
1 N 100
1 K 100, K N^2
319
0 C 100
0 A[I, J] 100
V d
D liu:
3 2
2 2 2
0 2 0
1 0 2
1 2 2
2 1 2
2 2 2 2 2 2 1 1 2 1 1 2
Kt qu:
3
Tribe
Ngy:
03-08-2008
im:
1.0
M bi:
TRIBE
S ngi gii c/
lm:
38 / 56
Loi bi:
oi
T l ng:
29.0%
Thi gian chy:
1s
Bi chy tt nht:
d_k_phong (100 im 0.16s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:

Tun
Ngn ng cho php:
Tt c
Ngn ng ca mt b lc c xa ch s dng hai ch ci a v b to ra cc t c ngha. to thnh mt

cu, ngi ta s dng thm du cch phn tch cc t. Nh vy mi dy cc k t a v b lin tip nhau v
khng th m rng c v hai bn s to thnh mt t. Mt cu khng th cha t v ngha. Ngi trong
b lc quan nim mi t c mt gi tr may mn. Gi tr may mn ca mt cu l tng gi tr may mn ca
cc t trong cu. Bn c s dng ti a x k t a, y k t b v z du cch, hy to ra cu c trng s ln
nht. Trong trng hp c nhiu kt qu, hy in ra cu c th t t in nh nht.
Input
Dng u ghi s N, s t c ngha trong ngn ng.(1 N 50)
Dng sau ghi 3 s x, y, z nh trong bi.( 0 x, y, z 50)

320
N dng sau, mi dng ghi mt t thuc ngn ng v gi tr ca n, cch nhau bi mt du cch. Gi

tr ca mt t l mt s nguyn dng khng vt qu 50.
Output
Gm mt dng duy nht ghi ra cu c th t t in nh nht tm c.
Example
Input:
4
3 3 1
abb 3
baa 3
aaa 4
bbb 1
Output:
abb baa
Ch
Cu s1 c gi l c th t t in nh hn s2 nu xu biu din s1 nh hn s2. Th t t in ca

cc k t l: du cch, a, b.
Writing
Ngy:
05-08-2008
im:
0.9
M bi:
PBCWRI
S ngi gii c/
lm:
48 / 60
Loi bi:
oi
T l ng:
34.7%
Thi gian chy:
3s
Bi chy tt nht:
vhhvvh (100 im - 0.59s)
Gii hn m ngun:
50000B
Ngi gi:
naruto238
Ngn ng cho php:
Tt c
Ngun bi:
Mexico OI 2005
Cho 2 chui A,B cha cc ch ci trong bng ch ting Anh (c c ch hoa v ch thng). Chui A c
di n, chui B c di m.
Yu cu: m s ln xut hin ca cc hon v ca chui A trong chui B.
D liu
Dng u tin cha 2 s nguyn n v m.

321
Dng th 2 cha n k t ca chui A.
Dng th 3 cha m k t ca chui B.
Kt qa
Mt s duy nht l kt qu ca bi ton.
Gii hn
n 3000
m 3 000 000
V d
D liu
4 11
cAda
AbrAcadAbRa
Kt qu
2
Gii thch: 2 ln bt u t v tr 4 v 5.
Gp tin
Ngy:
09-08-2008
im:
0.5
M bi:
NOTE
S ngi gii c/
lm:
116 / 123
Loi bi:
oi
T l ng:
46.7%
Thi gian chy:
0.5s
Bi chy tt nht:
viet (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
Tt c
Ngun bi:
HAOI 2008/Day 1 Author: Phm Nam Long
LSM l c vn cao cp ca HAOI 2008 v c giao nhim v ra thi. Hn np bi ang n gn m LSM

khng c mt tng no. Th k Lola thc gic ngy m cng thm khon tin bi thng nu khng
hon thnh cng tc ng hn lm LSM ht sc lo lng. Trong lc tuyt vng, LSM v tnh gp i lin tip
t tin 100$ trc mt. Khi m t tin ra, trong tay LSM l t giy bc c cc vt gp ln xung. t nhin,
mt tng le sng: nu c cch no xc nh c np gp th p tnh t tri sang phi ca t tin tin
l ln hay xung, th y s l mt bi ton hay cho cc th sinh ca HAOI 2008. Hy gip LSM thot khi
tnh th kh khn ny nh!
322

T tin c hnh dng ch nht v lun c thc hin sao cho mp tri c gp ln mp phi. LSM thc
hin gp nh vy f ln. Tuy nhin trong thc t, ti mt lc no ng tin s khng th gp c do qu
dy, nhng chng ta b qua thc t ny v t tin vn c gp i chnh xc sau f ln.
D liu
Gm nhiu dng mi dng cha ng 2 s nguyn ngn cch nhau bi du cch f v p tng ng l
s ln gp t tin v v tr np gp cn xc nh. (1 f 31. p tha mn khng vt qu s lng np
gp c to ra sau f ln gp)
D liu c kt thc bi 2 s 0 v khng yu cu in ra kt qu cho 2 s ny.
Kt qu
Vi mi dng tng ng vi d liu vo, in ra mt k t duy nht mi dng: U cho np gp ln trn v D
cho np gp xung di.
V d
D liu
2 1
2 2
2 3
0 0
Kt qu
U
D
D
M v tt
Ngy:
09-08-2008
im:
1.9
M bi:
KANDP
S ngi gii c/
lm:
3 / 34
Loi bi:
oi
T l ng:
3.7%
Thi gian chy:
2s
Bi chy tt nht:
tinams (100 im - 2.27s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:
HAOI 2008 - Day 1 Author: Phm Hi

Minh/L n Khu
Ngn ng cho php:
Tt c
323

Trn mt bi c vua kch thc v hn c mt con m v mt con tt. V tr ca qun m l (Mx, My), v tr
ca qun tt l (Tx, Ty), trong x l ch s dng v y l ch s ct. Qun m c quyn i theo 8 hng
nh bn c vua chun. Qun tt ch c i mt hng l i xung di (t v tr (x, y) n v tr (x-1, y)).
Hai qun c s di chuyn theo lt, xen k nhau. Khi mt qun c vo v tr ca qun c khc ang ng th
qun c va di chuyn s thng.
Bn bit v tr ban u ca hai qun c, qun c no i trc. Bn hy tnh xem qun m c kh nng thng
khng v nu thng th n s phi i t nht l bao nhiu nc.
D liu
Dng th nht ghi hai s Mx, My.
Dng th hai ghi hai s Tx, Ty.
Dng th ba ghi 0/1 ng vi qun m i trc hoc qun tt i trc.
Kt qu
Dng th nht ghi YES/NO tng ng vi qun m c kh nng thng hoc khng c kh nng
thng.
Nu dng th nht l YES th dng th hai ghi s bc t nht.
Gii hn
Mx, My, Tx, Ty l cc s nguyn c tr tuyt i nh hn hoc bng 1000. Trong 50% s test, Mx, My, Tx,
Ty c tr tuyt i nh hn hoc bng 50.
V d
D liu
0 0
0 3
0
Kt qu
YES
2
Gii thch
hnh v bn di, ch K th hin v tr qun m, ch P th hin v tr qun tt.
Gii phng mt bng

324

Ngy:
09-08-2008
im:
0.8
M bi:
GPMB
S ngi gii c/
lm:
64 / 77
Loi bi:
oi
T l ng:
31.1%
Thi gian chy:
3s
Bi chy tt nht:
topwin (100 im - 1.87s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
Tt c
Ngun bi:
HAOI 2008 - Day 1 Author: Ng Minh c
Chnh quyn thnh ph KN ang tin hnh m thm mt tuyn ng mi trong thnh ph. Chnh quyn c
bn ta ca N h dn trong khu vc tuyn ng c th i qua. Tuyn ng l mt ng thng i
qua ta cc h dn. Cc h dn c nh s t 1 n N; h dn th i c din tch s dng l si (m2). Nu
tuyn ng i ngang qua h dn th i, chnh quyn cn phi n b cho h dn ny si2+5 (ng) tin gii
phng mt bng. Hi chnh quyn cn phi n b nhiu nht bao nhiu tin khi xy dng tuyn ng?
D liu
Dng 1: mt s nguyn N l s h dn (1 N 1500).
Dng th i trong N dng tip theo cha 3 s nguyn xi, yi, si cho bit ta v din tch ca h dn
th i (-50 xi, yi 50, 30 si 500).
Kt qu
In ra mt s duy nht l s tin nhiu nht chnh quyn phi n b khi xy dng tuyn ng.
V d
D liu
5
0 0 1
1 1 2
2 2 4
0 1 5
1 0 3
Kt qu
51
Rc uc Olympic
Ngy:
10-08-2008
im:
2.0
325

M bi:
TORCH
S ngi gii c/
lm:
0 / 42
Loi bi:
oi
T l ng:
0.0%
Thi gian chy:
3s
Bi chy tt nht:
beo_chay_so (89.51 im
- 16.64s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
C++ PAS fpc
Ngun bi:
HAOI 2008 - Day 2 Author: L n Khu
Olympic Bc Kinh 2008 ang din ra v cng si ni v quyt lit. Ngay t lc ny, nhng nh t chc ca
Olympic London 2012 tnh n k hoch cho l rc uc ca Olympic ln ti. H d nh s i qua N
thnh ph. Mi thnh ph c ta (x, y) trn mt phng. K hoch ca l rc uc l ngn uc s bt
u t thnh ph 1, i ln lt gia cc thnh ph khc mi thnh ph ng 1 ln ri quay tr li thnh ph
1. Bn hy tm mt hnh trnh tng ng i l nh nht.
D liu
Dng th nht ghi s N.
N dng tip theo, mi dng ghi mt cp s (x, y) l ta ca cc thnh ph
Kt qu
Dng u tin ghi di ca hnh trnh c ng i ngn nht m bn tm c vi t nht 3 ch s

sau du phy.
Dng th hai ghi N s bt u bng s 1 v tip theo l ln lt cc thnh ph trn hnh trnh.
Gii hn
1 N 100
Ta cc thnh ph c tr tuyt i khng qu 105.
V d
D liu
4
0 0
1 0
0 5
1 5
Kt qu 1
12.0000
1 2 4 3
326
Kt qu 2
20.1980
1 4 2 3
Kt qu 3
12.1980
1 2 3 4
Cch tnh im
Vi mi test, ban t chc c a ra mt p s ExpectedResult. Gi kt qu ca bn l Result.
Nu Result ExpectedResult bn s c 10 im.
Nu ExpectedResult < Result < 1.5 ExpectedResult bn s c 9 1.5(Result ExpectedResult) / 25
Ngoi ra, bn s khng c im.
Vi test v d trn, vi ExpectedResult = 12, output 1 s c 10 im, output 2 s c 0 im, output 3

s c 7.997 im.
Rp chiu phim
Ngy:
10-08-2008
im:
0.7
M bi:
CINEMA
S ngi gii c/
lm:
70 / 79
Loi bi:
oi
T l ng:
37.1%
Thi gian chy:
1s
Bi chy tt nht:
sanhdieu (100 im 1.15s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
C++ PAS fpc
Ngun bi:
HAOI 2008 - Day 2 Author: L n Khu
Megastar l rp chiu phim ln v hin i nht H Ni. Rp chiu ny c mt phng chiu gm M hng
gh, mi hng c N gh. c c v xem phim, bn c th t v qua mng. Mi yu cu t v c th
t mt lc nhiu v. Hin ti, sau khi nhn c cc yu cu t v, rp s sp xp b tr ch ngi cho cc
yu cu sao cho cc ch ngi ca mi yu cu l mt vng lin thng. Mt gh khng nm hng u, hng
cui, ct tri nht, ct phi nht s c 4 gh pha trc, pha sau, pha tri v pha phi c coi l k vi
n.
Cng vic sp xp ch ngi ny hin ti c lm hon ton bng tay. Bn hy vit chng trnh sp xp
ch ngi cho hp l nht.
D liu
327
Dng th nht ghi s M v N.
Dng th hai ghi s K l s yu cu t v.
Dng th ba ghi K s l s lng v mi yu cu t.
Kt qu
Ghi ra M dng, mi dng N s vi ngha gh dnh cho yu cu t v th i.
Nu mt gh l trng th in ra 0.
Gii hn
1 M, N 1000.
Tng s v yu cu khng vt qu M * N.
Trong 40% s test, M N 100.
V d
D liu
5 4
3
4 5 9
Kt qu
1 1 2 2
1 1 2 2
3 3 3 2
3 3 3 0
3 3 3 0
HAOI 6000
Ngy:
10-08-2008
im:
1.5
M bi:
HAOI6000
S ngi gii c/
lm:
15 / 31
Loi bi:
oi
T l ng:
15.0%
Thi gian chy:
1s
Bi chy tt nht:
mr_luu91 (100 im 1.66s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
C++ PAS fpc
Ngun bi:
HAOI 2008 - Day 2 Author: Nguyn Honh
328

Tin
Ngy nay, khi internet tr nn v cng ph bin, cc cuc thi u c xu hng chuyn sang hnh thc thi
on-line, va tit kim c chi ph, va thu ht c s lng ng o th sinh. HAOI (Hot Angel On the
Internet tm dch l Thin thn xinh p trn mng) l mt cuc thi nh vy. Ging nh nhng cuc thi
sc p bnh thng, HAOI cng bao gm cc vng thi ph: ti nng, tr tu, trang phc truyn thng Sau
y l cu hi phn thi tr tu:
Mt to nh hnh ch nht c chia thnh MxN vung nh. mi vung, ngi ta xy ng mt bc
tng l mt trong hai ng cho ca . Yu cu tm ng i nhanh nht t mt pha Bc ti mt pha
Nam ca to nh m khng c i ra ngoi to nh?
Xt v d trong hnh v bn, c 3 ng i khc nhau. Trong , ng 1 v 3 l ngn nht vi di 10.
Gi s bn gi ca bn ang tham gia HAOI. Bn hy lp trnh mt chng trnh gii quyt cu hi trn
trong thi gian cho php gip c y.
D liu
Dng u tin l hai s M, N.
MxN s t nhin tip theo (mi s cch nhau t nht mt khong trng) miu t trng thi cc bc
tng cc (1,1), (1,2) (1,N), (2,1), (2,2) (M,N). S 0 nu bc tng ni nh tri trn vi
phi di, s 1 nu bc tng ni nh tri di v phi trn ca vung.
Kt qu
In ra file HAOI.OUT hai s nguyn l di ng i ngn nht v s lng ng i c di nh

vy. Trong trng hp khng c ng i no, in ra mt dng cha hai s 0 0.
Gii hn
1 M, N 1000
V d
D liu
5 5
0 0 1 1 1
1 1 0 0 0
0 0 1 1 1
1 1 0 0 0
0 0 0 1 1
Kt qu
10 2
329
Nhng con s
Ngy:
10-08-2008
im:
1.3
M bi:
NUMBERS
S ngi gii c/
lm:
21 / 52
Loi bi:
oi
T l ng:
13.3%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.82s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

c
Ngn ng cho php:
Tt c
Trn mt trang web dnh cho nhng ngi yu thch ton hc, va xut hin mt cu nh sau: bn c N
s nguyn dng. Nhim v ca bn l tm cch t mi s bng mt mu khc nhau, sao cho mt s khng
bao gi chia ht cho mt s khc cng mu v s mu cn s dng l t nht.
Thy cu rt th v, Bm nh n s gip ca bn! Bn hy vit chng trnh gip Bm gii cu
trn.
D liu
Dng 1: cha s nguyn dng N.
Dng 2: cha N s nguyn dng a1, a2, a3, ..., an.
Kt qu
Dng 1: cha s nguyn dng K, l s mu t nht cn s dng.
Dng th i trong K dng tip theo cha s nguyn ci l s s c t mu i, theo sau l ci s nguyn
c mu i.
Gii hn
ai l s nguyn dng trong phm vi [1, 106]
Ch
Nu c nhiu phng n t mu cc s, ch cn in ra mt phng n ty .
V d
330

D liu
10
24 7 42 8 2 16 22 21 33 11
Kt qu
3
3 7 2 11
4 8 22 21 33
3 24 42 16
Hai thao tc trn chui

Ngy:
10-08-2008
im:
1.7
M bi:
TWOOPERS
S ngi gii c/
lm:
6/8
Loi bi:
oi
T l ng:
57.1%
Thi gian chy:
2s
Bi chy tt nht:
gothdn (100 im - 0.35s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:

Problem Setter: Yang Yi
Ngn ng cho php:
Tt c
John c mt chui S. John c yu cu thc hin hai thao tc sau theo th t trn S:
1. Chn mt v tr ca S, v thay th bng bt k k t no John mun.
2. Dch chuyn chui S, ngha l, John c th chn mt v tr k v dch chui S theo vng trn sao cho k
tr thnh v tr bt u ca chui mi.
John mun sau khi thc hin hai php ton trn, kt qu thu c l mt chui cho trc. Bn hy gip John
tnh s cch bin i t chui S thnh mt chui T cho trc.
D liu
D liu bao gm hai chui S v T trn mt dng. Mi chui bao gm nhiu nht 100000 k t v ch
gm cc k t in hoa.
m bo rng S v T c cng s k t.
Kt qu
Mt s duy nht l s cch bin i t chui S thnh chui T.
V d
331
D liu
AHYANGYI YANGYIAH
Kt qu
8
Gii thch
John c th thay th ch "A" u tin bng "A", hoc "H" bng 'H", v.v...
ngha l c th thay th mt ch bng chnh ch .
Sau , ch c mt cch dch chuyn chui.
D liu
VSUMSU MSUMSU
Kt qu
2
Gii thch
John cn thay th ch "V" u tin bng "M".
Sau , John c hai cch dch chuyn chui (k=1 hoc k=4).
Help Conan 12 !
Ngy:
11-08-2008
im:
0.5
M bi:
MAXARR1
S ngi gii c/
lm:
117 / 125
Loi bi:
oi
T l ng:
40.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
TIMUS
Nm ngoi Conan ch mi bc vo hc Tin hc tht s. Th nhng anh ta b n em l Nh Qunh thch

1 bi ton nh sau. Cho T<=100000. Mi dng ca T c 1 s N(N<=100000). Dy s A c xy dng
nh sau :
A[0]=0;
A[1]=1;
A[2i]=A[i];
332

A[2i+1]=A[i]+A[i+1]
Nhim v ca bn l tm s ln nht ca dy A t 1 vi N.
Input:
- Dng u tin l s T.
- T dng sau, mi dng l 1 s N
Output:
C T dng tng ng vi gi tr ln nht ca cc on
Ex:
MAXARR1.INP
2
5
10
MAXARR1.OUT
3
4
Help Conan 13 !
Ngy:
11-08-2008
im:
1.5
M bi:
MAXARR2
S ngi gii c/
lm:
13 / 49
Loi bi:
oi
T l ng:
14.3%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
TIMUS
Conan ang quy, anh ta mun lm kh mi ngi. V th anh ta ngh ra 1 tr mi , l mi

ngi mt bi kh hn, bi MAXARR1, T<=10000 v N<=10^18
Input:
333

- Dng u tin l s T.
- T dng sau, mi dng l 1 s N
Output:
C T dng tng ng vi gi tr ln ni ht ca cc on
Ex:
MAXARR2.INP
2
5
10
MAXARR2.OUT
3
4
Ghi ch : 20% s test c T<=100 v N<=100000
Gi tr th S
Ngy:
11-08-2008
im:
0.8
M bi:
PBCFIBO
S ngi gii c/
lm:
56 / 77
Loi bi:
oi
T l ng:
27.3%
Thi gian chy:
1s
Bi chy tt nht:
komodos (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
naruto238
Ngn ng cho php:

Ngun bi:
JAVA
M rng t bi thi THT

THCS - Thank for
TopWin
Cho 1 s nguyn dng K v dy s F gm n phn t c to nh sau:
F[1] = 1;
F[2] = 2;
334
F[i] = (F[i - 1] + F[i - 2]) mod K; (3 i n)
Yu cu: Hy cho bit gi tr th S ca dy F khi sp xp khng gim.
D liu vo
Gm 1 dng duy nht cha 3 s n, k , s.
D liu ra
1 s duy nht l kt qu tng ng.
Gii hn
1 s n 1018
1 k 104
V d
D liu vo
5 2 4
D liu ra
1
Help Conan 11 !
Ngy:
13-08-2008
im:
2.0
M bi:
PACK
S ngi gii c/
lm:
0/0
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
(0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
Latvia OI
Conan l 1 tn trm bi bc, anh ta cc bn 1 bi sau. C 1 b bi t trn bn, cha N l bi chng ln

nhau tng l mt. Mi l c 1 con s nguyn dng c vit ln 1 mt v ko vit bn mt cn li. Trn l
bi trn cng con s 1 c vit, l bi trn cng th hai c s 2, v trn l bi di cng l s N. Khi bt
u tt c cc l bi c sp xp cc mt c s nm pha trn. Ngi s dng cc l bi thc hin M lt
cng vic. Trong lt th i th ng ly K[i] l pha trn, gi chng li v lt p li v ln pha trn ca b
bi. Nhim v ca bn l vit 1 chng trnh xc nh v tr v trng thi ca 1 l bi nht nh (lt p hay
m) trong b bi sau M lt ca ngi s dng cc l bi.
335

+Input:
- Dng u tin ca file PACK1.INP cha 2 s nguyn dng N (s lng bi trong b bi. N <=100000)
v M (s lt xo bi ca ngi , <=1000) v phi tch bi du gch ngang. M dng tip theo s vit nh
sau: 1 s nguyn dng Ki (1<=Ki<=N) - s lng l bi dung trong mi lt.
- Dng u tin ca file ch PACK2.INP cha 1 s nguyn dng S (<=10000) - s lng l bi, v tr sau
lt cui cng v trang thi cn c xc nh. S dng tip theo cha 1 con s nguyn dng con s ghi
trn l bi, v tr sau lt cui cng v trng thi.
+Output :
File PACK.OUT phi cha ng S dng. Mi dng phi cha 1 s nguyn dng. Nu n cui cng m l
th P c con s m dng th i+1 ca file PACK2.INP c cha, dng th i ca file output phi c con s:
+P nu l c con s ca n vit mt trn
-P l ngc li
Ch :
Th t ca cc l bi trong b bi ang thay i (= mt c ghi s lt nga, mt c ghi s lt p)
Ex:
PACK1.INP
83
1
8
4
PACK2.INP
5
4
8
1
5
2
PACK.OUT
-5
336

+4
+8
+1
-7
Khi tam ch nht

Ngy:
17-08-2008
im:
1.8
M bi:
RECT3
S ngi gii c/
lm:
5/7
Loi bi:
oi
T l ng:
43.5%
Thi gian chy:
1s-2s
Bi chy tt nht:
gothdn (100 im - 0.11s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:
VNOI Marathon'08Round 9/DivA

Problem Setter:Nguyn
Trn Nam Khnh
Ngn ng cho php:
Tt c
Cho bng ch nht MxN (1 M, N 200) gm cc s 0 v 1. Ta gi mt khi tam ch nht l mt hnh

gm ba hnh ch nht, mi hnh ch nht gm ton s 1, xp chng ln nhau sao cho hnh ch nht gia
phi rng hn v mi pha ca hai hnh ch nht trn v di t nht mt .
V d, cc hnh sau y l cc khi tam ch nht:
1
111
1
11
11
11111
1
1
Cc hnh sau y khng phi l khi tam ch nht:

111
11111
111
111
(Ba hnh ch nht khng lin thng)
337
1111
1111
11111
111
111
(Hnh ch nht gia khng rng hn hnh ch nht pha trn mt v bn phi)
Trong bi ton ny, bn cn tm khi tam ch nht c din tch ln nht.
D liu
Dng u tin: hai s nguyn M, N.
M dng tip theo, mi dng gm N s 0 hoc 1 (vit lin nhau) m t bng ch nht.
Kt qu
In ra din tch ca khi tam ch nht ln nht, hoc 0 nu khng tm c khi tam ch nht no.
V d
D liu
6 8
00000110
00111000
00110100
01111001
01111110
00111010
Kt qu
15
Gii thch
Khi tam ch nht:
00000110
00111000
00110100
01111001
01111110
00111010
C din tch l 15
Khi tam ch nht khc c din tch 14:
00000110
338

00111000
00110100
01111001
01111110
00111010
u trng VM08
Ngy:
17-08-2008
im:
1.0
M bi:
LSFIGHT
S ngi gii c/
lm:
42 / 54
Loi bi:
oi
T l ng:
40.0%
Thi gian chy:
0.5s-3s
Bi chy tt nht:
funny (100 im - 1.86s)
Gii hn m ngun:
50000B
Ngi gi:
tikiupi
Ngun bi:

Problem Setter: T Quang
Phc
Origin:POI6
Ngn ng cho php:
Tt c
Trong k thi Marathon 08 nm nay cc vCoders phi tham gia mt mn thi u i khng gia 2 ngi. Sau
vng loi, ban t chc s chn ra N th sinh c s im cao nht v nh s t 1 n N. Cc th sinh ny phi
xp ln lt theo th t thnh 1 vng trn (ngi th N ng cnh ngi th 1). Sau s chn ra 2 th sinh
bt k ang ng cnh nhau trong vng trn thi u, th sinh no thua s b loi v buc phi i ra vng
trn, tr v hng gh khn gi. Cuc u c tip tc nh th n khi ch cn mt ngi li v cng chnh
l ngi thng cuc.
Tuy nhin ban t chc mun bit trc xem c bao nhiu ngi c kh nng thng cuc v l nhng
ngi no. Bit trc ai s thng trong mi trn u, bn hy gip ban t chc nh ^^
D liu
- Dng u l s nguyn dng N (3 <= N <= 500)
- N dng sau l ma trn A[i, j], A[i, j] = 0 nu th sinh i thua th sinh j v A[i, j] = 1 nu ngc li. Bit rng
lun m bo A[i, i]=1 vi mi i v A[i, j] + A[j, i] = 1 vi i <> j. Cc s vit cch nhau t nht 1 du cch.
Kt qu
- Dng u l s nguyn dng M - s lng th sinh c kh nng thng cuc
- M dng sau mi dng ghi mt s l ch s ca th sinh c kh nng thng cuc theo th t tng dn ca ch
s.
V d
339

D liu
7
1 1 1 1 1 0 1
0 1 0 1 1 0 0
0 1 1 1 1 1 1
0 0 0 1 1 0 1
0 0 0 0 1 0 1
1 1 0 1 1 1 1
0 1 0 0 0 0 1
Kt qu
3
1
3
6
Khi tam ch nht II

Ngy:
19-08-2008
im:
2.0
M bi:
RECT3_2
S ngi gii c/
lm:
1/1
Loi bi:
acm
T l ng:
99.0%
Thi gian chy:
5s
Bi chy tt nht:
gothdn (100 im 16.09s)
Gii hn m ngun:
50000B
Ngi gi:
aukcwe
Ngn ng cho php:

Ngun bi:
JAVA
M rng t RECT3 ca
VM08 - add ln bi
Gothdn.
bi ging ht bi RECT3.
D liu
Dng u tin: hai s nguyn M, N (1 M, N 2000).
M dng tip theo, mi dng gm N s 0 hoc 1 (vit lin nhau) m t bng ch nht.
Kt qu
In ra din tch ca khi tam ch nht ln nht, hoc 0 nu khng tm c khi tam ch nht no.
V d
340

D liu :
6 8
00000110
00111000
00110100
01111001
01111110
00111010
Kt qu :
15
Gii thch
Khi tam ch nht:
00000110
00111000
00110100
01111001
01111110
00111010
C din tch l 15
Khi tam ch nht khc c din tch 14:
00000110
00111000
00110100
01111001
01111110
00111010
Hnh thoi
Ngy:
25-08-2008
im:
1.4
M bi:
HINHTHOI
S ngi gii c/
lm:
19 / 33
Loi bi:
oi
T l ng:
32.5%
Thi gian chy:
0.5s-3.5s
Bi chy tt nht:
conankudopro (100 im
- 0s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
Tt c
Ngun bi:
341

c
Hnh thoi l hnh t gic c bn cnh bng nhau. Hnh thoi xut hin trong cc qun bi R trn b bi Ty,
trn cc hoa vn trang tr, v.v... Hnh vung cng l mt trng hp c bit ca hnh thoi.
Trong bi ny, bn hy gii mt bi ton v hnh thoi: cho N im trn mt phng ta , m s hnh thoi
c 4 nh thuc vo tp hp im ny.
D liu
Dng 1: mt s N l s im (4 N 1500).
Dng th i trong N dng tip cha hai s nguyn xi, yi l ta ca im th i (-50 xi, yi 50).
Kt qu
Ghi ra mt s nguyn duy nht l s hnh thoi c 4 nh thuc tp hp im cho.
V d
D liu
8
-1 0
0 1
1 0
0 0
1 1
0 -1
1 -1
2 0
Kt qu
4
S 0 tn cng
Ngy:
25-08-2008
im:
0.6
M bi:
DIGIT0
S ngi gii c/
lm:
97 / 124
Loi bi:
oi
T l ng:
32.4%
Thi gian chy:
1s
Bi chy tt nht:
voanhcuoc (100 im 0s)
342

Gii hn m ngun:
Ngn ng cho php:
50000B
Tt c
Ngi gi:
voj
Ngun bi:
VNOI Marathon'08Round 10/DivB

Problem Setter:Nguyn
Trn Nam Khnh
Cho xu N k t gm cc ch ci in thng (a-> z) (N 10000). Xt cc hon v khng lp li ca xu

ny. V d vi xu abbb ta s c 4 hon v:
abbb, babb, bbab, bbba
Hy tm s lng ch s 0 tn cng ca s lng cc hon v khng lp ca xu cho.
D liu
Mt dng duy nht: xu S.
Kt qu
Mt s duy nht: s lng ch s 0 tn cng tm c.
V d
D liu
babb
Kt qu
0
Bng hoa
Ngy:
02-09-2008
im:
1.9
M bi:
FLOWER
S ngi gii c/
lm:
2/6
Loi bi:
oi
T l ng:
28.5%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
hard7771988
Ngun bi:

Minh Hiu
Ngn ng cho php:
Tt c
343

Cc thao tc m ngi chi c th thc hin l nh sau :
D chic hp trn cng ca ngn thp ra v t vo 1 ci gi.
Trong cc hp c trong cc gi, chn 1 chic, rt n ra khi gi v xp n vo bn tri/phi cc cnh

hoa xp trc .
D chic hp trn cng ca ngn thp ra nhng khng t chic hp vo gi m xp n lun vo

bn tri/phi cc cnh hoa xp trc .
im ca ngi chi tnh bng s lng nhng chic gi cn dng.

Hy tnh xem im nh nht m ngi chi c th t c l bao nhiu ?
Ch : Khi rt hp ra khi gi th gi li c th tip tc dng ng cc hp khc v mt gi ch cha
c khng qu 1 hp.
D liu
Dng 1 : s nguyn dng N.
Dng 2 : N s nguyn dng m t mu ca cc khi hp ( t trn xung ).
Dng 3 : N s nguyn m t mu ca cc cnh hoa ( theo chiu kim ng h ).
Kt qu
S lng gi cn thit, bit rng lun lun xp c.
Gii hn
N 1000.
Mu ca cc hp khng vt qu N.
V d
D liu
5
2 1 2 3 4
2 3 1 4 2
Kt qu
1
Gii thch : u tin ta rt hp mu 2 ra, t n vo v tr di ( hnh v ), sau rt hp mu 1 ra v cho

vo gi ( v khng th t vo bn tri/phi ca hp mu 2 ), sau rt c hp mu 2 na ra, ta t n vo
bn phi hp mu 2 xp trc . Tip tc rt hp 3 ra v cho vo bn phi hp 2 ( hp trn ), sau
rt hp 1 (t trong gi) ra cho vo bn phi hp 3 hoc rt hp 4 ra cho vo bn tri hp 2 ( hp di ),
cn li 1 hp t n vo v tr cui cng.
344
Kin
Ngy:
02-09-2008
im:
0.9
M bi:
ANT
S ngi gii c/
lm:
46 / 73
Loi bi:
oi
T l ng:
20.0%
Thi gian chy:
5s
Bi chy tt nht:
lightning31 (100 im 7.43s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:

c
Ngn ng cho php:
Tt c
H nh kin t chc mt tr chi nh sau mng nm mi. Nhng ch kin quy thnh mt vng trn.
Kin cha s a ra mt con s v gi n l s M (Mi). Bt u, kin cha m s 1, theo chiu kim ng
h, cc ch kin ln lt m s tip theo. n lt ch kin m phi s ng bng s M th s phi i ra
khi vng trn. Vic m li t 1 bt u t ch kin tip theo, theo chiu kim ng h.
Tr chi kt thc, khi ch cn li mt ch kin. Ch kin s nhn c mn qa u nm ca h nh
kin.
Bit s ch kin ban u trn vng trn v s M. Hy xc nh s th t ca ch kin s nhn c phn

thng may mn. Cc ch kin c nh s th t theo chiu kim ng h, bt u t kin cha c s hiu
1.
D liu
Dng 1: cha s nguyn dng N, l s ch kin trn vng trn.
Dng 2: cha s nguyn dng M.
Kt qa
Gm 1 dng duy nht, cha s th t ca ch kin s nhn c mn qa u nm
Gii hn
1 N 1012.
345
3 M 106.
M N.
V d
D liu
7
3
Kt qu
4
Gii thch
Th t nhng ch kin phi ra khi vng trn ln lt l: 3 6 2 7 5 1.
Ch kin 4 l ch kin may mn!
Mua v tu ho
Ngy:
03-09-2008
im:
1.0
M bi:
QBTICKET
S ngi gii c/
lm:
37 / 65
Loi bi:
oi
T l ng:
25.3%
Thi gian chy:
0.5s
Bi chy tt nht:
beo_chay_so (100 im 0.69s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Tuyn ng st t thnh ph A n thnh ph B i qua mt s nh ga. Tuyn ng c th biu din bi

mt on thng, cc nh ga l cc im trn . Tuyn ng bt u t A v kt thc B, v th cc nh ga
s c nh s bt u t A (c s hiu l 1) v B l nh ga cui cng.
Gi v i li gia hai nh ga ch ph thuc vo khong cch gia chng. Cch tnh gi v nh sau:
Khong cch gia hai nh ga (X)
Khong cch 0 < X <= L1 -> Gi v C1
Ngha l vi cc gi v C1, C2, C3 tng ng bn s i qung ng ti a l L1, L2, L3.
346

V i thng t nh ga ny n nh ga khc ch c th t mua nu khong cch gia chng khng vt
qu L3. V th nhiu khi i t nh ga ny n nh ga khc ta phi t mua mt s v. Hn th na, nhn
vin ng st yu cu hnh khch ch c gi ng mt v khi i trn tu v v s b hu khi hnh
khch xung tu.
Yu cu: Tm cch t mua v i li gia hai nh ga cho trc vi chi ph mua v l nh nht
Input
Dng u tin ghi cc s nguyn L1, L2, L3, C1, C2, C3 (1 <= L1 <= L2 <= L3 <= 1000000000; 1 <= C1
<= C2 <= C3 <= 1000000000) theo ng th t lit k trn.
Dng th hai cha s lng nh ga N ( 2 <= N <= 100000).
Dng th ba ghi hai s nguyn s, f l cc ch s ca hai nh ga cn tm cch t mua v vi chi ph nh nht
i li gia chng.
Dng th i trong s N - 1 dng tip theo ghi s nguyn l khong cch t nh ga A (ga 1) n nh ga th i +
1.
Output
Gm 1 dng duy nht ghi chi ph nh nht tm c
Example
Input:
3 6 8 20 30 40
7
2 6
3
7
8
13
15
23
Output:
70
Hnh Tinh
Ngy:
05-09-2008
im:
0.8
M bi:
NSP
S ngi gii c/
lm:
59 / 83
347

Loi bi:
acm
T l ng:
22.1%
Thi gian chy:
1s-1.5s
Bi chy tt nht:
Gii hn m ngun:
512B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
^Nuga Ci^
Nuga l mt c b thng minh, rt thch phiu lu. C thng lang thang trong v tr bng con tu siu tc
AlphaX. Mt hm, con tu ca Nuga i lc vo mt hnh tinh l.
Hnh tinh c dng mt hnh vung khng l, c cnh l N (nm nh sng). Do sc ht ca hnh tinh qu
ln, khng mt vt th no, k c nh sng c th thot ra ngoi c, chnh v th m hng my t nm nay,
khng ai pht hin ra s tn ti ca hnh tinh ny.
Trong lc thm d, Nuga pht hin ra hng triu vin hnh cu to bng c tri t nm ri rc khp hnh
tinh, mi vin mang mt nng lng ring. Khi qut bn hnh tinh ln my tnh, Nuga thy mt iu
rt c bit, l nu chia hnh tinh thnh N hng, N ct, nh s t 1 n N theo chiu t tri sang phi v
t trn xung di th mi vin nm gn trong mt vung.
Nh phn tch cc s liu, Nuga bit c b quyt m ca Hnh Tinh thot ra ngoi l phi kt
ni c sc mnh ca K vin thn k. Tuy nhin, Nuga phi nhanh chng xc nh v tr ca chng.
Cng vic ny ha ra li phc tp hn Nuga tng tng, bi hnh tinh qu rng ln. Ngh rng sp xp li
cc vin c th gip tm kim nhanh hn, Nuga sp xp cc vin trn mi hng theo th t nng
lng tng dn, ri sau li tip tc sp xp cc vin trn mi ct theo th t nng lng tng dn.
n y th va mt va i, Nuga cha tm c hng i tip theo. Bn hy gip Nuga vi!
Input
Dng u ghi s 2 nguyn dng: N l di 1 cnh ca hnh tinh, v K l s lng vin thn k.
N dng tip theo, mi dng ghi N s nguyn. Cc s nguyn khc nhau i mt. S nguyn dng
th I, ct th J th hin nng lng ca vin ti v tr (I, J) trn bn m Nuga sp xp.
K dng sau, mi dng ghi 1 s nguyn l nng lng ca 1 vin thn k cn tm. D liu m bo
tt c cc vin thn u c trn hnh tinh.
Output
Gm K dng, mi dng ghi 2 s nguyn I, J th hin v tr ca vin thn k tng ng vi nng

lng cho.
Hn ch
Nng lng ca mi vin nm trong khong [0, 2^31 - 1]
N 1000, K 10000.
V d
348
Input:
2 2
1 2
3 4
3
1
Output:
2 1
1 1
bi c gii hn li m ngun. Mt s bi AC vi source > 512B nn code li vi cch tt

hn
Tr chi trn ma trn

Ngy:
06-09-2008
im:
1.2
M bi:
QBGAME
S ngi gii c/
lm:
29 / 45
Loi bi:
oi
T l ng:
14.3%
Thi gian chy:
1s
Bi chy tt nht:
vhhvvh (100 im - 1.02s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
V Khnh Trung
Ngy nay cc nh khoa hc ngh ra 1 tr chi trn ma trn rt th v. Thng qua c th o IQ mt cch
kh hiu qu. Tr chi c m t nh sau:
Bn c 1 ma trn A kch thc 8 x N trn gm cc s nguyn l im ca cc . Ngi ta s yu cu
bn chn 1 tp khc rng cc trn ma trn ny sau tnh tng im trn nhng ny. Trong nhng
c chn khng c hai no k cnh. IQ ca ngi chi s t l thun vi s im nhn c. Sherry tham
gia tr chi v t kt qu kh tt.V by gi Sherry mun bit tng im ln nht nhn c trong tr chi
ny l bao nhiu. Bn hy gip sherry nh !!!
Input
Dng 1 l s nguyn N ( 1 <= N <= 10000 )
8 dng tip theo: Mi dng gm n s nguyn. S nguyn hng i, ct j l Aij ( |Aij| <= 108 )
Output
349

Gm 1 dng duy nht l s im ln nht tm c
Example
Input:
2
-22 2
-33 45
56 -60
-8 -38
79 66
-10 -23
99 46
1 -55
Output:
279
Gii thch:
Chn cc (3,1) (5,1) (7,1) (2,2)
Quan h c iu kin
Ngy:
06-09-2008
im:
1.5
M bi:
QBCOND
S ngi gii c/
lm:
13 / 22
Loi bi:
oi
T l ng:
22.9%
Thi gian chy:
0.25s
Bi chy tt nht:
iamme (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Ngy nay khi nghin cu quan h gia cc phn t cc nh khoa hc khng n gin ch nghin cu cc
quan h bnh thng m thm phn phc tp l thm vo 1 vi b iu kin. Mt trong nhng iu
kin l s quan h '='
Nh ta bit gia 2 phn t a, b s c 3 quan h:
a = b, a > b, a < b.
350

Cc nh khoa hc a ra 1 b gm n phn t. Sau khi tm ra s lng cc quan h ca n phn t ny h
mun bit nu nh s quan h '=' trong tp n phn t ny ng bng k th s c bao nhiu quan h nh th?
Input
Gm nhiu b s n, k. Mi b s trn 1 dng. Kt thc file l -1. ( 1 < n < 11 )
Output
Vi mi b s (n, k) a ra s quan h c iu kin tm c
Example
Input:
3 0
3 1
3 2
3 3
-1
Output:
6
6
0
1
Gii thch:
Vi b 3 phn t (a, b, c).
n=3, k=0:
a < b < c;
a < c < b;
b < a < c;
b < c < a;
c < a < b;
c < b < a;
a = b < c;
c < a = b;
a < b = c
b = c < a;
a = c < b;
b < a = c;
n=3, k=1:
n=3, k=3:
a = b = c;
The mightiest kingdom

Ngy:
07-09-2008
im:
1.9
351

M bi:
KINGDOM
S ngi gii c/
lm:
2/9
Loi bi:
oi
T l ng:
7.7%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:

Probem Setter: Sharif
Shah Newaj Bhuiyan
Ngn ng cho php:
Tt c
Thi xa c N ch ta lc trn mt vng t xa xm n, chin u tranh ginh ln nhau. Vua ca ch

hng mnh nht quyt nh chinh phc cc ch khc tm kim ngun du ha! Kho tng ca ch
ny b hn ch v tin c vo chin dch tranh c mi nht ca nh vua. Kho tng ban u c gi tr
l M.
Cc ch c nh s t 1 n N. ch 1 l ch hng mnh nht. Cc ch c ni vi nhau bi
cc ng ni hai chiu trong ch c ng mt ng i gia hai ch bt k.
Nh vua thu bn hoch ch chin lc cho ng. Cc ip vin ca nh vua cho bn hai thng s i vi
mi t nc i (i>1):
Vi = gi tr ca ngun du ha ca nc i
Ci = chi ph chinh phc nc i
Mt ch ch c th b chinh phc khi n k vi ch 1 hoc ch 1 chinh phc mt ch k vi

n (ni vi n qua mt con ng).
Bn hy hoch ch mt chin lc chinh phc cc ch khc sao cho tng gi tr thu c t ngun du
ha l ln nht. Khng c s dng qu gii hn ca kho tng!
D liu
Dng u tin cha s nguyn N (1 N 100) v M (0 M 2000).
Dng th hai cha N-1 s nguyn V2, V3..., VN (1 Vi 100).
Dng th ba cha N-1 s nguyn C2, C3,..., CN (0 Ci 30).
Mi dng trong N-1 dng tip theo cha hai s nguyn u, v th hin mt ng ni.
Kt qu
Mt s nguyn duy nht l tng gi tr ln nht t ngun du ha m ch hng mnh nht c th thu c
bng vic chinh phc cc nc khc.
V d
D liu
352

10 3
10 10 10 9 5 8 8 7 10
0 0 0 0 0 3 2 2 0
1 2
1 3
1 4
2 5
3 6
4 7
5 8
6 9
8 10
Kt qu
62
D liu
3 1
1 1
1 0
1 2
2 3
Kt qu
2
Bin Laden
Ngy:
07-09-2008
im:
0.9
M bi:
BINLADEN
S ngi gii c/
lm:
46 / 63
Loi bi:
oi
T l ng:
42.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:

Problem Setter: L n
Khu
Ngn ng cho php:
Tt c
353

Trm khng b Bin Laden trn trong 1 cn hm c o su xung mt t M tng, mi tng c N phng.
Cc phng c ngn cch bng cc ca rt kh ph. Cc phng c ca xung phng ngay pha di v 2
phng 2 bn. T trn mt t c N ca xung N phng tng -1. Bin Laden tng di cng (tng -M)
phng th N (phng bn phi nht). Mi ca c lm bng mt kim loi khc nhau vi dy khc nhau
nn vic ph ca cn thi gian khc nhau.
Bn hy tm cch i t mt t xung phng ca Bin Laden nhanh nht khng hn thot mt.
D liu
Dng 1 ghi M v N
Dng 2 n 2M + 1, dng chn ghi N s, dng l ghi N - 1 s l chi ph ph ca.
Kt qu
Ghi ra 1 s l thi gian nh nht n c phng ca Bin Laden
V d
D liu
4 2
99 10
1
10 99
1
99 10
1
10 99
1
Kt qu
44
+--99--+--10--+
|
+--10--+--99--+
|
+--99--+--10--+
|
354

+--10--+--99--+
|
+------+------+
i theo ng zigzac
Gii hn
1 <= M <= 2222
1 <= N <= 10
Chi ph ca cc cnh ca thuc [0, 1000].
Computer lab
Ngy:
07-09-2008
im:
1.8
M bi:
WIFI
S ngi gii c/
lm:
5/7
Loi bi:
oi
T l ng:
41.6%
Thi gian chy:
0.5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:

Problem Setter: L n
Khu
Ngn ng cho php:
Tt c
Cuc thi ACM sp ti ti thnh ph H Ch Minh s c N i thi. Ban t chc b tr N my thi cho cc i,
i i ngi ti v tr xi yi. cc i c th truy cp h thng np bi d dng, ban t chc b tr M access
point. Ban t chc mun t chc phng my sao cho:
Mi my tnh c kt ni vi ng 1 access point.
S lng my kt ni vi cc access point chnh lch khng qu 1.
Tng "chp chn" ca mng l nh nht. chp chn ca mt my c tnh bng bnh phng
khong cch gia my vi access point m my kt ni ti.
D liu
Dng th nht ghi 2 s M v N.
M dng tip theo, mi dng ghi 2 s l ta ca cc access point.
N dng tip theo, mi dng ghi 2 s l ta ca cc my tnh.

355
Kt qu
Dng th nht ghi ra tng chp chn ca mng nh nht c th.
Dng th 2 ghi N s. S th i l s hiu ca access point m my th i kt ni ti.
V d
D liu
2 3
0 0
2 1
1 0
1 1
1 2
Kt qu
4
1 2 2
Hnh v di y m t test v d trn. Cc my tnh l cc hnh vung mu en, cc access point l cc hnh
vung mu trng.
Gii hn
1 N 200, 1 M 50. Cc ta l nguyn v tr tuyt i khng qu 1000.
m dy
Ngy:
07-09-2008
im:
1.4
M bi:
PBCDEM
S ngi gii c/
lm:
18 / 54
Loi bi:
oi
T l ng:
10.1%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:

JAVA BASH PYTH
Ngun bi:
RUBY BF
Do anh Qunh t ba =))
m s dy tng dn( di dy phi >=2)c cc phn t nguyn dng m tng ng bng n

356
Gii hn
n<=4000
D liu vo
Ghi duy nht s n
D liu ra
Ghi ra s cch
V D
Input:
5
Output:
2
Gii thch: C 2 dy l (1,4)v (2,3)
Lu : B test mi c up,xin li cc bn v b test trc qu yu :))
Vn hon ho
Ngy:
08-09-2008
im:
1.7
M bi:
NPR
S ngi gii c/
lm:
7 / 13
Loi bi:
acm
T l ng:
18.2%
Thi gian chy:
20s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
IPSC
Cho mt danh sch t L v mt t w. Nhim v ca bn l phi tm mt t trong L to thnh mt "vn hon

ho" vi w. T u ny l duy nht xc nh bi cc thuc tinh sau:
N nm trong L.
N khc w.
Phn hu t chung ca chng di nht c th.
357
u l t c th t t in nh nht tho mn cc iu trn
Ch
Mt tin t ca mt t l mt chui c th thu c bng cch lp li vic xo k t cui cng ca t. Tng
t, mt hu t ca mt t l mt chui m c th thu c bng cch lp li vic xo k t u tin ca t.
V d vi t: different.
T ny va l tin t, va l hu t ca chnh n. mt tin t di nht khc ca n differen, v mt hu t di
nht khc ca n l ifferent. Chui rent cng l mt hu t khc nhng ngn hn. Chui eent v iffe u
khng phi l tin t hay hu t ca t different.
Gi u v v l 2 t khc nhau. Ta ni rng u c th t t in nh hn v nu hoc u l mt tin t ca v, hoc
nu i l v tr u tin m chng khc nhau, v k t th i ca u ng trc k t th i ca v trong bng ch
ci.
V d, dog nh hn dogs, t ny li nh hn dragon (V o nh hn r).
D liu
C 2 phn. Phn th nht cha danh sch t L, mi t trn 1 dng. Mi t ch cha cc ch ci thng ting
Anh v khng c 2 no t ging nhau.
Phn th nht kt thc bng mt dng trng.
Tip theo l phn 2, vi mi cu hi cho t w trn mt dng.
Bn c th chc chn rng trong c 2 phn ca d liu vo, di ca mi t khng qu 30. V s lng t
trong mi phn khng qu 250000.
Kt qu
Vi mi cu hi, vit ra trn mt dng t m to thnh vn hon ho vi n. Kt qu phi vit bng ch ci
thng.
V d
D liu
perfect
rhyme
crime
time
crime
rhyme
Kt qu
time
crime
358

Trong cu hi th 2, c 2 t c cng di hu t vi rhyme (l crime v time), t c th t t in nh hn
c chn.
Cnh bo: File d liu v kt qu rt ln, cn thn vi mt s ngn ng
Tp hp ng
Ngy:
09-09-2008
im:
1.6
M bi:
CPPSET
S ngi gii c/
lm:
11 / 14
Loi bi:
acm
T l ng:
38.9%
Thi gian chy:
1.5s
Bi chy tt nht:
banana (100 im - 0.94s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
C++
Ngun bi:
VNOI
Cho mt tp hp S cc s nguyn, bn hy lp trnh thc hin cc thao tc sau:
ADD x: thm s x vo tp S
DELETE x: xa s x khi tp S
MININUM: tm s nh nht trong tp S
MAXIMUM: tm s ln nht trong tp S
SUCC x: tm s nh nht ln hn x trong tp S
SUCC_2 x: tm s nh nht v khng nh hn x trong tp S
PRED x: tm s ln nht nh hn x trong tp S
PRED_2 x: tm s ln nht khng vt qu x trong tp S
Ghi ch: i vi thao tc DELETE, gi nguyn tp S nu x khng c trong tp S. i vi cc thao tc

MINIMUM, MAXIMUM, SUCC, SUCC_2, PRED v PRED_2, in ra 'empty' nu tp S rng. i vi cc
thao tc SUCC, SUCC_2, PRED v PRED_2, in ra 'no' nu khng tm c s tha mn.
Cc thao tc ADD, DELETE, MINIMUM, MAXIMUM, SUCC, SUCC_2, PRED, PRED_2 ln lt c
m ha bi cc ch s 1 2 3 4 5 6 7 8.
D liu
Gm nhiu dng, mi dng bt u bng mt s t 0 n 8 cho bit ch s thao tc cn thc hin. S 0 bo
hiu kt thc d liu nhp. i vi cc thao tc 1, 2, 5, 6, 7, 8, s tip theo trn dng l s nguyn x (|x|
109) cho bit tham s ca thao tc. Bit s thao tc cn thc hin khng vt qu 300000.
Kt qu
i vi mi thao tc loi 3, 4, 5, 6, 7, 8 in ra mt dng l kt qu ca thao tc.
359
V d
D liu
4
1 10
1 5
3
1 7
4
2 5
3
5 10
6 10
7 10
8 10
2 10
7 100
0
Kt qu
empty
5
10
7
no
10
7
10
7
Gi
Bn hy dng cu trc set trong th vin STL ca C++. Bi ny bn ch np c bng C++ m thi.
Tp hp ng (Pascal Version)
Ngy:
09-09-2008
im:
1.5
M bi:
PASSET
S ngi gii c/
lm:
14 / 15
Loi bi:
acm
T l ng:
40.6%
Thi gian chy:
1.5s
Bi chy tt nht:
duyhung123abc (100
360

im - 1.02s)
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngn ng cho php:
PAS fpc
Ngun bi:
VNOI
Binary multiplication
Ngy:
10-09-2008
im:
1.7
M bi:
MUL2COM
S ngi gii c/
lm:
8/9
Loi bi:
acm
T l ng:
26.5%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VNOI
y l mt s kin thc v biu din s trn my tnh trc khi cc bn gii bi ton ny. Vi n bit, my tnh
c th biu din c 2n s trong phm vi -2n-1..(2n-1-1). My tnh s dng cc s b 2 biu din cc s
m. Trong cch biu din s b 2 c n bit th:
S x 0 c biu din bng chnh s x.
S x < 0 c biu din bng s 2n - x.
Di y l bng biu din s b 2 vi 3 bit:

Biu din s b 2
Gi tr
000
001
010
011
100
-4
101
-3
110
-2
111
-1
u im ca s b 2 l php cng c th thc hin hon ton nh cc s khng du. Vi x > 0, x + (-x) = 2n
= 0 v cc s ch c biu din bi n bit. V d, xt php cng (-2) + 3 trong biu din s b hai 3 bit:
110
361

+011
--001
Kt qu bng 1.
Vi x 0, biu din s b 2 ca -x s thu c bng cch o ton b bit ca x v cng thm 1 n v. Ni
cch khc -x = (NOT x) + 1. ch ra biu thc ny ng, ta nhn xt rng NOT x = 2n-1-x, do (NOT x)
+ 1 = 2n-x chnh l biu din ca s -x. Vi x < 0, ta cng c -x = (NOT x) + 1.
Trong bi ton ny, bn cn thc hin php nhn hai s b hai c n bit. Kt qu tr v cng l mt s b hai
n bit. Bn hy thng bo li nu kt qu vt qu phm vi biu din.
D liu
Gm nhiu b test, mi b test c dng nh sau:
Dng u tin cha s n (0 n 1024) l s bit. n=0 cho bit kt thc d liu nhp. Nu n>0, hai dng tip
theo, mi dng cha mt s b hai c n bit.
C khng qu 40 b test.
Kt qu
Gm nhiu dng, mi dng tng ng vi mt test cha mt s b hai vi s bit tng ng l kt qu ca
php nhn hoc cha chui 'overflow' nu kt qu vt qua phm vi biu din.
V d
D liu
3
110
011
4
0011
1110
0
Kt qu
overflow
1010
Ai l sp
Ngy:
10-09-2008
im:
1.6
362

M bi:
BOSS
S ngi gii c/
lm:
11 / 16
Loi bi:
acm
T l ng:
19.7%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
NWERC 2003
mt cng ty n c mt quy nh kh l lng l Sp th khng c thp hn nhn vin! Sp trc tip

ca mt nhn vin A c nh ngha l nhn vin c chiu cao khng thp hn A v c mc lng nh
nht nhng vn cao hn A. Quan h lnh c nh ngha quy nh sau, nu A l sp ca B th B v cc
lnh ca B u l lnh ca A.
Bit cng ty ny c N nhn vin v mt s truy vn n cc nhn vin. Vi mi truy vn, bn hay tm sp
trc tip v s lng lnh ca nhn vin .
D liu
Dng u tin cha s lng test. Mi test c cu trc nh sau:
Dng 1 cha hai s N v Q l s nhn vin v s truy vn (1 N 30000, 1 Q 200)
N dng tip theo mi dng cha thng tin v mt nhn vin gm 3 s nguyn: s hiu ca nhn vin
(lun c 6 ch s, ch s u tin khc 0), lng v chiu cao. Lng khng vt qu 10000000.
Chiu cao trong phm vi 1000000 n 2500000.
Q dng tip theo mi dng cha s hiu ca mt nhn vin cn truy vn.
Kt qu
Vi mi truy vn in ra hai s nguyn l s hiu ca sp trc tip v s lnh. Nu khng c sp th in ra s 0.
V d
D liu
2
3 3
123456 14323 1700000
123458 41412 1900000
123457 15221 1800000
123456
123458
123457
4 4
200002 12234 1832001
200003 15002 1745201
363

200004 18745 1883410
200001 24834 1921313
200004
200002
200003
200001
Kt qu
123457 0
0 2
123458 1
200001 2
200004 0
200004 0
0 3
34 ng xu
Ngy:
10-09-2008
im:
1.0
M bi:
COIN34
S ngi gii c/
lm:
43 / 53
Loi bi:
acm
T l ng:
28.1%
Thi gian chy:
1s
Bi chy tt nht:
p_anphu (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
NUS ACM Training
Bn c 34 ng xu c gi tr nh sau:
xu(1) c gi tr 2
xu(2) c gi tr 3
xu(3) c gi tr 5
for n = 4 to 34
xu(n) c gi tr (xu(n-1) + xu(n-2) + xu(n-3))
Bn hy dng nhiu ng xu nht mua mt mn hng c gi l X!
D liu
Dng u tin l s test (khng qu 1000). Mi dng tip theo cha mt s nguyn X (1 X
2000000000).
Kt qu
364

Vi mi test, in ra "Case #" + s hiu test + ": " + s lng ln nht ng xu cn dng. Nu khng c cch
no t gi tr X th in ra -1.
V d
D liu
4
1
5
8
9
Kt qu
Case #1: -1
Case #2: 2
Case #3: 2
Case #4: -1
Ly tha
Ngy:
10-09-2008
im:
0.7
M bi:
POWER
S ngi gii c/
lm:
69 / 77
Loi bi:
acm
T l ng:
38.9%
Thi gian chy:
1s
Bi chy tt nht:
nt_d2 (100 im - 0.06s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
NUS ACM Training
Cho l, r sao cho 2 l r 1012. Tm k nguyn dng ln nht sao cho tn ti s nguyn dng x l xk
r.
D liu
Dng u tin l s lng test. Mi dng tip theo cha hai s nguyn l, r biu th mt test.
Kt qu
i vi mi test in ra "Case #" + s hiu test + ": " + s k ln nht tm c.
V d
D liu
365

4
5 20
10 12
2 100
1000000000000 1000000000000
Kt qu
Case #1: 4
Case #2: 1
Case #3: 6
Case #4: 12
Phn t trung v
Ngy:
14-09-2008
im:
1.3
M bi:
MEDIAN
S ngi gii c/
lm:
20 / 24
Loi bi:
acm
T l ng:
33.3%
Thi gian chy:
5s
Bi chy tt nht:
vhhvvh (100 im - 0.31s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
NUS ACM Training
Cho mt dy s a1, a2, ..., an c sinh ngu nhin nh sau:
a1=seed
ai=(ai-1*mul+add)%65536
Vi mul, add, seed l cc s cho trc.

Cho mt s k n. Dy cho c n-k+1 dy con di k. Hy tnh tng tt c cc phn t trung v (phn t
nh th (k+1)/2) ca n-k+1 dy con ny).
D liu
Dng u tin cha s test (khng qu 30). Mi dng tip theo cha 5 s nguyn seed, mul, add, N, K. (0
seed, mul, add 65535, 1 N 250000, 1 K 5000, K N)
Kt qu
Vi mi test in ra s hiu test (theo mu) cng vi tng cc trung v tm c.
V d
366

D liu
5
3 1 1 10 3
10 0 13 5 2
4123 2341 1231 7 3
47 5621 1 125000 1700
32321 46543 32552 17 17
Kt qu
Case #1: 60
Case #2: 49
Case #3: 102186
Case #4: 4040137193
Case #5: 25569
Gii thch
Vi test 1, dy sinh ra l 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12.
Cc dy con l (3, 4, 5), ..., (10, 11, 12).
Cc trung v l 4, 5, ..., 11.
VOI07 Dy con khng gim di nht

Ngy:
21-09-2008
im:
0.5
M bi:
QBMSEQ
S ngi gii c/
lm:
117 / 140
Loi bi:
oi
T l ng:
31.6%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Informatics 2007
Cho dy s nguyn dng a1, a2, ..., an.

Dy s: ai, ai+1, ..., aj tha mn ai ai+1 ... aj. Vi 1 i j n c gi l dy con khng gim ca dy s
cho v khi s j-i+1 c gi l di ca dy con ny.
Yu cu: Trong s cc dy con khng gim ca dy s cho m cc phn t ca n u thuc dy s {uk}
xc nh bi u1 = 1, uk = uk-1 + k (k 2), hy tm dy con c di ln nht.
Input
367

Dng u tin cha mt s nguyn dng n (n 104).
Dng th i trong n dng tip theo cha mt s nguyn dng ai (ai 108) l s hng th i ca dy s cho,
i = 1, 2, ..., n.
Output
Gm 1 dng duy nht ghi s nguyn d l di ca dy con khng gim tm c (quy c rng nu khng
c dy con no tha mn iu kin t ra th d = 0).
Example
Input:
8
2
2007
6
6
15
16
3
21
Output:
3
VOI07 Siu th may mn

Ngy:
21-09-2008
im:
2.0
M bi:
QBMARKET
S ngi gii c/
lm:
0 / 50
Loi bi:
oi
T l ng:
0.0%
Thi gian chy:
1s-10s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Informatics 2007
An c mi tham gia tr chi Siu th may mn do i truyn hnh ZTV t chc.

Siu th c t trong trng quay truyn hnh c n mt hng c nh s t 1 n n v mt hng th i
c nim yt gi l ci ng, i = 1, 2, ..., n.
368

Theo th l ca tr chi, An c ban t chc tng mt th mua hng c gi tr l s ng v phi dng ht s
tin trong th ny mua hng trong siu th vi iu kin mt hng th i ch c mua vi s lng nhiu
nht l mi, i = 1, 2, , n.
An s l ngi thng cuc nu tm c tng s cch mua hng tha mn yu cu t ra v ch ra mt cch
mua hng nu c.
Yu cu: Hy gip An tr thnh ngi thng cuc khi cho bn bit trc cc gi tr n, s, ci v mi (1 n
500; 1 s 105; 1 ci 104; 1 mi 100) vi i = 1, 2, , n.
Input
Dng u tin cha hai s nguyn dng s v n.
Dng th i trong n dng tip theo cha hai s nguyn dng ci v mi vi i = 1, 2, , n.
Output
Gm 1 dng duy nht ghi s nguyn d l tng s cch mua hng tm c.
Example
Input:
12 3
4 1
6 2
2 1
Output:
2
VOI07 Robot cu ha
Ngy:
21-09-2008
im:
0.9
M bi:
QBROBOT
S ngi gii c/
lm:
45 / 62
Loi bi:
oi
T l ng:
26.5%
Thi gian chy:
1s
Bi chy tt nht:
mr_luu91 (100 im 0.33s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Informatics 2007
369

Trn mt mng li giao thng c n nt, cc nt c nh s t 1 n n v gia hai nt bt k c khng
qu mt ng ni trc tip (ng ni trc tip l mt ng hai chiu). Ta gi ng i t nt s n nt t
l mt dy cc nt v cc ng ni trc tip c dng:
s = u1, e1, u2,..., ui, ei, ui+1, ..., uk-1, ek-1, uk = t,
trong u1, u2, , uk l cc nt trong mng li giao thng, ei l ng ni trc tip gia nt ui v ui+1
(khng c nt uj no xut hin nhiu hn mt ln trong dy trn, j = 1, 2, , k).
Bit rng mng li giao thng c xt lun c t nht mt ng i t nt 1 n nt n.
Mt robot cha y bnh vi w n v nng lng, cn i t trm cu ho t ti nt 1 n ni xy ra ho
hon nt n, trong thi gian t nht c th. Thi gian v chi ph nng lng robot i trn ng ni trc
tip t nt i n nt j tng ng l tij v cij (1 i, j n). Robot ch c th i c trn ng ni trc tip t
nt i n nt j nu nng lng cn li trong bnh cha khng t hn cij (1 i, j n). Nu robot i n mt nt
c trm tip nng lng (mt nt c th c hoc khng c trm tip nng lng) th n t ng c np
y nng lng vo bnh cha vi thi gian np coi nh khng ng k.
Yu cu: Hy xc nh gi tr w nh nht robot i c trn mt ng i t nt 1 n nt n trong thi
gian t nht.
Input
Dng u tin cha mt s nguyn dng n (2 n 500);
Dng th hai cha n s, trong s th j bng 1 hoc 0 tng ng nt j c hoc khng c trm tip nng
lng (j = 1, 2, , n);
Dng th ba cha s nguyn dng m (m 30000) l s ng ni trc tip c trong mng li giao thng;
Dng th k trong s m dng tip theo cha 4 s nguyn dng i, j, tij, cij (tij, cij 10000) m t ng ni
trc tip t nt i n nt j, thi gian v chi ph nng lng tng ng.
Hai s lin tip trn mt dng trong file d liu cch nhau t nht mt du cch.
Output
Ghi ra s nguyn dng w tm c.
Example
Input:
4
0 1 1 0
5
1 2 5 4
1 3 4 3
1 4 9 4
2 4 4 1
370

3 4 5 2
Output:
3
H Thin Nga
Ngy:
22-09-2008
im:
1.3
M bi:
LABUDOVI
S ngi gii c/
lm:
23 / 40
Loi bi:
acm
T l ng:
16.4%
Thi gian chy:
1s-3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:

JAVA FORT BASH
Ngun bi:
PYTH RUBY
Anh Qunh ba i add

=))
Hai con thin nga ang trong mt ci h ln, nhng chng li ang b chia ct bi bng ng trong h
nc. H nc c dng hnh ch nht c chia thnh R dng C ct. Mt s trong h b bng ng. Ma
xun ti dn, bng trong h tan dn mi ngy bng tt c nhng tip xc vi nc ang m dn trong
h (tc l k cnh mt khng b ng bng) s tan ra.
V D
Thin nga c th di chuyn t do nhng cha nc nhng khng th i qua nhng b ng bng. Bn
hy tnh xem sau bao nhiu ngy th i thin nga ca chng ta c th gp nhau
D liu vo
Dng u tin cha 2 s R v C, 1 R, C 1500.
Mi dng trong R dng tip theo cha C k t m t h nc ti thi im hin ti: '.' (dot) th hin 1
cha nc, 'X' th hin 1 b ng bng, v 'L' th hin c thin nga. C chnh xc 2 ch L.
D liu ra
Mt dng duy nht cha s ngy i thin nga c th gp nhau.
371

Input:
10 2
.L
..
XX
XX
XX
XX
XX
XX
..
.L
Output:
3
Nhng hnh nhn nhy ma

Ngy:
26-09-2008
im:
1.1
M bi:
DANCING
S ngi gii c/
lm:
35 / 46
Loi bi:
oi
T l ng:
36.9%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
voj
Ngun bi:

c
Ngn ng cho php:
Tt c
Nhng hnh nhn nhy ma l mt loi mt m b n xut hin trong mt cu chuyn v thm t Sherlock
Homes. Ngy nay, ngi ta vn cn dng loi mt m ny, nhng cc hnh nhn c truyn i bng hnh
nh qua Internet v kh gii m hn. Chng s t ng bin i i theo thi gian tr nn kh nhn dng
so vi mt m ban u. Cc hnh nhn c chiu cao khc nhau, mi hnh nhn c th quay ln pha trn hoc
quay xung pha di.
tin li, ta quy c chiu cao ca mi hnh nhn l s dng nu quay u ln trn v s m nu quay
u xung di. Sau mi giy, cc hnh nhn s bin i nh sau. Ba hnh nhn lin tip bt k s c
chn. Chiu cao ca hai hnh nhn bn tri v phi s c cng thm mt lng bng chiu cao k c
du ca hnh nhn gia. Sau , hnh nhn gia s quay ngc u li. Hnh di y minh ha s bin
i ca ba hnh nhn lin tip:
372
Bit rng ban u, cc hnh nhn u quay ln pha trn.

Bit dy cc hnh nhn ti mt thi im no , bn hy xc dnh dy hnh nhn ban u, hoc thng bo
dy hnh nhn khng hp l, nu khng tm c dy hnh nhn ban u hoc dy hnh nhn ban u khng
phi l duy nht.
D liu
Dng 1: cha s nguyn dng N, l s lng hnh nhn trn dy.
Dng 2: cha N s nguyn a1, a2, a3, ..., an. Trong |ai| cho bit chiu cao ca hnh nhn th i ti
mt thi im no , ai > 0 nu hnh nhn quay u ln trn, v ai < 0 nu hnh nhn quay u
xung di.
Cc hnh nhn c nh s th t t 1 n N t tri sang phi.
Kt qa
Gm mt dng duy nht cha:
S -1 nu khng tm c dy hnh nhn ban u hoc dy hnh nhn ban u khng phi l duy
nht.
Hoc N s nguyn b1, b2, ..., bn l dy hnh nhn ban u, vi cng kiu m t nh trong d liu vo.
b1, b2, ..., bn phi l s nguyn dng, v cc hnh nhn ban u u quay ln trn.
Gii hn
1 N 105.
1 |ai| 5000.
V d
D liu
5
2451 -1647 -244 1006 1130
Kt qu
560 244 762 885 245
VOI06 Chn
Ngy:
28-09-2008
im:
0.8
373

M bi:
QBSELECT
S ngi gii c/
lm:
58 / 77
Loi bi:
oi
T l ng:
30.3%
Thi gian chy:
1s
Bi chy tt nht:
changbietgi (100 im 0.26s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Informatics 2006 - Bng B
Cho mt bng hnh ch nht kch thc 4n vung. Cc dng c nh s t 1 n 4, t trn xung
di, cc ct c nh s t 1 n n t tri qua phi.
nm trn giao ca dng i v ct j c gi l (i,j). Trn mi (i,j) c ghi mt s nguyn aij , i =1, 2, 3,
4; j =1, 2, ..., n. Mt cch chn l vic xc nh mt tp con khc rng S ca tp tt c cc ca bng sao
cho khng c hai no trong S c chung cnh. Cc trong tp S c gi l c chn, tng cc s trong
cc c chn c gi l trng lng ca cch chn. Tm cch chn sao cho trng lng l ln nht.
V d: Xt bng vi n=3 trong hnh v di y:
Cch chn cn tm l tp cc S = {(3,1), (1,2), (4,2), (3,3)} vi trng lng 32.
Input
Dng u tin cha s nguyn dng n l s ct ca bng.
Ct th j trong s n ct tip theo cha 4 s nguyn a1j, a2j, a3j, a4j, hai s lin tip cch nhau t nht mt du
cch, l 4 s trn ct j ca bng.
Output
Gm 1 dng duy nht l trng lng ca cch chn tm c.
Example
Input:
3
-1 9 3
-4 5 -6
7
8 9
7 2
Output:
32
374
Hn ch
Trong tt c cc test: n 10000, |aij| 30000. C 50% s lng test vi n 1000.
VOI06 Qun tng

Ngy:
28-09-2008
im:
0.7
M bi:
QBBISHOP
S ngi gii c/
lm:
76 / 94
Loi bi:
oi
T l ng:
30.0%
Thi gian chy:
1s
Bi chy tt nht:
khanhptnk (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Xt bn c vung kch 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 phi.
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 tr ang ng qun tng ch c th di
chuyn n c nhng trn cng ng cho vi n m trn ng i khng phi qua cc c qun
Cn phi a qun tng t xut pht (p, q) v ch (s,t). Gi thit l ch 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
ch, 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 gin nh vy.
Yu cu: Cho kch thc bn c n, s qun c hin c trn bn c m v v tr ca chng, xut pht v
ch ca qun tng. Hy xc nh s nc i t nht cn thc hin a qun tng v ch 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 tr qun th
i.
Hai s lin tip trn cng mt dng c ghi cch nhau t nht mt du cch.
375
Output
Gm 1 dng duy nht l s nc i tm c
Example
Input:
8 3 7 2 1 4
5 4
3 4
4 7
Output:
3
Hn ch:
Trong tt c cc test: 1 n 200. C 60% s lng test vi n 20.
VOI06 Knh xung yu

Ngy:
28-09-2008
im:
2.0
M bi:
QBCIRARC
S ngi gii c/
lm:
0 / 22
Loi bi:
oi
T l ng:
0.0%
Thi gian chy:
3s
Bi chy tt nht:
conankudo (71.43 im 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Mt h thng n my tnh (cc my tnh c nh s t 1 n n) c ni li thnh mt mng bi m knh

ni, mi knh ni hai my no v cho php truyn tin mt chiu t my ny n my kia. Ta gi mt
mch vng ca mng cho l mt dy cc my tnh v cc knh ni chng c dng:
u1, e1, u2, ...,ui, ei, ui+1, ..., uk-1, ek-1, uk, ek, u1
Trong u1, u2, ..., uk l cc my tnh khc nhau trong mng, ei knh truyn tin t my ui n my ui+1 (i =
1, 2, ..., k-1), ek l knh truyn tin t my uk n my u1. Mt knh truyn tin trong mng c gi l knh
xung yu nu nh bt c mch vng no ca mng cng u cha n.
Yu cu: Hy xc nh tt c cc knh xung yu ca mng cho.
376
Input
Dng u tin cha 2 s nguyn dng n v m.
Dng th i trong s m dng tip theo m t knh ni th i bao gm hai s nguyn dng ui, vi cho bit knh
ni th i cho php truyn tin t my ui n my vi.
Output
Dng u tin ghi s nguyn k l s lng knh xung yu trong mng cho. Ghi k = -1 nu mng khng
cha knh xung yu.
Nu k>0 th mi dng trong s k dng tip theo ghi thng tin v mt knh xung yu tm c theo qui cch
m t ging nh trong file d liu vo. ng thi cc knh c in ra theo th t t in
Example
Input:
2 2
1 2
2 1
Output:
2
1 2
2 1
Hn ch:
Trong tt c cc test: n 1000, m 20000. C 50% s lng test vi n 200.
VOI06 Bin i bng

Ngy:
28-09-2008
im:
2.0
M bi:
QBCHANGE
S ngi gii c/
lm:
1 / 10
Loi bi:
oi
T l ng:
3.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
377

Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Cho mt bng hnh ch nht kch thc mn vung kch thc n v. Cc dng c nh s t 1 n m,
t trn xung di. Cc ct c nh s t 1 n n, t tri qua phi.
Mi ca bng hoc c trng hoc cha mt k t ly t tp S gm cc ch s t 0 n 9 v cc ch

ci la tinh in hoa t A n Z. Hai cha cng mt k t c gi l ging nhau. Mi k t ca tp S xut
hin khng qu 4 trong bng.
Hai ging nhau c th xo c nu chng c cnh chung hoc c th ni cc tm (giao im ca hai
ng cho) ca chng vi nhau bng mt ng gp khc gm khng qu 3 on thng di nguyn,
mi on song song vi cnh ca bng v ngoi tr hai cn xo, ng gp khc ch qua cc trng hay
nm ngoi bng. Cc b xo tr thnh trng. Mi ln xo mt cp ca bng c gi l mt bc.
Hnh bn trn nu v d vi trng hp m = 4 v n = 6. Bc u tin c th xo hai cha k t A, tip
theo, ln lt xo cc cp cha B, cha C v cp cha D. v d ny, sau khi thc hin 4 bc xo
c th, trong bng cn li 4 khng th xo c.
Yu cu: Cho m, n v m xu di n m t cc dng ca bng. Hy xc nh s lng ln nht c th xo
c.
Input
Dng u tin cha 2 s nguyn m, n c ghi cch nhau bi du cch.
Dng th i+1 cha xu n k t m t dng th i ca bng (i = 1, 2, ..., m). Cc trng c th hin bng
du chm (.).
Output
Gm mt s nguyn duy nht l s lng ln nht c th xo c.
Example
Input:
4 5
ABD...
C.12..
..21C.
A.B.D.
Output:
8
Hn ch:
378

Trong tt c cc test: 0 < m 10, 0 < n 10. C 60% s lng test c m 5, n 6 v s lng cc khc
trng khng qu
VOI05 Phn on
Ngy:
30-09-2008
im:
1.7
M bi:
QBSEGPAR
S ngi gii c/
lm:
7 / 19
Loi bi:
oi
T l ng:
12.9%
Thi gian chy:
3s
Bi chy tt nht:
gothdn (100 im - 3.03s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Informatics 2005 - Bng A
Cho dy s nguyn a1, a2, , an v s nguyn dng k. Ta gi k-phn on ca dy s cho l cch chia
dy s cho ra thnh k on, mi on l mt dy con gm cc phn t lin tip ca dy. Chnh xc hn,
mt k-phn on c xc nh bi dy ch s
1 <= n1 < n2 < n3 < ... < nk = n
on th i l dy con ani-1+1, ani-1+2, ..., ani, i=1, 2, ..k. y quy c n0=0
Yu cu: Hy xc nh s M nh nht tn ti k-phn on sao cho tng cc phn t trong mi on u
khng vt qu M.
Input
Dng u tin cha hai s nguyn n v k (1 k n 15000).
Dng th i trong s n dng tip theo cha s nguyn ai (|ai| 30000), i =1, 2, , n.
Cc s cnh nhau trn mt dng trong file d liu cch nhau t nht mt du cch.
Output
Gm mt s nguyn duy nht l gi tr M tm c.
Example
Input:
9 4
1
1
379

1
3
2
2
1
3
1
Output:
5
VOI05 Pho hoa

Ngy:
30-09-2008
im:
1.8
M bi:
QBFIREWK
S ngi gii c/
lm:
4/7
Loi bi:
oi
T l ng:
36.3%
Thi gian chy:
1s
Bi chy tt nht:
changbietgi (100 im 0.41s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Nhm cho mng cc ngy l ln trong nm 2005 ngi ta ch to mt loi n pho hoa mi, khi bn,
n n thnh bng hoa 2n cnh mu ( 1 n 30). Nguyn vt liu cho php to c m mu khc nhau,
nh s t 1 n m (2 m 32).
m bo tnh m thut, vic chuyn tip mu gia 2 cnh hoa k nhau phi tun theo quy tc chuyn
mu cu vng sau y:
- Bn cnh cnh hoa mu i phi l cnh hoa mu i-1 hoc i+1, vi 1 < i < m.
- Bn cnh cnh hoa mu 1 ch c th l cnh hoa mu 2.
- Bn cnh cnh hoa mu m ch c th l cnh hoa mu m-1.
Mt bng hoa khng nht thit phi c y m mu. Mi bng hoa tng ng vi mt vng trn 2n s th
hin mu ca cc cnh hoa. V d, hnh 1 l bng hoa 24 cnh (n = 12) v hnh 2 l vng trn s tng ng
vi n. Mi bng hoa c m t bng dy 2n s nguyn lit k cc ch s mu ca cc cnh hoa theo chiu
kim ng h. V d, bng hoa hnh 1 c th c m t bng dy s
3 4 3 2 1 2 3 4 3 2 1 2 3 4 3 2 1 2 3 4 3 4 3 2.
380

Dy c th t t in nh nht trong cc dy c th dng m t hoa c gi l m hoa. Khi , m hoa
ca bng hoa hnh 1 s l
1 2 3 4 3 2 1 2 3 4 3 2 1 2 3 4 3 4 3 2 3 4 3 2.
Trong cc ngy l, Ban t chc yu cu bn cc n pho hoa 2n cnh c ng k cnh mu C (0 k 2).
Cc m hoa tha mn yu cu va nu cng c sp xp theo th t t in v nh s bt u t 1. Hn
na, nhm to ra cc hoa khng ging nhau, i bn pho hoa cn m bo hai vin n pho hoa bn lin
tip phi c m khc nhau. Do vy, ngi ta thit k mt H thng chp nh v phn tch t ng bo
cho i bn pho hoa bit s th t ca vin n pho hoa va n trn tri. Em c giao vit chng trnh
gii quyt nhim v chnh trong phn mm phn tch t ng ny.
Yu cu: Cho bit n, m, k v C. Gi X l tp tt c cc m hoa 2n cnh c ng k cnh mu C.
- Hy xc nh s lng p cc phn t ca X.
- Cho mt m hoa no trong tp X. Hy xc nh s th t t in ca n trong X.
Input
Dng u tin cha 4 s nguyn n, m, k, C.
Dng tip theo cha 2n s nguyn m t mt m hoa.
Cc s trn mt dng ca file d liu cch nhau t nht mt du cch.
Output
Dng u tin ghi s nguyn p.
Dng tip theo ghi s th t tm c ca m hoa.
Example
Input:
3 4 0 1
2 3 4 3 4 3
Output:
4
3
VOI05 B su tp
Ngy:
30-09-2008
im:
1.0
381

M bi:
COLLECT
S ngi gii c/
lm:
41 / 55
Loi bi:
oi
T l ng:
17.9%
Thi gian chy:
1s
Bi chy tt nht:
tuyen_pro_vip (100 im
- 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Vietnam Olympiad of
Mt b su tp tin xu c c coi l c gi tr phi gm khng t hn Z0 ng tin vng, S0 ng tin bc

v M0 ng tin ng. B su tp ban u ca Alibaba c mt s lng nht nh cc ng tin vng, bc v
ng nhng cha phi l mt b su tp c gi tr.
Ti Tr s ca Hip hi nhng ngi su tm tin c c t mt my i tin gip hi vin i c cc
b su tp c gi tr.
Tuy nhin, my i ch h tr vic i tin trn gi theo quy tc i gi (Z1, S1, M1) ly gi (Z2, S2, M2)
ng tin. Cc quy tc i tin khc nhau tng i mt, c gn s hiu tun t 1,2,3, . . . v c cng b
trc. Hi vin c th to gi tin thch hp t b su tp ca mnh thc hin vic i tin. Cc ng tin
nhn c sau mi ln i c gp li vi cc ng tin m hi vin ang c thnh mt b su tp mi
v c th c s dng i trong nhng ln sau nu cn. S ln i khng hn ch, tuy nhin, l ngi
thc dng, Alibaba lun c gng gim ti mc ti a s ln i tin. Mt khc, ngn chn vic u c,
Hip hi quy nh, trong mi thi im, mi hi vin khng c gi qu 4 ng tin mi loi v khng
c php i tip khi i c mt b su tp c gi tr.
Yu cu: Cho bit s lng cc ng tin vng, bc, ng m Alibaba c ban u v cc quy tc i tin.
Hy ch ra tt c cc b su tp tin c c gi tr m Alibaba c th c c sau mt s ln i khng vt
qu k cho trc.
Input
Dng u ghi s nguyn dng K ( K <= 1000 )
Dng th 2 ghi 6 s nguyn khng m Z, S, M, Z0, S0, M0 ( 0 <= Z, S, M, Z0, S0, M0 <= 4 )
Cc dng tip theo mi dng ghi 6 s nguyn khng m Z1, S1, M1, Z2, S2, M2 xc nh mt quy tc i tin
(0 <= Z1, S1, M1, Z2, S2, M2 <= 4 )
Output
Nu khng tn ti cch i c c b su tp c gi tr, file kt qu ch gm mt s -1.
Trong trng hp ngc li, dng u ghi s v l s cc b tin c c gi tr m Alibaba c th i c.
Dng th i trong v dng tip theo ghi 4 s nguyn Zi, Si, Mi, ki m t b su tp c gi tr th i v s ln i
ki t nht khng vt qu k cn thc hin c c b su tp y. ( Cc b Zi, Si, Mi phi a ra theo th
t t in )
382
Example
Input:
2
4 0 1 3 3 3
1 0 1 1 1 1
2 0 1 1 3 3
Output:
1
3 3 3 1
Copying DNA
Ngy:
06-10-2008
im:
1.7
M bi:
COPYDNA
S ngi gii c/
lm:
6/9
Loi bi:
acm
T l ng:
28.6%
Thi gian chy:
2s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
NCPC 2007
Cho mt xu DNA S gm cc k t {A, C, G, T}. Bn s lm vic trn mt xu T, ban u c gi tr rng.

Tm s thao tc sao chp nh nht bin T thnh mt xu cho trc. Bit rng mi thao tc sao chp c
mt trong hai dng:
sao chp S i j k: sao chp on S[i..j] vo xu T bt u t v tr k
sao chp T i j k: sao chp on T[i..j] vo xu T bt u t v tr k
Lu nu i > j c ngha l ta sao chp on xu theo th t ngc. Mi k t trong T ch c to ra ng

mt ln, ngha l khng c sao chp ln k t .
V d: Vi S = ACTG hy to T = GTACTATTATA
1. To GT......... bng cch sao chp v o xu TG t S.
2. To GTAC....... bng cch sao chp AC t S.
3. To GTAC...TA.. bng cch sao chp TA t T.
4. To GTAC...TAAT bng cch sao chp v o xu TA t T.
5. To GTACAATTAAT bng cch sao chp AAT t T.
D liu
383

Dng u tin cha t l s b test. Vi mi test c hai dng cha xu S v xu T vi di khng qu 18.
Kt qu
Vi mi test, in ra s thao tc sao chp t nht to ra T t S, hoc in ra "impossible" nu khng th lm
c.
V d
D liu
5
ACGT
GTAC
A
C
ACGT
TGCA
ACGT
TCGATCGA
A
AAAAAAAAAAAAAAAAAA
Kt qu
2
impossible
1
4
6
Roads
Ngy:
06-10-2008
im:
0.9
M bi:
ROADS
S ngi gii c/
lm:
52 / 72
Loi bi:
acm
T l ng:
24.0%
Thi gian chy:
7s
Bi chy tt nht:
tienpro (100 im - 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:
Central European
Olympiad in Informatics
'98
Ngn ng cho php:
Tt c
384

C N thnh ph 1..N ni bi cc con ng mt chiu. Mi con ng c hai gi tr: di v chi ph phi
tr i qua. Bob thnh ph 1. Bn hy gip Bob tm ng i ngn nht n thnh ph N, bit rng Bob
ch c s tin c hn l K m thi.
D liu
Dng u tin ghi t l s test. Vi mi test, dng u ghi K (0 K 10000). Dng 2 ghi N, 2 N 100.
Dng 3 ghi R, 1 R 10000 l s ng ni. Mi dng trong N dng sau ghi 4 s nguyn S, D, L, T m t
mt con ng ni gia S v D vi di L ( 1 L 100) v chi ph T (0 T 100). Lu c th c nhiu
con ng ni gia hai thnh ph.
Kt qu
Vi mi test, in ra di ng i ngn nht t 1 n N m tng chi ph khng qu K. Nu khng tn ti, in
ra -1.
V d
D liu
2
5
6
7
1 2 2 3
2 4 3 3
3 4 2 4
1 3 4 1
4 6 2 1
3 5 2 0
5 4 3 2
0
4
4
1 4 5 2
1 2 1 0
2 3 1 1
3 4 1 0
Kt qu
11
-1
Boxes
385

Ngy:
06-10-2008
im:
1.6
M bi:
BOXES
S ngi gii c/
lm:
9 / 10
Loi bi:
acm
T l ng:
57.1%
Thi gian chy:
50s
Bi chy tt nht:
vhhvvh (100 im - 0.08s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
III Polish Olympiad in

Informatics, stage 3
C n ci hp xp theo vng trn nh s 1..n (1 n 1000) theo chiu kim ng h. Mi hp cha mt s

qu bng, tng s qu bng khng qu n.
Cn dch chuyn cc qu bng sao cho mi hp khng cha qu 1 qu. Mi bc, ta c th di chuyn mt
qu bng t mt hp sang mt trong hai hp bn cnh.
Tnh s bc di chuyn t nht.
D liu
Dng u tin cha t l s b test (t 20). Mi b test c dng:
Dng u tin: n - s hp.
Dng th hai: n s nguyn khng m l s qu bng trong cc hp
Kt qu
Vi mi b test in ra s bc t nht cn thit.
V d
D liu
1
12
0 0 2 4 3 1 0 0 0 0 0 1
Kt qu
19
Lights
Ngy:
10-10-2008
im:
1.1
M bi:
LIGHTS
S ngi gii c/
31 / 32
386

lm:
Loi bi:
acm
T l ng:
51.8%
Thi gian chy:
1s
Bi chy tt nht:
dat1511 (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
aukcwe
Ngn ng cho php:

Ngun bi:
JAVA C#
Croatian Regional
Competition in
Informatics 2006
H thng chiu sng ca rp ht c 2n bng n c xp thnh 2 hng mi hng c n bng. Mi bng c 2

trng thi l c bt sng hoc tt, ban u tt c cc n u c tt.
Nhng ngi th trang tr mun bt mt s bng n sao cho c th to thnh hnh nh p mt. H thng
iu khin ch cho php ta mi mt ln ch c th i trng thi t bt sang tt hoc t tt sang bt ca 2
bng n cng ct hoc 1 s bng n lin tip cng hng.
Yu cu:
Cho trc trng thi cui cng ca h thng n m nhng ngi th trang tr mong mun.
Tnh s ln bt hoc tt t nht c trng thi .
Hnh nh di y minh ha 7 bc t trng thi cui cng :

0
00000000000000000000
11100000000000000000
11100010000000000000
11100010000000000000
00000000000000000000
00000000000000000000
00000010000000000000
01111101100000000000
11101101111000000000
11101101111000111110
11101101111000101110
11101101111000101010
01111101100000000000
01111101100000000000
01111101100000010000
01111101100000010100
D liu:
Dng u tin cha s nguyn n l s bng n mi hng ((1 n 10 000).
2 dng tip theo, mi dng l trng thi ca mi hng n ti thi imcui cng, s 1 biu th 1
bng n ang sng v 0 l 1 bng n ang tt.
Kt qu:
a ra s ln bt hoc tt t nht c trng thi theo yu cu.
V d:
D liu :
20
11101101111000101010
387

01111101100000010100
Kt qu :
7
Mountain Walking
Ngy:
18-10-2008
im:
0.9
M bi:
MTWALK
S ngi gii c/
lm:
48 / 63
Loi bi:
acm
T l ng:
28.6%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.12s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO 2003 US Open
Cho mt bn kch thc NxN (2 <= N <= 100), mi mang gi tr l cao ca (0 <= cao <=
110). Bc John v b Bessie ang trn tri (dng 1, ct 1) v mun i n cabin (dng N, ct N). H c
th i sang phi, tri, ln trn v xung di nhng khng th i theo ng cho. Hy gip bc John v b
Bessie tm ng i sao cho chnh lch gia im cao nht v thp nht trn ng i l nh nht.
D liu
Dng 1: N
Dng 2..N+1: Mi dng cha N s nguyn, mi s cho bit cao ca mt .
Kt qu
Mt s nguyn l chnh lch cao nh nht.
V d
D liu
5
1 1 3 6 8
1 2 2 5 5
4 4 0 3 3
8 0 2 3 4
4 3 0 2 1
Kt qu
2
388
Lazy Cows
Ngy:
18-10-2008
im:
1.8
M bi:
LAZYCOWS
S ngi gii c/
lm:
5/6
Loi bi:
acm
T l ng:
28.9%
Thi gian chy:
9s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
US Open International
2005 Gold Division
Cho m hnh bi c c dng bng ch nht 2xB (1 <= B <= 15,000,000), trong mt s c con b ang
n c. C tt c N con b (1 <= N <= 1000) trn bi c. V d:
------------------------------------------------------|
| cow |
| cow | cow | cow | cow |
------------------------------------------------------|
| cow | cow | cow |
-------------------------------------------------------
Bc John mun dng K (1 <= K <= N) ci chung hnh ch nht che ph n b, sao cho tng din tch
c ph l nh nht. Khng c hai chung no c nm ln nhau. Hin nhin, cc chung phi che
ph ht cc c b.
V d, trong hnh trn nu K=2, li gii ti u bao gm mt chung kch thc 2x3 v mt chung kch
thc 1x4. Tng din tch c ph l 10.
D liu
Dng u tin cha mt s nguyn t l s b test. Mi b test c dng:
Dng 1: N, K, B
Dng 2..N+1: chc ta ca cc con b, trong phm vi (1,1) n (2,B). Khng c no cha hn 1
con b.
Kt qu
Vi mi test, in ra tng din tch nh nht cn ph.
V d
D liu
1
389

8 2 9
1 2
1 6
1 7
1 8
1 9
2 2
2 3
2 4
Kt qu
10
Bi-a
Ngy:
18-10-2008
im:
2.0
M bi:
POOL
S ngi gii c/
lm:
0/1
Loi bi:
oi
T l ng:
0.0%
Thi gian chy:
3s
Bi chy tt nht:
congminh91 (9.09 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP 2
Trong h trc ta Oxy nh hnh v, xt bn bi-a hnh ch nht c kch thc a x b (a, b chn). Bn bi-a
c 6 l (mi l c th xem nh mt im), trong 4 l t ng 4 nh ca bn, 2 l cn li c t
trung im cnh nm ngang. Coi qu bng bi-a nh mt cht im. Khi nh bng vo bng bng bt li
theo nh lut phn x nh sng (gc phn x b bng gc ti a nh c m t trn hnh v). Bng c xem
nh vo l khi v ch khi ta bng trng vi ta l. L mt tay chi nh ngh, Thu c th ngm bng
vo bt k mt im c ta nguyn no trn bn. trnh din trc bn b, Thu mun nh bng vo l
sau khi p bng nhiu ln nht c th. Bn hy tnh ta ca im m Thu nn ngm vo.
D liu
Dng th nht ghi 2 s nguyn a v b, a v b chn.
Dng th hai ghi 2 s nguyn x v y l ta ban u ca bng ( 0 x a ; 0 y b ).
Kt qu
Dng u ghi s ln p bng nhiu nht c th.
390
Dng th hai ghi 2 s z v t l ta ca im m Thu nn ngm vo. Nu c nhiu nghim th ghi

ra ta c honh z nh nht, nu vn c nhiu nghim th ghi ra nghim c tung t nh nht.
Gii hn
Kch thc: 0 < a, b 500
Thi gian: 3 s/test
B nh: 1 MB
V d
D liu
6 4
4 3
Kt qu
5
0 1
Congruence Equation
Ngy:
20-10-2008
im:
1.8
M bi:
DPEQN
S ngi gii c/
lm:
5/6
Loi bi:
acm
T l ng:
13.0%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VNOI
Cho phng trnh ng d:

a1x1 + ... a2x2 + ... + anxn = b (mod m)
Trong a1, a2, ..., an, b v m l cc hng s nguyn dng cho trc; x1, x2, ..., xn l cc n.
Tm mt nghim ca phng trnh trn, hoc thng bo phng trnh v nghim.
D liu
Dng u tin ghi s b test, mi b test c dng nh sau:
Dng 1: n (1 n 100)
391
Dng 2: gm n s nguyn a1, a2, ..., an (1 ai 108)
Dng 3: b, m (1 b, m 108)
Mi b test c phn cch bi mt dng trng u.
Kt qu
Vi mi b test, nu phng trnh khng c nghim , in ra dng "NO". Trong trng hp c nghim, in ra
trn mt dng n s nguyn x1, x2, ..., xn (0 xi < m) l mt nghim tm c.
V d
D liu
2
2
4 6
6 10
2
4 6
3 8
Kt qu
1 2
NO
Divisibility Relation
Ngy:
21-10-2008
im:
1.3
M bi:
DIVREL
S ngi gii c/
lm:
23 / 32
Loi bi:
acm
T l ng:
61.6%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Vietnamese IOI Selection

Test 2007
Cho n s nguyn dng. Hy chn ra nhiu s nht sao cho khng c hai s a, b no c chn m a chia
ht cho b.
D liu
392
Dng 1: n (1 n 200).
Dng 2: n s nguyn dng a1, a2, ..., an (1 ai 109).
Kt qu
Dng 1: k, s s nhiu nht c th chn.
Dng 2: k s c chn.
V d
D liu
8
1 2 3 5 6 8 7 9
Kt qu
5
5 6 8 7 9
D liu
4
2 3 2 3
Kt qu
2
2 3
Tree Construction
Ngy:
22-10-2008
im:
1.9
M bi:
TREECST
S ngi gii c/
lm:
2/9
Loi bi:
acm
T l ng:
10.5%
Thi gian chy:
3s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
COCI 2008-2009, #1
Cho mt cy c N nh. Tm cch xa i mt cnh thuc cy v thm vo mt cnh mi, sao cho sau ,
di ng i di nht trn cy l nh nht c th. di ca mt ng i c tnh bng s cnh thuc
ng i .
393
D liu
Dng u tin cha s N (1 N 300 000).
N-1 dng sau, mi dng cha 2 s nguyn m t mt cnh ca cy.
Kt qu
Dng u tin in ra di nh nht tm c.
Dng th hai ghi 2 s nguyn cho bit cnh cn xa.
Dng th ba ghi 2 s nguyn cho bit cnh cn thm vo.
Nu c nhiu li gii, ch cn in ra mt li gii bt k.
V d
D liu
4
1 2
2 3
3 4
Kt qu
2
3 4
4 2
D liu
7
1 3
2 3
2 7
4 3
7 5
3 6
Kt qu
3
2 3
7 3
Xc xc b
394

Ngy:
22-10-2008
im:
0.5
M bi:
BONES
S ngi gii c/
lm:
114 / 117
Loi bi:
oi
T l ng:
53.8%
Thi gian chy:
1s
Bi chy tt nht:
langkhach92 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO October 2008 Qualifying Round
Bessie rt yu thch chi nhng tr chi xc xc v c b ny ni c bc nng dn John ch ti ca

hng chi v c b mua 3 ci xc xc v ln.
Nhng vin xc xc ny tng ng c S1, S2 v S3 mt u nhau, cc mt c nh s t 1->S1, 1->S2 v
1->S3 (2 <= S1 <= 20; 2 <= S2 <= 20; 2 <= S3 <= 40).
Bessie c th xc xc lin tc v mi ln li ghi nhn li 1 s nguyn l tng gi tr ca 3 mt xc xc th
c. Mc ch ca c b l tm ra xem tng gi tr no xut hin nhiu nht.
Cho s mt ca 3 xc xc, hy xc nh xem tng gi tr no xut hin nhiu nht. Nu c nhiu hn 1 gi tr
xut hin nhiu nht th ghi ra gi tr nh nht.
D LIU
Dng 1: 3 s nguyn cch nhau bi du cch: S1, S2 v S3
KT QU
Dng 1: S nguyn nh nht l tng gi tr xut hin nhiu ln nht, gi s rng xc sut cc mt xc
xc xut hin l nh nhau.
V D
D liu
3 2 3
Kt qu
5
GII THCH
y l tt c cc trng hp c th xy ra. 1 1 1 -> 3 1 2 1 -> 4 2 1 1 -> 4 2 2 1 -> 5 3 1 1 -> 5 3 2 1 -> 6 1 1
2 -> 4 1 2 2 -> 5 2 1 2 -> 5 2 2 2 -> 6 3 1 2 -> 6 3 2 2 -> 7 1 1 3 -> 5 1 2 3 -> 6 2 1 3 -> 6 2 2 3 -> 7 3 1 3 ->
7 3 2 3 -> 8 Trong 5 v 6 xut hin nhiu nht (mi s 5 ln), vy 5 l kt qu.
395
Xy hng ro
Ngy:
22-10-2008
im:
0.8
M bi:
QUAD
S ngi gii c/
lm:
62 / 69
Loi bi:
oi
T l ng:
61.5%
Thi gian chy:
1s
Bi chy tt nht:
quarters (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Nng dn John mun xy mt ci hng ro c 4 mt vy ly n b. ng ta c mt thanh g c di l 1

s nguyn N (4 <= N <= 2,500), ng ta mun ct thanh g ny ti 3 im chia thnh 4 ming nh hn,
mi ming c di l 1 s nguyn.
4 ming ny di ngn th no cng c min l c th gip nng dn John ng c 1 ci hng ro hnh
t gic l c. Hi c bao nhiu cch khc nhau ct thanh g ban u to thnh c hng ro ?
CH
Hai cch ct gi l khc nhau nu mt cch c 1 nht ct ti 1 im m cch kia khng c.
m bo rng hng ro ny xy dng c din tch ln hn 0.
Ch p n lun nm trong phm vi 1 s nguyn 32 bit c du.
D liu
Dng 1: 1 s nguyn duy nht: N
Kt qu
Dng 1: Mt s nguyn duy nht l s cch m nng dn John c th ct thanh g thnh 4 ming nh
hn m c th to c 1 t gic.
V d
D liu
6
Kt qu
6
GII THCH
396

Nng dn John c th ct thanh g theo 10 cch: (1, 1, 1, 3); (1, 1, 2, 2); (1, 1, 3, 1); (1, 2, 1, 2); (1, 2, 2, 1);
(1, 3, 1, 1); (2, 1, 1, 2); (2, 1, 2, 1); (2, 2, 1, 1); or (3, 1, 1, 1). Trong 4 cch -- (1, 1, 1, 3), (1, 1, 3, 1), (1,
3, 1, 1), v (3, 1, 1, 1) -- khng th s dng to thnh 1 t gic.
Ti nc ng c
Ngy:
22-10-2008
im:
0.7
M bi:
FWATER
S ngi gii c/
lm:
68 / 79
Loi bi:
oi
T l ng:
45.6%
Thi gian chy:
1s
Bi chy tt nht:
ngocson_92 (100 im 0.17s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Nng dn John quyt nh mang nc ti cho N (1 <= N <= 300) ng c ca mnh, thun tin ta nh s
cc ng c t 1 n N. ti nc cho 1 ng c John c th chn 2 cch, 1 l o ng c 1 ci
ging hoc lp ng ni dn nc t nhng ng c trc c nc ti.
o mt ci ging ng c i cn 1 s tin l W_i (1 <= W_i <= 100,000). Lp ng dn nc ni 2 ng
c i v j cn 1 s tin l P_ij (1 <= P_ij <= 100,000; P_ij = P_ji; P_ii=0).
Tnh xem nng dn John phi chi t nht bao nhiu tin tt c cc ng c u c nc.
D LIU
Dng 1: Mt s nguyn duy nht: N
Cc dng 2..N + 1: Dng i+1 cha 1 s nguyn duy nht: W_i
Cc dng N+2..2N+1: Dng N+1+i cha N s nguyn cch nhau bi du cch; s th j l P_ij
KT QU
Dng 1: Mt s nguyn duy nht l chi ph ti thiu cung cp nc cho tt c cc ng c.
V D
D liu
4
5
4
4
397

3
0 2 2 2
2 0 3 3
2 3 0 4
2 3 4 0
Kt qu
9
GII THCH
C 4 ng c. Mt 5 tin o 1 ci ging ng c 1, 4 tin o ng c 2, 3 v 3 tin o
ng c 4. Cc ng dn nc tn 2, 3, v 4 tin ty thuc vo n ni ng c no vi nhau.
Nng dn John c th o 1 ci ging ng c th 4 v lp ng dn ni ng c 1 vi tt c 3 ng c cn
li, chi ph tng cng l 3 + 2 + 2 + 2 = 9.
Do chi ng c
Ngy:
22-10-2008
im:
0.7
M bi:
PWALK
S ngi gii c/
lm:
69 / 87
Loi bi:
oi
T l ng:
41.6%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
C N con b (1 <= N <= 1,000), thun tin ta nh s t 1->N, ang n c trn N ng c, thun tin
ta cng nh s cc ng c t 1->N. Bit rng con b i ang n c trn ng c i.
Mt vi cp ng c c ni vi nhau bi 1 trong N-1 con ng 2 chiu m cc con b c th i qua. Con
ng i ni 2 ng c A_i v B_i (1 <= A_i <= N; 1 <= B_i <= N) v c di l L_i (1 <= L_i <= 10,000).
Cc con ng c thit k sao cho vi 2 ng c bt k u c duy nht 1 ng i gia chng. Nh vy
cc con ng ny hnh thnh 1 cu trc cy.
Cc ch b rt c tinh thn tp th v mun c thm thng xuyn. V vy l b mun bn gip chng
tnh ton di ng i gia Q (1 <= Q <= 1,000) cp ng c (mi cp c m t l 2 s nguyn p1,p2
(1 <= p1 <= N; 1 <= p2 <= N).
D LIU
398
Dng 1: 2 s nguyn cch nhau bi du cch: N v Q
Dng 2..N: Dng i+1 cha 3 s nguyn cch nhau bi du cch: A_i, B_i, v L_i
Dng N+1..N+Q: Mi dng cha 2 s nguyn khc nhau cch nhau bi du cch m t 1 yu cu
tnh ton di 2 ng c m l b mun i thm qua li p1 v p2.
KT QU
Dng 1..Q: Dng i cha di ng i gia 2 ng c yu cu th i.
V D
D liu
4 2
2 1 2
4 3 2
1 4 3
1 2
3 2
Kt qu
2
7
GII THCH
Yu cu 1: Con ng gia ng c 1 v 2 c di l 2. Yu cu 2: i qua con ng ni ng c 3 v 4,
ri tip tc i qua con ng ni 4 v 1, v cui cng l con ng ni 1 v 2, di tng cng l 7.
Quay bnh xe
Ngy:
22-10-2008
im:
0.5
M bi:
ROTATION
S ngi gii c/
lm:
113 / 120
Loi bi:
oi
T l ng:
60.1%
Thi gian chy:
1s
Bi chy tt nht:
buiminhtri (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
399

Nng dn John c mt ci my gt p c, my ny yu cu mt s dy curoa c t trn cc bnh xe
khc nhau quay cc b phn. ng c s lm quay bnh xe 1 theo chiu kim ng h, bnh xe 1 li c
gn km 1 dy curoa vi bnh xe 2. Bnh xe 2 li c gn km 1 dy curoa vi bnh xe 3 , v.v.. v c nh
vy c tng cng N (1 <= N <= 1,000) bnh xe (v N-1 dy curoa).
Hnh trn minh ha 2 cch t dy curoa gia 2 bnh xe. Trong hnh minh ha, dy curoa ca bnh xe 1
trc tip lm bnh xe 2 chuyn ng v quay cng chiu vi bnh xe 1 (gi l dy curoa thng - straight
belt). Bnh xe 3 quay ko theo bnh xe 4 cng quay nh vo dy curoa cho (crossed belt) khin cho bnh
xe 4 chuyn ng ngc chiu so vi bnh xe 3 => o ngc chiu chuyn ng.
Cho danh sch cc dng ca curoa ni cc bnh xe vi nhau. Bit rng bnh xe 1 c ng c quay theo
chiu kim ng h. Hy xc nh chiu quay ca bnh xe N. Mi dy curoa c m t bi 3 s nguyn:
S_i -- bnh xe tc ng (ngun)
D_i -- bnh xe b tc ng (ch)
C_i -- dng ca dy curoa (0=dy thng, 1=dy cho)
Tht khng may, FJ li a ra danh sch cc dy curoa theo 1 th t ngu nhin.

Di y l 1 v d vi N=4, bnh xe 1 quay theo chiu kim ng h.
Dy curoa thng c ni ti bnh xe 2 v 3 bi vy m chng cng chuyn ng cng chiu kim ng h.

Cn li dy curoa cho o ngc chuyn ng v vy bnh xe 4 (bnh xe N) chuyn ng ngc chiu kim
ng h.
D LIU
Dng 2..N: Mi dng m t 1 dy curoa vi 3 s nguyn: S_i, D_i, v C_i
KT QU
Dng 1: Mt s nguyn duy nht l chiu quay ca bnh xe N. (0=cng chiu kim ng h, 1=ngc
chiu kim ng h)
V D
D liu
4
2 3 0
3 4 1
1 2 0
400

Kt qu
1
Mt in
Ngy:
22-10-2008
im:
1.0
M bi:
PWRFAIL
S ngi gii c/
lm:
44 / 64
Loi bi:
oi
T l ng:
24.1%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Mt cn bo ph hy 1 s ng dy in ca nng trang! Nng dn John c mt bn tt c N (2 <=

N <= 1,000) cy ct in, thun tin ta nh s cc ct ny t 1->N, mi ct ny c xc nh trn mt
phng bi 2 s nguyn x_i, y_i (-100,000 <= x_i <= 100000; -100,000 <= y_i <= 100,000).
Hin ang c W (1 <= W <= 10,000) ng dy in ni cc cp ct in Pi v Pj (1 <= Pi <= N; 1 <= Pj
<= N). John cn mang in t ct 1 ti ct N (thng qua cc ng dy in v cc ct in khc).
Cho ta ca N ct in v danh sch nhng ng dy in vn cn hot ng. Hy xc nh di nh
nht ca cc ng dy in cn thm sao cho in t ct 1 c th truyn ti ct N. Bit rng di ti
a ca 1 ng dy in l 1 s thc M (0.0 < M <= 200,000.0).
V d, di y l bn tri l bn 9 ct in v 3 dy ni vn cn hot ng sau cn bo. Trong v d ny,
M = 2.0. Cch tt nht l ta thm 2 ng dy in ni 4-6 v 6-9.
Sau cn bo
3
. . . 7 9 . . . . .
Phng n ti u
3
. . . 7 9 . . . . .
/
. . 5 6 . . . . . .
. . 5 6 . . . . . .
/
2-3-4 . 8 . . . . .
|
0
1 . . . . . . . . .
0 1 2 3 4 5 6 7 8 9
2-3-4 . 8 . . . . .
|
1 . . . . . . . . .
0 1 2 3 4 5 6 7 8 9
Tng di l 1.414213562 + 1.414213562 = 2.828427124 .
401
D LIU
Dng 1: Hai s nguyn cch nhau bi du cch: N v W
Dng 2: Mt s thc: M
Dng 3..N+2: Mi dng gm 2 s nguyn cch nhau bi du cch: x_i v y_i
Dng N+3..N+2+W: 2 s nguyn cch nhau bi du cch: Pi v Pj
KT QU
Dng 1: Mt s nguyn trn 1 dng. Nu khng c phng n cp in cho ct N t ct 1 th ghi

ra -1. Ngc li, ghi ra 1 s nguyn l tng di nh nht nhn vi 1000.
Ch khng lm trn, lm gim tch thu c trn.
V D
D liu
9 3
2.0
0 0
0 1
1 1
2 1
2 2
3 2
3 3
4 1
4 3
1 2
2 3
3 4
Kt qu
2828
GII THCH
Nh hnh bn trn.
K-query
Ngy:
26-10-2008
im:
1.5
M bi:
KQUERY
S ngi gii c/
14 / 28
402

lm:
Loi bi:
acm
T l ng:
11.5%
Thi gian chy:
1.5s
Bi chy tt nht:
beo_chay_so (100 im 1.03s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VNOI
Cho mt dy n phn t a1, a2, ..., an v mt s cc truy vn-k. Mt truy vn-k l mt b ba (i, j, k) (1 i j
n). Vi mi truy vn-k (i, j, k), bn phi tr v s phn t ln hn k nm trong dy con ai, ai+1, ..., aj.
D liu
Dng 1: n (1 n 30000).
Dng 2: n s a1, a2, ..., an (1 ai 109).
Dng 3: q (1 q 200000), s truy vn-k.
Trong q dng tip theo, mi dng cha 3 s i, j, k th hin mt truy vn-k (1 i j n, 1 k 109).
Kt qu
Vi mi truy vn-k (i, j, k), in ra s phn t ln hn k trong dy con ai, ai+1, ..., aj trn mt dng.
V d
D liu
5
5 1 2 3 4
3
2 4 1
4 4 4
1 5 2
Kt qu
2
0
3
D-query
Ngy:
26-10-2008
im:
1.7
M bi:
DQUERY
S ngi gii c/
7/9
403

lm:
Loi bi:
acm
T l ng:
54.5%
Thi gian chy:
1.5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VNOI
Cho mt dy s n phn t a1, a2, ..., an v mt s cc truy vn-d. Mt truy vn-d l mt cp (i, j) (1 i j
n). Vi mi truy vn-d (i, j), bn cn tr v s phn t phn bit nm trong dy con ai, ai+1, ..., aj.
D liu
Dng 1: n (1 n 30000).
Dng 2: n s a1, a2, ..., an (1 ai 106).
Dng 3: q (1 q 200000), s lng truy vn- d.
Trong q dng sau, mi dng cha 2 s i, j biu th mt truy vn-d (1 i j n).
Kt qu
Vi mi truy vn-d (i, j), in ra s phn t phn bit thuc dy con ai, ai+1, ..., aj trn mt dng.
V d
D liu
5
1 1 2 1 3
3
1 5
2 4
3 5
Kt qu
3
2
3
Phng chy
Ngy:
29-10-2008
im:
1.8
M bi:
FIRE
S ngi gii c/
4 / 11
404

lm:
Loi bi:
acm
T l ng:
24.5%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Ioicamp - Marathon 06 07
i ph vi tnh hnh bin ng ca gi xng du, nc X quyt nh xy dng mt kho d tr du vi

quy m cc ln. Kho cha du s bao gm N b cha du hnh tr trn m ta s biu din trn bn bng
N hnh trn, hnh trn th i c ta l (Xi, Yi) v bn knh Ri, cc hnh trn khng c im chung trong vi
nhau (nhng c th tip xc).
m bo an ton phng chy cha chy, ngi ta cn xc nh 2 b cha du gn nhau nht tng
cng cch ly khi xy ra ha hon.
Bit rng khong cch gia 2 b cha du th i v th j chnh bng khong cch gia 2 ng trn tng
ng v bng Dij Ri Rj, trong Dij l khong cch Euclide gia 2 im (Xi, Yi) v (Xj, Yj).
Bn hy gip nhng ngi qun l tm ra 2 b cha du ny.
Input
Dng th nht ghi s nguyn dng N l s b cha du.
Dng th i trong N dng tip theo ghi 3 s nguyn Xi, Yi, Ri l ta v bn knh b cha du th i.
Output
Gm 1 dng duy nht l khong cch ca 2 b cha du b nht tm c.
Example
Input:
3
0 0 1
4 0 2
5 5 3
Output:
0.0990
Gii hn:
2 N 10000.
|Xi|, |Yi| 106.
405

0 < Ri 106.
Kt qu ghi chnh xc n 4 ch s sau du phy.
Order statistic set

Ngy:
30-10-2008
im:
1.7
M bi:
ORDERSET
S ngi gii c/
lm:
8 / 11
Loi bi:
acm
T l ng:
36.3%
Thi gian chy:
2s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VNOI
Bn cn qun l mt tp hp ng cc s, h tr hai thao tc c bn:
INSERT(S,x): nu x khng thuc S, thm x vo S
DELETE(S,x): nu x thuc S, xa x khi S
v hai loi truy vn
K-TH(S) : tr v s b th k ca S
COUNT(S,x): m s lng s thuc S b hn x
D liu
Dng 1: Q (1 Q 200000), s thao tc
Q dng sau, u mi dng cha k t I, D, K hoc C cho bit thao tc tng ng l INSERT,
DELETE, K-TH hay COUNT. Tip theo l mt khong trng v mt s nguyn l tham s cho thao
tc .
Nu tham s l gi tr x, d liu bo m 0 |x| 109. Nu tham s l ch s k, d liu bo m 1 k 109.
Kt qu
Vi mi truy vn, in ra kt qu tng ng trn mt dng. Vi truy vn K-TH, nu k ln hn s phn t ca
S, in ra 'invalid'.
V d
D liu
8
406

I -1
I -1
I 2
C 0
K 2
D -1
K 1
K 2
Kt qu
1
2
2
invalid
K-query II
Ngy:
30-10-2008
im:
1.8
M bi:
KQUERY2
S ngi gii c/
lm:
5/7
Loi bi:
acm
T l ng:
39.3%
Thi gian chy:
7s
Bi chy tt nht:
gothdn (100 im - 2.59s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
VNOI
Cho mt dy n phn t a1, a2, ..., an v mt s cc truy vn-k. Ngoi ra cn c mt s thao tc cp nht.
Mt thao tc cp nht l mt cp (i, v) ngha l ai cn c gn gi tr v.
Mt truy vn-k l mt b ba (i, j, k) (1 i j n).
Vi mi truy vn-k (i, j, k), bn phi tr v s phn t ln hn k nm trong dy con ai, ai+1, ..., aj.
D liu
Dng 1: n (1 n 30000).
Dng 2: n s a1, a2, ..., an (1 ai 104).
Dng 3: q (1 q 200000), s truy vn-k.
q dng tip theo, s u tin trong mi dng l 0 hoc 1. S 0 theo sau bi 2 s i v v (1 i n, 1

v 104) cho bit mt thao tc cp nht. S 1 theo sau bi 3 s nguyn i, j, k (1 i j n, 1 k
104) cho bit mt truy vn-k.
407
Kt qu
Vi mi truy vn-k (i, j, k), in ra s phn t ln hn k trong dy con ai, ai+1, ..., aj trn mt dng.
V d
D liu
5
5 1 2 3 4
6
1 2 4 1
0 4 10
1 4 4 4
0 3 1
0 1 2
1 1 5 2
Kt qu
2
1
2
Xy nh
Ngy:
30-10-2008
im:
1.4
M bi:
HOUSE
S ngi gii c/
lm:
19 / 26
Loi bi:
acm
T l ng:
42.2%
Thi gian chy:
1s
Bi chy tt nht:
canhteo (100 im - 0.5s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP4
Cng vi phn thng l tm nh km ch k tng ca hoa hu Vit Nam 2006 Mai Phng Thy, BB cn
c nhn c mt khon tin. BB quyt nh s dng khon tin ny xy ngi nh m c ca mnh.
Hin nay, BB c mt mnh t c chia thnh M x N . BB mun xy ngi nh ca mnh trn mnh t
ny. BB mun rng ngi nh ca mnh phi l ngi nh tht c bit. N s phi p ng cc yu cu:
L tp hp ca mt s lin thng. Hai c coi l k nhau nu chng c chung cnh.
C t nht hai trc i xng: mt trc ngang, mt trc dc (c hai trc u phi song song vi cnh ca khu
t). BB vn tin vo thuyt phong thy m.
408

BB li l ngi cn thn, nn cu mun rng ngi nh ca mnh s c t nht mt im c th t camera
quan st ton b ngi nh. Mt im A c coi l c th quan st c im B nu on thng AB nm
hon ton bn trong ngi nh hoc c im chung vi tng ngi nh, nhng khng c i ra bn ngoi
ngi nh.
Vi mnh t ca mnh, bn hy gip BB tnh xem c bao nhiu cch xy c ngi nh m c.
Input
Dng th nht ghi hai s nguyn dng M, N.
Output
Gm mt s duy nht l phn d ca php chia s cch xy dng ngi nh cho 12051987.
Example
Input:
2 2
Output:
9
Gii hn:
M, N 1000
Thi gian: 1 s/test
C 30% s test c M, N 5
Xu con chung di nht

Ngy:
30-10-2008
im:
0.5
M bi:
QBSTR
S ngi gii c/
lm:
108 / 115
Loi bi:
acm
T l ng:
61.3%
Thi gian chy:
1s
Bi chy tt nht:
hirayama (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Xu k t X c gi l xu con ca xu k t Y nu ta c th xo i mt s k t trong xu Y c xu
X.
409

Cho bit hai xu k t A v B, hy tm xu k t C c di ln nht v l con ca c A v B.
Input
Dng 1: cha xu A
Dng 2: cha xu B
Output
Ch gm mt dng ghi di xu C tm c
Example
Input:
abc1def2ghi3
abcdefghi123
Output:
10
m chui i xng
Ngy:
30-10-2008
im:
0.8
M bi:
QBPAL
S ngi gii c/
lm:
58 / 71
Loi bi:
acm
T l ng:
35.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Ha L Thanh Vy
Trong mt bui hc vit ch, Bm pht hin trong mt s t khi b i mt s k t th c ngc hay c
xui u ging nhau.
V d t IOICAMP, khi xa i cc ch ci C,A,M,P, th cn li IOI l mt t i xng.
Bm cm thy th v, v cu tip tc th xa cc k t khc, kt qu l c thm nhiu t i xng na: II, I,
O, C Nhng nu vi mt t di, c th tng cch xa nh vy th tht mt thi gian. Bn hy vit chng
trnh gip Bm tnh s cch xa sao cho t thu c i xng. Hai cch xa ch khc nhau bi th t xa
cc k t th coi nh trng nhau.
Input
410

Mt dng duy nht l t cn tnh s cch xa, t ny ch cha cc ch ci in hoa A, B, .., Z. ( di t
khng qu 120 )
Output
Mt s duy nht l s cch xa.
Example
Input:
IOICAMP
Output:
9
n trng
Ngy:
30-10-2008
im:
0.9
M bi:
QBSCHOOL
S ngi gii c/
lm:
54 / 67
Loi bi:
acm
T l ng:
22.9%
Thi gian chy:
1s
Bi chy tt nht:
overtherainbow (100
im - 0.15s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Nguyn Minh Hiu
Ngy 27/11 ti l ngy t chc thi hc k I trng H BK. L sinh vin nm th nht, Hiu khng mun
v i mun m gp trc trc phng thi nn chun b kh k cng. Ch cn li mt cng vic kh gay go
l Hiu khng bit i ng no ti trng l nhanh nht.
Thng ngy Hiu khng quan tm ti vn ny lm cho nn by gi Hiu khng bit phi lm sao c .
Bn thnh ph l gm c N nt giao thng v M con ng ni cc nt giao thng ny. C 2 loi con
ng l ng 1 chiu v ng 2 chiu. di ca mi con ng l mt s nguyn dng.
Nh Hiu nt giao thng 1 cn trng H BK nt giao thng N. V mt l trnh ng i t nh Hiu
ti trng c th gp nhiu yu t khc nh l gp nhiu n , i qua cng trng xy dng, ... phi gim
tc cho nn Hiu mun bit l c tt c bao nhiu l trnh ngn nht i t nh ti trng. Bn hy lp
trnh gip Hiu gii quyt bi ton kh ny.
Input
Dng th nht ghi hai s nguyn N v M.
M dng tip theo, mi dng ghi 4 s nguyn dng K, U, V, L. Trong :
411

K = 1 c ngha l c ng i mt chiu t U n V vi di L.
K = 2 c ngha l c ng i hai chiu gia U v V vi di L.
Output
Ghi hai s l di ng i ngn nhn v s lng ng i ngn nht. Bit rng s lng ng i ngn
nht khng vt qu phm v int64 trong pascal hay long long trong C++.
Example
Input:
3 2
1 1 2 3
2 2 3 1
Output:
4 1
Gii hn:
1 N 5000
1 M 20000
di cc con ng 32000
Dy bit
Ngy:
30-10-2008
im:
0.8
M bi:
QBBITSEQ
S ngi gii c/
lm:
57 / 60
Loi bi:
acm
T l ng:
81.9%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Dr.S l ngi yu thch nhng con s nh phn. Khi ng mt i, ng li cho cc con mt gia ti ln trong
kt st. ng ch di chc li rng: m kha l bt k xu nh phn ngn nht no c cha mi xu nh phn
di N. Trong bn di chc ca mnh, Dr.S c gii thch thm l: Xu A c coi l cha xu B nu c
mt on lin tip cc bit nh phn thuc xu A l xu B.
V d nh xu 01011 c cha xu 0101 nhng khng cha xu 0111.
Cc con ng li yu km v ton hc v tin hc, bn hy gip h m c kt st. Nu bn thnh
cng, chc chn bn s nhn c mt phn gia sn kch x .
412
Input
Mt dng duy nht ghi s N (N 16)
Output
Mt dng duy nht cha di xu nh phn ngn nht m bn tm c.
Example
Input:
2
Output:
5
Gii thch:
Xu ngn nht l 00110
m cy nh phn
Ngy:
30-10-2008
im:
1.5
M bi:
QBTREEK
S ngi gii c/
lm:
14 / 20
Loi bi:
acm
T l ng:
24.2%
Thi gian chy:
3s
Bi chy tt nht:
nt_d2 (100 im - 1.94s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
ACM
Hy m s cy nh phn khc nhau tha mn iu kin:

S nt ca cy l N.
Mi nt c s nt con l 0 hoc 2.
Chiu cao ca cy bng K.
Hai cy nh phn c coi l khc nhau nu cu trc ca chng l khc nhau. Bit rng:
Hai cy gm 0 nt c coi l ging nhau.
Hai cy X, Y ging nhau nu cy con tri ca X ging cy con tri ca Y v cy con phi ca X ging cy
con phi ca Y.
Input
413

Mt dng duy nht ghi s N v K. ( 1 <= n <= 1000, 1 <= k <= 500 ).
Output
S cy nh phn khc nhau sau khi MOD 9901.
Example
Input:
5 3
Output:
2
Cc i l
Ngy:
30-10-2008
im:
1.4
M bi:
QBAGENTS
S ngi gii c/
lm:
17 / 28
Loi bi:
acm
T l ng:
22.9%
Thi gian chy:
1s
Bi chy tt nht:
iamme (100 im - 0.7s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Sau mt s ri ro v tht bi trong kinh doanh, tng gim c cng ty Fsoft l Zone quyt nh t chc cho
cc sp nh ca cc i l thuc cng ty gp mt v tho lun vi nhau. Cng ty Fsoft l mt cng ty cc k
ln tri khp ton cu nn mt vn ln t ra l lm sao t chc cho 2 sp nh gp nhau trong thi gian
sm nht. Vn c bit tr nn hc ba v cc nhn vin ca cng ty ch c i bng mng giao thng
ca cng ty m bo an ton, bo mt v chi ph. Nhng mng ny li hi t:
- Cc nhn vin buc phi di chuyn theo cc tuyn giao thng gia cc i l.
- Mng giao thng ca cng ty l mng gm cc tuyn ng 1 chiu.
- Cc nhn vin khi i trong mng th mi gi i c theo ng 1 tuyn ng v phi lin tc di chuyn
(ngha l khng c dng li).
c ci y l mng ni b v vi cng ngh nh cao nn khng c chuyn tc ng. V vy, trong 1 gi
lun c th di chuyn t i l ny sang i l khc nu c ng.
Zone mun nhn vin ca mnh khng lng ph thi gian. Bi vy ng mun tnh thi gian ngn nht m 2
sp 2 i l cho trc c th gp nhau. ng tic l Zone ch gii kinh doanh, cn lp trnh th qu yu
414

km. Bn l nhn vin di quyn Zone v ang rt mun th hin kh nng ca mnh. Vy th, hy nhn c
hi ny cho Zone thy trnh tuyt vi ca bn.
Input
Dng u ghi 2 s N, M l s i l v s tuyn ng trong mng giao thng ca cng ty Fsoft. (N 250)
Dng th 2 ghi S,T ln lt l s th t 2 i l c 2 sp cn phi gp nhau.
M dng tip theo mi dng ghi 2 s nguyn U, V th hin c ng i mt chiu t U ti V.
Output
Gm mt dng duy nht ghi thi gian nh nht 2 sp c th gp nhau.
Nu 2 sp khng th gp nhau ghi -1.
Example
Input:
6 7
1 5
1 2
4 5
2 3
3 4
4 1
5 4
5 6
Output:
3
B ba im thng hng
Ngy:
30-10-2008
im:
0.9
M bi:
QBPOINT
S ngi gii c/
lm:
46 / 61
Loi bi:
acm
T l ng:
27.1%
Thi gian chy:
2s
Bi chy tt nht:
congminh91 (100 im 2.48s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Nguyn Honh Tin
415

Trong cc cuc thi tin hc, s xut hin ca nhng bi ton hnh hc lm i tuyn CBQ kh lng tng. Do
thy Thch quyt nh cho i tuyn luyn tp cc bi ton hnh hc. Bt u t im, thy a ra bi
ton:
Cho n im trong mt phng Oxy, hy m s b 3 im thng hng
Input
Dng th nht ghi s N l s im trn mt phng.
N dng tip theo, mi dng ghi ta ca mt im.
Output
Mt s duy nht l s b 3 im thng hng.
Example
Input:
6
0 0
0 1
0 2
1 1
2 0
2 2
Output:
3
Gii hn:
1 N 2000.
Ta cc im c tr tuyt i khng qu 10000.
Chip & Dale

Ngy:
30-10-2008
im:
1.8
M bi:
QBWIRE
S ngi gii c/
lm:
5/5
Loi bi:
acm
T l ng:
85.6%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
416

Ngn ng cho php:
Tt c
Ngun bi:
Hai anh em Chip v Dale ang chi tr chi ni dy. l tr chi trn bng c N N nt li. Cc nt
ca li c nh s t 0 n N 1 theo chiu t trn xung v 0 n N 1 theo chiu t tri sang phi.
Ta ca mt nt c th hin bng mt cp s trong s th nht l ta ct, s th hai l ta
dng. Chip s chn ra 4 im A1, A2, B1, B2. Chip yu cu Dale s dng cc nt v ngang (dc) theo cc
ng k ca li v 2 ng gp khc tha mn:
- ng gp khc th nht ni A1 vi A2.
- ng gp khc th hai ni B1 vi B2.
- Hai ng gp khc khng c im chung.
- Tng di hai ng gp khc l nh nht c th.
Dale c v khng thnh tho lm vi tr chi ny, bn hy gip Dale tnh tng di nh nht ca hai
ng gp khc.
Input
Dng u ghi s nguyn T l s test.
Tip theo l T test, mi test c ghi trn 3 dng
Dng th nht ghi s N.
Dng th hai ghi 4 s l ta ct ca 4 im A1, A2, B1, B2.
Dng th ba ghi 4 s l ta dng ca 4 im A1, A2, B1, B2.
Output
Mi test ghi p s trn mt dng.
Nu khng c cch ni dy tha mn, ghi ra -1.
Nu c cch ni dy tha mn, ghi ra tng di 2 ng gp khc.
Example
Input:
1
7
2 5 4 4
1 4 5 0
Output:
15
417
Gii hn:
1 T 5
2 N 500
Tng hoa
Ngy:
30-10-2008
im:
1.9
M bi:
QBFLOWER
S ngi gii c/
lm:
2/4
Loi bi:
acm
T l ng:
63.6%
Thi gian chy:
1s
Bi chy tt nht:
- 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP
Sau k thi Marathon, thy My quyt nh t chc mt bui d hi nho nh cho cc th sinh. Trong bui d
hi ny s c N bn n v M bn nam. khng kh thm phn vui v th thy My ngh ra tit mc cc
bn nam tng hoa cho cc bn n. Mi bn nam s a cho ban t chc danh sch 2 bn n m bn mun
tng hoa nht. Tuy nhin tin ti tr cho bui d hi khng cn nhiu (v phi dnh hu ht trao gii
thng). Nhng ban t chc cng khng mun bn n no khng c nhn hoa. Thy My giao vic ny
cho Mr.Hi Minh, v anh ta ang rt bi ri v khng bit lm th no.
Bn hy gip Mr. Hi Minh chn ra t bn nam nht ng ra i din cho cc bn nam tng hoa cc bn
n sao cho bn n no cng c tng hoa. Bit rng mi bn nam c chn s tng hoa cho c hai bn n
trong danh sch ca bn .
Input
Dng u ghi hai s N v M. (2 N 1000, 1 M 1000)
Dng th i trong M dng tip theo ghi hai s ai v bi l hai bn n m bn nam th i mun tng hoa.
Output
S bn nam t nht cn la chn
Example
Input:
3 3
1 2
2 3
1 3
418
Output:
2
Tr chi hi ch
Ngy:
30-10-2008
im:
1.8
M bi:
QBMOUSE
S ngi gii c/
lm:
4/4
Loi bi:
acm
T l ng:
50.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
mt phin ch dnh cho thiu nhi c mt tr chi rt hp dn vi nhng con chut trong mt ci bn.
Nhim v ca ngi chi l phi lm b thng nhng con chut, cng nhiu cng tt vi mt chic ba.
lm cho tr chi d dng hn, cc bn nh hi bt bit c v tr cng nh thi gian chnh xc m
mi con chut xut hin.
Coi mt phng ca mt bn l mt h ta -cc, mi con chut s xut hin t mt l thng trn mt
bn vi ta nguyn (x,y) tha mn 0 x, y N. Trong mi thi im, mt vi con chut s xut hin
nhng l thng khc nhau v sau li chui xung vo trc thi im tip theo. Ngay sau khi cc con
chut xut hin v ngay trc lc chng bin mt, ngi chi c th di chuyn chic ba trn mt on
thng c chiu di ti a l D. n gin, ta ca chic ba trc v sau khi di chuyn lun l nguyn
v coi kch thc ca chic ba khng ng k. Mt con chut s b thng nu tm ca l m con chut
xut hin nm trn on thng chic ba di chuyn. Khi bt u tr chi, ngay trc thi im u tin m
nhng con chut xut hin, ngi chi c th t ba bt c v tr no.
Hy gip cc em thiu nhi lm b thng nhiu chut nht c th, cc em c nhng phn qu ca ban
t chc. V tt nhin ai gip cc em thiu nhi nhiu nht cng s c phn thng l im s trong tun
thi ny.
Input
Dng u ghi 3 s N, D, M trong M l s con chut.
M dng tip theo mi dng ghi 3 s ln lt l ta v thi im m mi con chut xut hin.
Output
Xut ra mt s duy nht l s chut ln nht c th lm b thng.
Example
419

Input:
4 5 4
0 0 1
1 0 1
0 1 2
1 2 2
Output:
4
Gii thch:
u tin ba 1 0.
Bc 1 p 2 con chut 1 0, 0 0, ri a ba tip n -1 0.
Bc 2 p 2 con chut 0 1, 1 2.
Gii hn:
1 N 20
1 D 5
1 M 1000
Thi im m mi con chut xut hin l s t nhin khng ln hn 10.
C phiu
Ngy:
30-10-2008
im:
1.9
M bi:
QBSTOCK
S ngi gii c/
lm:
2/7
Loi bi:
acm
T l ng:
11.1%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP4
Qua nhiu nm hot ng, IOICamp tp hp c nhiu ti nng tin hc v qua dn dn tr thnh mt
tp on cng ngh ln. n nm 2222, IOICamp chnh thc tr thnh mt tp on ln c c phiu trn
th trng chng khon. Tuy nhin tn ti c trn th trng chng khon th vic nm bt c tnh
hnh ln xung ca gi c phiu l v cng cn thit. lm c vic ny, IOICamp rt cn n cc
chuyn gia tin hc ca mnh. Sau nhiu nm nghin cu cc thnh vin ca IOICamp thnh cng trong
vic xp x s bin ng ca c phiu thnh mt hm a thc vi bin thi gian. Tuy nhin cng vic kh
khn trc mt l phi tm c thi im c phiu c gi thp nht v cao nht v IOICamp mun nh cc
bn lm gip vic ny.
420

Cc bn s c cung cp hm a thc m t bin ng ca gi c phiu trong mt khong thi gian cho
trc. Hm a thc ny c dng:
f(t) = a.t4 + b.t3 + c.t2 + d.t + e
Vi a, b, c, d, e l cc h s nguyn cho trc. Hy tm gi c phiu cao nht fmax v gi c phiu thp nht
fmin trong khong thi gian t t1 n t2 (ngha l t1 t t2).
Input
Dng th nht ghi 5 s nguyn a, b, c, d, e.
Dng th hai ghi 2 s nguyn t1, t2
Output
Dng u tin ghi s thc fmax l gi c phiu cao nht.
Dng th hai ghi s thc fmin l gi c phiu thp nht.
Example
Input:
1 0 -2 0 1
0 2
Output:
9.000000000
0.000000000
Gii hn:
|a|, |b|, |c|, |d|, |e| 10
20 t1 < t2 20
Kt qu ghi ra vi chnh xc 9 ch s sau du phy
Tr chi tr tu
Ngy:
30-10-2008
im:
2.0
M bi:
IQ
S ngi gii c/
lm:
1/2
Loi bi:
acm
T l ng:
12.5%
Thi gian chy:
1s
Bi chy tt nht:
- 0.39s)
Gii hn m ngun:
50000B
Ngi gi:
cun
421

Ngn ng cho php:
Tt c
Ngun bi:
L n Khu
Hnh thc kim tra IQ hin nay m ngi ta vn hay dng ang cho thy nhng khuyt im ln. l s
dp khun, khng a dng. Mt ngi ch sau vi ln lm th cc bi test IQ s quen vi cc dng bi
nh dy quy lut, chn hnh sai v.v... Nh vy th bi thi IQ s khng cn ngha kim tra thng minh,
sng to ca con ngi na. khc phc ngi ta va pht minh ra mt hnh thc kim tra ch s IQ mi.
l mt tr chi vi mt bng gm M dng v N ct. thun tin, ngi ta nh s cc dng t 1 n M
theo chiu t trn xung, cc ct t 1 n N theo chiu t tri sang phi. Mt ca bng s c th hin
bng mt cp s nguyn (u, v) trong u l ch s dng, v l ch s ct. Trong s M N ca bng, s c
mt s c chng ngi vt. Ban u, ti mt s , ngi ta sn mt s vin bi. Nhim v ca bn l a
cc vin bi v mt s ch. lm c iu , bn c s dng cc php quay bng sang tri/phi
(ngc chiu kim ng h/thun chiu kim ng h). Cc php quay c th c m t nh sau:
Gii thch:
Hnh 1 sau khi quay phi (thun chiu kim ng h) c hnh 2.
hnh 2, do trng lc, vin bi ri xung. Ta c bng nh hnh 3.
Hnh 3 sau khi quay tri (ngc chiu kim ng h) c hnh 4.
hnh 4, do trng lc, vin bi ri xung. Ta c bng nh hnh 5.
Yu cu:
thi IQ khng bao gi n gin. Trong bng M N, s khng ch c mt vin bi m s c K vin bi. Bn
s phi a K vin bi ny n K ch bng t ln xoay bng nht. Cng ni thm rng, trong qu trnh xoay
bng v qu trnh cc vin bi ri xung, khng c hai vin bi no ng thi mt . Nu hai vin bi cng
trn mt ct ri xung, hai vin bi s nm hai lin tip, trn di nhau.
Input
Dng u ghi ba s M, N v K.
K dng tip theo, mi dng ghi mt cp s l ta ca mt ch.
M dng tip theo, mi dng ghi mt xu di N th hin trng thi ban u ca bng. Xu gm cc k t
# th hin chng ngi vt, . th hin trng, o th hin mt vin bi.
D liu vo m bo ti thi in ban u, cc vin bi lun c t pha trn mt chng ngi vt hoc
hng di cng ca bng. D liu vo cng m bo lun c t nht mt cch lm.
Output
Gm 1 dng duy nht ghi P l s ln xoay bng t nht
Example
422

Input:
5 5 1
5 4
#....
.o..#
.#...
.....
..#..
Output:
2
Gii hn:
1 M, N 10
1 K 4
Bng s hnh sao

Ngy:
30-10-2008
im:
1.9
M bi:
QBSTAR
S ngi gii c/
lm:
2/7
Loi bi:
acm
T l ng:
10.0%
Thi gian chy:
2s
Bi chy tt nht:
nkvuong (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
BB c mt bng s gm 48 . Mi c ghi mt ch s t 0 n 9. Mi thuc 2 hng hoc 3 hng nh

hnh v bn. C 12 hng c nh s t A n L. V d ghi s 9 thuc 3 hng D, G v I.
Sau khi in ton b s vo bng, BB ghi li 12 s ln nht ca 12 hng. V d hng A c s ln nht l 5,

hng B c s ln nht l 7, hng H c s ln nht l 0. Sau BB xa ton b bng i. BB s v li hai bng
s khc m bo 12 s ln nht ca 12 hng ging bng ban u. BB mun rng hai bng s mi v: bng
th nht s c tng cc s trong 48 l nh nht, bng th hai s c tng cc s trong 48 l ln nht. Bn
hy gip BB thc hin iu ny.
Input
Mt dng duy nht gm 12 s ln lt l s ln nht ca 12 hng trong bng ban u.
Output
423

Gm hai s, s th nht l tng cc s trong 48 nh nht c th c, s th hai l tng cc s ln nht c
th c.
Nu khng c cch no in c, in ra hai s -1.
Example
Input:
5 7 8 9 6 1 9 0 9 8 4 6
Output:
40 172
Ct bnh pizza
Ngy:
30-10-2008
im:
2.0
M bi:
QBPIZZA
S ngi gii c/
lm:
1/4
Loi bi:
acm
T l ng:
6.2%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
HAOI
chun b cho bui giao lu ca cuc thi HAOI nm nay, msn v Lola mua v mt chic bnh pizza c
hnh th c bit. Chic bnh l mt hnh a gic N nh khng t ct.
BB c giao nhim v s ct chic bnh ny chia cho mi ngi. tng thm s th v cho bui giao
lu, BB a ra bi ton sau cho cc bn th sinh. Nu ta t chic bnh vo h ta cc, mi nht ct s
l mt ng thng song song vi trc honh.
BB mun bit vi mi nht ct nh vy, tng di ca nht ct i qua chic bnh l bao nhiu. Mt nht
ct nu i trng vo mt cnh ca chic bnh phi tnh c di ca cnh (xem trng hp nht ct y = 3
trong test v d). Ngi tr li ng nhiu nht nhn c phn bnh to nht, nhiu pho mt nht, nhiu tht
b nht. beo_chay_so vn rt ham n v rt mun c phn bnh ngon nht . Bn hy gip beo_chay_so
nh.
Input
Dng u tin l hai s nguyn dng N v M trong M l s nht ct s thc hin.
Dng th i trong N dng tip theo ghi hai s nguyn Xi, Yi l ta ca nh th i ca chic bnh.
424

Ta nh ca chic bnh s c lit k theo chiu kim ng h.
Trn M dng cui, mi dng c mt s nguyn alpha trong ng thng y = alpha l ng thng th
hin nht ct.
Output
Tng ng vi M dng trong input, hy ghi ra M s trn M dng th hin tng di ca nht ct th i i
qua chic bnh. Cc s c ghi vi chnh xc t nht 6 ch s sau du phy.
Example
Input:
8 4
0 0
0 3
1 3
3 1
3 3
4 1
3 0
1 1
0
1
2
3
Output:
0.000000
4.000000
2.500000
1.000000
Gii hn:
1 N 1000
1 M 50000
Cc ta c tr tuyt i khng qu 105
Ct bnh
Ngy:
30-10-2008
im:
1.8
M bi:
QBCAKE
S ngi gii c/
lm:
5 / 10
425

Loi bi:
acm
T l ng:
28.0%
Thi gian chy:
1s
Bi chy tt nht:
tinams (100 im - 0.92s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
HAOI
Sau cuc thi HAOI ln ny, Ban t chc s lm mt chic bnh khng l c hnh mt a gic li chiu
i cc th sinh. Trng Ban t chc quyt nh lut ct bnh nh sau: Mi ln chn 1 nh ca a gic ri
ct b nh bng cch ct qua 2 nh k bn. Phn bnh hnh tam gic c c t mi ln ct nh vy s
chia cho cc th sinh. Cng vic ct bnh s tip tc cho n khi chic bnh c dng mt t gic. Ming
bnh cui cng ny s ginh cho ngi ct bnh.
Anh beo_chay_so l mt thnh vin ca Ban t chc nn anh bit trc k hoch ny. V vy anh ta ang
tnh k chim c mt phn bnh ln nht bng cch tnh nguyn lm ngi ct bnh.
Yu cu: Hy tnh xem phn din tch ln nht ca min bnh hnh t gic m anh bo c th c c l bao
nhiu.
Input
Dng th nht ghi s N l s nh ca a gic.
N dng tip theo l cc cp s nguyn biu din cc nh ca a gic. Cc nh c lit k theo chiu kim
ng h
Output
Gm 1 s duy nht ghi din tch ln nht ca t gic tm c. Kt qu ly chnh xc ti 1 ch s phn thp
phn.
Example
Input:
6
2
Output:
21.0
Gii hn:
4 N 1500
426

|xi|, |yi| 15000
Tng vector
Ngy:
30-10-2008
im:
1.1
M bi:
VECTOR
S ngi gii c/
lm:
36 / 49
Loi bi:
acm
T l ng:
24.9%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
HAOI
Trong mt phng ta c N vc t. Mi mt vc t c cho bi hai ch s x v y. Tng ca hai vc t (xi,

yi) v (xj, yj) c nh ngha l mt vc t (xi + xj, yi + yj). Bi ton t ra l cn chn mt s vc t trong
N vc t cho sao cho tng ca cc vec t l vc t (U, V).
Yu cu: m s cch chn tho mn yu cu bi ton t ra trn.
Input
Dng th nht ghi s N (0 N 30).
N dng tip theo, dng th i ghi cc s nguyn xi, yi ln lt l hai ch s ca vc t th i. (|xi|, |yi| 100).
Dng cui cng ghi s hai s nguyn U V (|U|, |V| 109).
Output
Gm mt s duy nht l s cch chn tho mn.
Example
Input:
4
0
-1
0
2
Output:
4
427
Din tch cc hnh trn

Ngy:
30-10-2008
im:
2.0
M bi:
SCIRCLE
S ngi gii c/
lm:
0/0
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
2s
Bi chy tt nht:
(0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Ioicamp - marathon 06 07
Sau khi i tuyn CQB nm kh chc phn im v lm tt cc bi ton v im trong hnh hc. Thy
Thch chuyn sang gii quyt cc bi ton v hnh trn, dng ny thng rt c trong nhng cuc thi ln.
Thy ra cho cc bn 1 bi nh sau:
Trn 1 t giy thy v n ng trn, sau thy t mu n hnh trn ny.
Yu cu: Hy tnh din tch ca phn c t mu.
Input
Dng th nht ghi s nguyn dng N l s hnh trn.
Dng th i trong N dng tip theo ghi 3 s nguyn Xi, Yi v Ri l ta v bn knh ca ng trn th i
trong N ng trn.
Output
Ghi ra duy nht 1 s thc l din tch phn giy phi t mu. Chnh xc ti 5 ch s sau du phy
Example
Input:
2
1 1 1
2 2 4
Output:
3.14159
Gii hn:
428

1 N 50
Kch thc t giy l 10000 * 10000
Tt c cc hnh trn nm trong t giy.
nh s th
Ngy:
30-10-2008
im:
2.0
M bi:
GRNUM
S ngi gii c/
lm:
1/1
Loi bi:
acm
T l ng:
49.8%
Thi gian chy:
2s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Cho mt n th v hng gm K x N nh, cc nh c chia thnh K nhm, mi nhm c N nh. Cc

nhm c t tn bng cc ch ci in hoa A, B, C, ... cc nh tng ng thuc cc nhm c t tn
bng cc s t 0 n N 1. Gi s ChK l ch ci ng vi nhm th K, ta quy c ch ci tip sau A l B,
tip sau B l C, tip sau ChK l A v k hiu ch ci tip sau Ch l next(Ch). th ny c cc tnh cht
sau:
Gia cc nh thuc cng mt nhm khng c cnh ni.
Cc nh thuc 2 nhm bt k c tn l Ch v next(Ch) c ng N cnh ni t nh thuc nhm Ch n nh
thuc nhm next(Ch).
Bn cn c yu cu nh s cc nh ca th sao cho:
Cc nh thuc 1 nhm c nh cc s l hon v ca cc s t nhin t 0 n N 1.
Vi 2 nhm Ch v next(Ch) bt k th N s trn N cnh ni cc nh thuc chng l khc nhau. Nu nh i
thuc nhm Ch c nh s l P k vi nh j thuc nhm next(Ch) c nh s l Q th cnh ni 2 nh
ny c nh s l (N + P Q) mod N.
Bit rng 2 cch nh s cc nh ca th c coi l khc nhau nu trong 2 cch nh s, tn ti mt
nh thuc mt nhm no c nh s khc nhau. Bn hy tnh s cch nh s khc nhau.
Input
Dng th nht ghi 2 s nguyn dng K v N l s nhm v s nh thuc 1 nhm.
Mi dng trong K x N dng tip theo ghi 1 cnh ca th theo dng Ch i j trong Ch l mt k t, i v j
l 2 s nguyn vi ngh c cnh ni t nh i ca nhm Ch n nh j ca nhm next(Ch).
429
Output
Ghi ra duy nht mt s nguyn l s lng cch nh s khc nhau tm c.
Example
Input:
3 3
A 0 0
A 1 2
A 2 1
B 1 0
B 1 2
B 2 2
C 0 2
C 1 1
C 1 2
Output:
54
Gii hn:
1 K 5
1 N 20
S cch nh s khc nhau lun m bo khng qu 1000000
Sp xp cc vin bi
Ngy:
30-10-2008
im:
1.8
M bi:
QBSORT
S ngi gii c/
lm:
5/6
Loi bi:
acm
T l ng:
41.6%
Thi gian chy:
2s
Bi chy tt nht:
jetli (100 im - 0.09s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
C N vin bi mu c sp thnh mt hng trn mt t, cc vin bi thuc 1 trong K mu c nh s t 1

n K.
430

tin phn loi, beo_chay_so mun sp xp li cc vin bi ny sao cho cc vin bi cng mu th nm cnh
nhau, nh vy beo_chay_so s thu c cc on lin tip gm nhng vin bi cng mu, mi mu ch thuc
ng 1 on.
Mi ln beo_chay_so ch c i ch 2 vin bi cnh nhau, hy gip beo_chay_so sp xp li cc vin bi
ny sao cho s ln phi i ch cc vin bi l t nht.
Input
Dng th nht ghi 2 s N v K l s vin bi v s mu. ( 2 N 20000, 1 K 10 )
Dng th hai ghi N s nguyn dng l mu ca N vin bi theo th t.
Output
Ghi ra duy nht mt s nguyn l s php i ch t nht.
Example
Input:
5 3
3 2 1 3 2
Output:
3
Gii thch:
i ch s th 3 v 4:
3 2 3 1 2
i ch s th 4 v 5:
3 2 3 2 1
i ch s th 2 v 3:
3 3 2 2 1
Tch t
Ngy:
30-10-2008
im:
1.5
M bi:
WS
S ngi gii c/
lm:
13 / 17
Loi bi:
acm
T l ng:
57.6%
Thi gian chy:
1s-2s
Bi chy tt nht:
nt_d2 (100 im - 2.99s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
inh Ngc Thng
431

Mt t trong ting Vit c cu to nn t cc m tit. Khi cho mt cu trong ting Vit, vic tch cc m
tit thnh cc t ring bit l mt cng vic cn thit nhng khng n gin. Chng hn cu: ng gi i
nhanh qu c th c tch thnh /ng/ gi i /nhanh / qu/ hoc ng gi/ i / nhanh /qu. Bn l tr
l ca gio s c danh ting, cng vic ca bn l gip gio s vit mt chng trnh tch t. Phn ct li
ca chng trnh l vic m t mt cu trc d liu cho php thc hin ba thao tc c bn trn 1 dy n n
m cho trc (cc n m c nh s ln lt t 1 ti n, theo th t t tri qua phi). Hai n m cnh
nhau c th c ni, hoc khng ni vi nhau, mt t l mt dy n m lin tip (cc i) ni vi nhau.
Cc thao tc trn cu trc d liu bao gm:
J i j: Ni t n m th i ti n m th j vi nhau
D i j: Tch cc n m t n m th i ti n m th j (i j )
C: i hi tr v s lng t ( s lng dy n m ni nhau)
Chng hn vi n = 4 v trng thi hin ti ca dy n m ang l ( 1_2 3_4 ) :
J 2 3 { Dy n m s bin i thnh: 1_2_3_4 }
D 2 4 { Dy n m s bin i thnh: 1_2 3 4 }
C { Tr v gi tr: 3 , do c ba t l 1_2, 3 v 4 }
Input
Dng u ghi s K l s t trong dy ban u v s M l s lng thao tc.
Dng tip theo ghi K s nguyn dng ln lt l di ca cc t tnh t tri qua phi
M dng tip theo mi dng bt u bng 1 ch ci (J/D/C). Trong trng hp ch ci bt u l J hoc D
tip theo ghi s hiu t m thao tc cn thc hin.
Output
ng vi mi thao tc C trong input, ghi ra 1 s trn 1 dng trong file output l s lng t ti thi im
tng ng.
Example
Input:
2 3
2 2
J 2 3
D 2 4
C
Output:
3
432

Gii hn:
S n m khng qu 50000.
M 100000
H qun tr c s d liu
Ngy:
30-10-2008
im:
2.0
M bi:
DBMS
S ngi gii c/
lm:
1/1
Loi bi:
acm
T l ng:
99.0%
Thi gian chy:
2s
Bi chy tt nht:
jetli (100 im - 9.42s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Da trn 1 bi ca
IOICAMP 3
Trong mt h qun tr c s d liu th mt trong nhng kh nng quan trng l iu khin truy cp ng
thi, c ngha l kh nng x l cc tnh hung c nhiu ngi dng cng truy cp n mt vng d liu.
lm c iu ny th mt trong nhng cch ph bin l kha truy cp, c ngha l nu mt ngi ang lm
vic vi mt vng d liu xc nh th nhng ngi khc mun lm vic vi vng ny u phi ch.
Cho mt h c s d liu c N bn ghi c nh s t 1 n N. C M yu cu truy cp v cp nht cc bn
ghi i vi h c s d liu ny. Yu cu th i c biu din bng b 3 s nguyn dng (ai, bi, ti) c ngha
l cn cp nht cc bn ghi t th ai n th bi ti thi im ti. Danh sch cc yu cu c cho l danh sch
cc yu cu c sp xp theo thi gian thc, ngha l tha mn ti tj vi mi i < j.
H qun tr c s d liu s x l ln lt M yu cu ni trn. Bit rng:
- x l mt yu cu no th h qun tr cn 1 n v thi gian tuy nhin n c kh nng x l nhiu
hn 1 yu cu ti 1 thi im nu cc yu cu ny khng truy cp chung mt bn ghi no. Ti thi im ny
n s x l nhiu yu cu nht c th.
- Ti mt thi im, nu c nhiu hn 1 yu cu cn x l th h qun tr c s d liu s x l theo th t
u tin yu cu ng trc trong danh sch cc yu cu, ngha l yu cu c s hiu nh hn.V d:
Cc yu cu trong 1 thi im c s hiu l 1, 2, ...i.Th h s x l yu cu 1 sau xt ln lt cc yu cu
t 2 n i, gp yu cu no x l c th x l v c tip tc nh th cho n ht.
- Cc yu cu cha th x l s c cho vo hng i ch x l ti thi im ngay sau . Ngha l ti
thi im i cha x l c s chuyn sang x l thi im i+1.
V vy mt yu cu cn c x l ti thi im t th c th phi ch n thi im t mi c x l (t
t), khi thi gian ch i ca yu cu ny l t t. Bn hy tnh tng thi gian ch i ca M yu cu.
Input
433

Dng u ghi 2 s nguyn dng N v M.
Dng th i trong M dng tip theo ghi 3 s nguyn dng ai, bi, ti.
Output
Ghi ra duy nht 1 s nguyn l tng thi gian ch i
Example
Input:
5 5
1 3 1
2 5 1
3 4 2
1 2 2
1 1 2
Output:
3
Gii thch v d:
-Thi im 1: Cc yu cu em ra x l l 1, 2.
X l yu cu 1, yu cu 2 chung 2 bn ghi 2, 3 vi yu cu 1 nn chuyn sang x l
thi im 2.
-Thi im 2: Cc yu cu em ra x l l 2, 3, 4, 5.
X l yu cu 2, yu cu 2 v 3 c chung bn ghi vi yu cu 2 nn chuyn sang thi
im 3 x l. X l tip yu cu 5
-Thi im 3: Cc yu cu em ra x l l 3, 4.
X l yu cu 3 v yu cu 4, v chng khng c chung bn ghi no
-Thi im x l cc yu cu t 1.. 5 tng ng s l 1, 2, 3, 3, 2
Gii hn:
1 N 100000.
1 M 100000.
1 ai bi N.
1 ti 100000.
Thm quan cng vin Disney

Ngy:
30-10-2008
im:
2.0
434

M bi:
QBDISNEY
S ngi gii c/
lm:
0/0
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
(0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Cng vin DISNEYLAND l mt cng vin hin i mi c xy dng ngoi H Ni dnh ring
cho tr em. Cng vin ny c N im vui chi c nh s t 1 n N. Cc im vui chi c ni lin vi
nhau bng cc on ng hai chiu theo hng Bc Nam, hoc ng Ty. Cc im vui chi nm
giao ca hai con ng. Khong cch gia hai im vui chi lin tip cch u nhau.
B Bi c b m cho php n cng vin chi trong mt ngy. V cng vin qu rng ln v hp dn nn
b Bi mun la chn mt con ng i qua mt s im vui chi sao cho khng c im vui chi no i qua
2 ln. V b m s b Bi b lc, nn b m ch cho php b i trn on ng gm khng qu K ng r
(khng c i hng qu K ln). Bit rng di on ng ni hai im k nhau c gi tr l 1. Bn
hy gip b m b tnh xem, on ng di nht tha mn iu kin c di l bao nhiu, v c bao
nhiu on ng tha mn iu kin . Lu rng cng vin rt hin i nn c c h thng cu vt v
hm chui. Chnh v vy s c nhng trng hp nh test v d th hai di y (cc nh cng ta
nhng hon ton phn bit vi nhau).
Input
Dng th nht ghi 2 s nguyn dng N v K l s im vui chi v s ng r nhiu nht. ( 0 K < N
10000 )
Dng th i trong N dng tip theo ghi 4 s nguyn m t thng tin v im vui chi th i. Bn s nguyn l
L, D, R, U l im vui chi nm bn tri, di, phi, trn im vui chi th i. (Nu c s bng 0 tng ng
vi pha khng c im vui chi no).
Output
Gm 2 s nguyn S v P trong S l di ng i di nht v P l s ng i c di l S.
Example
Input:
12 4
0 2 3 4
0 0 0 1
1 0 0 0
5 1 0 0
6 0 4 0
0 7 5 0
8 0 9 6
10 11 7 12
435

7 0 0 0
0 0 8 0
0 0 0 8
0 8 0 0
Output:
7 4
Input:
5 2
0 0 2 0
1 3 0 0
4 0 0 2
0 0 3 5
0 4 0 0
Output:
3 2
King ba chn
Ngy:
30-10-2008
im:
1.6
M bi:
TRIPOD
S ngi gii c/
lm:
10 / 15
Loi bi:
acm
T l ng:
34.4%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Trong mt chuyn i d ngoi, BB mun cng cc bn bc bp nu cm trn khu t cm tri. Trn mt t

c n hn , khng c 2 hn no c cng v tr. Mi ngi s chn ra 3 trong s cc hn ny bc
ni ln. 3 hn phi c chn sao cho bn knh hnh trn cha chng l nh nht v nu c mt ci ni
nh bc c ln 3 hn ny th ci ni c bn knh ln hn cng c th bc c ln 3 hn ny. Bn
hy gip BB tm ra 3 hn cn chn.
Input
Dng u tin ghi s n l s hn .
436

Trong n dng sau, dng th u ghi mt cp s nguyn xu, yu l ta ca hn th u.
Output
Ghi ra bn knh hnh trn cha 3 hn tm c ( Chnh xc n 5 ch s sau du phy ).
Example
Input:
3
0 0
4 0
0 4
Output:
2.82842
Gii hn:
3 N 1000.
|xu|, |yu| 30000
COMPANY
Ngy:
30-10-2008
im:
1.7
M bi:
LEM7
S ngi gii c/
lm:
7/8
Loi bi:
oi
T l ng:
44.0%
Thi gian chy:
1.5s
Bi chy tt nht:
nt_d2 (100 im - 0.99s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Mt cng ty gm mt s phng, mi phng gm 1 s lnh o v 1 s nhn vin, trong phng khng c ai

va l lnh o va l nhn vin. Khng c 2 ngi no cng thuc 2 phng khc nhau. Mi lnh o iu
hnh cng vic ca mi nhn vin trong phng nhng 2 lnh o thuc cng phng khng iu hnh nhau.
Hiu qu ca 1 phng c tnh bng s lng quan h trong phng . VD: Nu 1 phng c 2 lnh o v
3 nhn vin th hiu qu phng bng 6. Hiu qu ca cng ty bng tng hiu qu cc phng.
Mt cng ty mun c hiu qu bng 1 s nguyn dng E cho trc. Hy tm cch t chc cng ty sao cho
cc iu kin sau c tho mn:
1. Cng ty c t nht 1 phng
437

2. Hiu qu ca cng ty ng bng E
3. S N l tng s ngi trong cng ty nh nht c th c
4. Nu c nhiu phng n tng s ngi ng bng N tm phng n c tng s lnh o S l nh nht
5. Nu c nhiu phng n vi N v S nh nht tm phng n c s phng K l t nht
Input
Gm 1 dng duy nht: E (1 <= E <= 10000)
Output
Gm 1 dng ghi 3 s nguyn: N, S, K
Example
Input:
7
Output:
7 3 2
Ct hnh ch nht
Ngy:
07-11-2008
im:
2.0
M bi:
VNCUT
S ngi gii c/
lm:
1 / 30
Loi bi:
oi
T l ng:
0.6%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
Ngi ta dng my ct ct mt hnh ch nht c kch thc MxN (N, M nguyn dng 5000) thnh
mt s t nht cc hnh vung c kch thc nguyn dng v c cc cnh song song vi cnh hnh ch nht
ban u. My ct khi ct lun ct theo phng song song vi mt trong hai cnh ca hnh ch nht v chia
hnh ch nht thnh hai phn.
Input
Gm 2 s l kch thc M,N cch nhau bi du cch.
438
Output
Ghi s k l s hnh vung c to ra
Example
Input:
5 6
Output:
5
n b hn lon
Ngy:
11-11-2008
im:
1.0
M bi:
MIXUP2
S ngi gii c/
lm:
38 / 47
Loi bi:
oi
T l ng:
39.8%
Thi gian chy:
1s
Bi chy tt nht:
gui_bai (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
USACO November 2008
Mi trong N c b (4 <= N <= 16) ca bc John c mt s seri phn bit S_i (1 <= S_i <= 25,000). Cc c
b t ho n ni mi c u eo mt chic vng vng c khc s seri ca mnh trn c theo kiu cc bng
ng giang h.
Cc c b giang h ny thch ni lon nn ng xp hng ch vt sa theo mt th t gi c gi l 'hn
lon'.
Mt th t b l 'hn lon' nu trong dy s seri to bi hng b, hai s lin tip khc bit nhau nhiu hn K
(1 <= K <= 3400). V d, nu N = 6 v K = 1 th 1, 3, 5, 2, 6, 4 l mt th t 'hn lon' nhng 1, 3, 6, 5, 2, 4
th khng (v hai s lin tip 5 v 6 ch chnh lch 1).
Hi c bao nhiu cch khc nhau N c b sp thnh th t 'hn lon'?
D liu
* Dng 1: Hai s N v K cch nhau bi khong trng.
* Dng 2..N+1: Dng i+1 cha mt s nguyn duy nht l s seri ca c b th i: S_i
Kt qu
439

* Dng 1: Mt s nguyn duy nht l s cch N c b sp thnh th t 'hn lon'. Kt qu m bo nm
trong phm vi kiu s nguyn 64-bit.
V d
D liu:
4 1
3
4
2
1
Kt qu:
2
ng vin n b
Ngy:
11-11-2008
im:
1.2
M bi:
CHEER
S ngi gii c/
lm:
26 / 26
Loi bi:
oi
T l ng:
52.2%
Thi gian chy:
1s
Bi chy tt nht:
overtherainbow (100
im - 0.32s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
USACO November 2008
Bc John do ny li n ni khng mun bo tr cc con ng dn bc n thm N (5 <= N <= 10,000)

cnh ng (nh s t 1 n N) na. Mi cnh ng l ni ca mt c b. Bc John c k hoch loi b
nhiu nht P (N-1 <= P <= 100,000) con ng sao cho cc cnh ng vn lin thng.
Ban phi xc nh N-1 con ng cn gi li.
ng ni hai chiu j ni gia cnh ng Sj v Ej (1 <= Sj <= N; 1 <= Ej <= N; Sj # Ej) v cn Lj (0 <= Lj
<= 1000) thi gian di chuyn. Khng c hai cnh ng no c ni trc tip bi nhiu hn mt con
ng.
n b bun v h thng giao thng ca chng sp b rt gn. Bn phi thm mi c b t nht mt ln trong
ngy ng vin. Mi ln thm cnh ng i (d ch i ngang qua), bn phi tr chuyn vi c b trong thi
gian Ci (1 <= Ci <= 1000).
Bn s ngh li m trn cng mt cnh ng (bn s c chn) cho n khi n b u ht b suy sp.
Bn s tr chuyn vi c b trong cnh ng m bn ngh li t nht 2 ln vo bui sng thc dy v vo
bui ti khi tr v ngh.
440

Gi d bc John theo li khuyn ca bn gi li mt s con ng v bn s chn cnh ng ti u nht
ngh li, hy xc nh thi gian nh nht bn cn thm tt c n b t nht mt ln trong ngy.
D liu
* Dng 1: Hai s nguyn N v P cch nhau bi khong trng
* Dng 2..N+1: Dng i+1 cha mt s nguyn duy nht Ci
* Dng N+2..N+P+1: Dng N+j+1 cha ba s nguyn phn bit: Sj, Ej v Lj
Kt qu
* Dng 1: Mt s nguyn duy nht, tng thi gian cn thm tt c n b (bao gm hai ln thm c b
ni m bn ngh).
V d
D liu:
5 7
10
10
20
6
30
1 2 5
2 3 5
2 4 12
3 4 17
2 5 15
3 5 6
4 5 12
Kt qu:
176
chi
Ngy:
11-11-2008
im:
1.8
M bi:
TOY
S ngi gii c/
lm:
5/9
Loi bi:
oi
T l ng:
38.4%
Thi gian chy:
1s
Bi chy tt nht:
buihaduong (100 im -
441

0.02s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
USACO November 2008
Ngy sinh nht ca c b Bessie ang n, c mun mng sinh nht trong D (1 <= D <= 100,000; 70% d
liu c 1 <= D <= 500) ngy sp ti.
n b t ch nn Bessie mun c cc chi gp vui cho bui tic. C tnh ton rng cn phi c
T_i (1 <= T_i <= 50) chi trong ngy i.
Trng mu gio ca Bessie c rt nhiu dch v cho cc lp trnh vin b, trong c mt ca hng
chi bn chi vi gi Tc (1 <= Tc <= 60) dollars. Bessie mun tit kim tin bng cch dng li chi,
nhng bc John lo v nguy c bnh truyn nhim nn yu cu cc chi phi c kh trng trc khi s
dng (ca hng s kh trng chi khi bn chng).
C hai dch v kh trng gn trang tri. Dch v th nht i C1 dollars v cn N1 m hon thnh. Dch
v th hai i C2 dollars v cn N2 m hon thnh (1 <= N1 <= D; 1 <= N2 <= D; 1 <= C1 <= 60; 1 <=
C2 <= 60). Bessie em chi n cc dch v ny sau bui tic v c th tr tin ng thi ly chi v
sng hm sau nu dch v cn mt m lm vic, hoc trong cc bui sng sau, nu dch v cn nhiu
m hn.
D liu
* Dng 1: 6 s nguyn cch nhau bi khong trng: D, N1, N2, C1, C2, Tc
* Dng 2..D+1: Dng i+1 cha mt s nguyn duy nht: T_i
Kt qu
* Dng 1: Chi ph t nht cung cp cch chi an ton cho cc bui tic sinh nht ca Bessie
V d
D liu:
4 1 2 2 1 3
8
2
1
6
Kt qu:
35
Going Once, Going Twice, Gone!

442

Ngy:
11-11-2008
im:
0.6
M bi:
AUCTION
S ngi gii c/
lm:
86 / 91
Loi bi:
oi
T l ng:
49.5%
Thi gian chy:
1s
Bi chy tt nht:
funny (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c ngoi tr: SCM

guile
Ngun bi:
USACO November 2008
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 tri phn no chi ph 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 tr 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.
m bo cc nng dn khng ghen t vi nhau, nng dn John s a ra 1 mc gi c nh cho tt c
ngi n mua v bn cc b c kh cho nhng ai tr gi >= mc gi , nhng ngi cn li s b t chi
giao dch.
Hy gip nng dn John tnh xem t mc gi nh nht l bao nhiu thu c nhiu tin nht c th.
D liu
* 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
Kt qu
* Dng 1: 2 s nguyn cch nhau bi du cch: gi bn ca John v s tin m John thu c
V d
D liu:
5 4
2
8
10
7
Kt qu:
7 21
443
Bt n
Ngy:
12-11-2008
im:
0.9
M bi:
LITES
S ngi gii c/
lm:
50 / 67
Loi bi:
oi
T l ng:
32.6%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 1.62s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
USACO November 2008
Bc John gi cho n b thng minh bng cch chng chi cc chi pht trin tr tu. Mt trong cc
tr chi l cc ngn n trong chung. Mi trong s N (2 <= N <= 100,000) con b c nh s t 1..N c
treo mt ngn n mu.
Vo u bui ti, tt c n u tt. n b iu khin cc ngn n bng N cng tc; bm cng tc i i
trng thi ca n i t tt sang bt hoc ngc li.
n b c v thc thi mt danh sch gm M (1 <= M <= 100,000) thao tc m t bi mt trong hai s
nguyn (0 <= thao tc <= 1).
Thao tc th nht (m t bi s 0) theo sau bi hai s nguyn S_i v E_i (1 <= S_i <= E_i <= N) cho bit
cng tc u v cng tc cui. n b s bm mi cng tc t S_i n E_i ng mt ln.
Thao tc th hai (m t bi s 1) yu cu n b n xem c bao nhiu ngn n gia S_i v E_i (1 <= S_i
<= E_i <= N) ang bt. Hy gip bc John m bo rng n b tr li ng bng cch x l danh sch v
tr v cc kt qu ng.
D liu
* Dng 1: Hai s nguyn cch nhau bi khong trng: N v M
* Dng 2..M+1: Mi dng cha mt thao tc vi ba s nguyn cch nhau bi khong trng: thao tc, S_i, v
E_i
Kt qu
* Dng 1..s truy vn: Vi mi truy vn, in ra kt qu l mt s nguyn trn mt dng.
V d
D liu:
4 5
0 1 2
444

0 2 4
1 2 3
0 2 4
1 1 4
Kt qu:
1
2
Bo v nng trang
Ngy:
12-11-2008
im:
0.9
M bi:
NKGUARD
S ngi gii c/
lm:
52 / 62
Loi bi:
oi
T l ng:
39.5%
Thi gian chy:
1s
Bi chy tt nht:
iamme (100 im - 1.27s)
Gii hn m ngun:
50000B
Ngi gi:
hphong
Ngn ng cho php:
Tt c
Ngun bi:
USACO November 2008
Nng trang c rt nhiu ngn i ni, bo v nng trang nng dn John mun t ngi canh gc trn cc
ngn i ny.
Anh ta bn khon khng bit s cn bao nhiu ngi canh gc nu nh anh ta mun t 1 ngi canh gc
trn nh ca mi i. Anh ta c bn ca nng trang l mt ma trn gm N (1 < N <= 700) hng v M (1
< M <= 700) ct. Mi phn t ca ma trn l cao H_ij so vi mt nc bin (0 <= H_ij <= 10,000) ca
(i, j). Hy gip anh ta xc nh s lng nh i trn bn .
nh i l 1 hoc nhiu nm k nhau ca ma trn c cng cao c bao quanh bi cnh ca bn
hoc bi cc c cao nh hn. Hai gi l k nhau nu chnh lch gia ta X khng qu 1 v
chnh lch ta Y khng qu 1.
D liu
* Dng 1: Hai s nguyn cch nhau bi du cch: N v M
* Dng 2..N+1: Dng i+1 m t hng i ca ma trn vi M s nguyn cch nhau bi du cch: H_ij
Kt qu
* Dng 1: Mt s nguyn duy nht l s lng nh i.
V d
D liu:
445

8 7
4 3 2 2 1 0 1
3 3 3 2 1 0 1
2 2 2 2 1 0 0
2 1 1 1 1 0 0
1 1 0 0 0 1 0
0 0 0 1 1 1 0
0 1 2 2 1 1 0
0 1 1 1 2 1 0
Kt qu:
3
SETNJA
Ngy:
16-11-2008
im:
1.4
M bi:
SETNJA
S ngi gii c/
lm:
18 / 28
Loi bi:
acm
T l ng:
18.1%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.32s)
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
COCI 2008-2009
In an infinite binary tree:
Each node has exactly two children a left and a right child.
If a node is labeled with the integer X, then its left child is labeled 2X and its right child 2X+1.
The root of the tree is labeled 1.
A walk on the binary tree starts in the root. Each step in the walk is either a jump onto the left child, onto the
right child, or pause for rest (stay in the same node).
A walk is described with a string of letters 'L', 'R' and 'P':
'L' represents a jump to the left child;
'R' represents a jump to the right child;
'P' represents a pause.
The value of the walk is the label of the node we end up on. For example, the value of the walk LR is 5,
while the value of the walk RPP is 3.
446

A set of walks is described by a string of characters 'L', 'R', 'P' and '*'. Each '*' can be any of the three
moves; the set of walks contains all walks matching the pattern.
For example, the set L*R contains the walks LLR, LRR and LPR. The set ** contains the walks LL, LR, LP,
RL, RR, RP, PL, PR and PP.
Finally, the value of a set of walks is the sum of values of all walks in the set.
Calculate the value of the given set of walks.
Input
A string describing the set. Only characters 'L', 'R', 'P' and '*' will appear and there will be at most 10000 of
them.
Output
Output the value of the set.
Example
Input:
L*R
Output:
25
SVADA
Ngy:
16-11-2008
im:
1.2
M bi:
SVADA
S ngi gii c/
lm:
28 / 30
Loi bi:
acm
T l ng:
57.1%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
COCI 2008-2009
The local zoo has acquired a large open garden in which animals may freely move as in their natural habitats
and entertain visitors with their usual shenanigans.
The most popular animals are monkeys. With their climbing and jumping and other skills, they delight old
and young visitors alike.
447

One species of monkey has specialized in climbing tall trees and picking off coconuts. Another species has
specialized in breaking them open.
There are N monkeys of the first type (numbered 1 through N) and M monkeys of the second type
(numbered 1 through M).
Monkey k of the first type takes Ak seconds to find a good spot on the tree, after which it picks off its first
coconut. After that the monkey produces a new coconut every Bk seconds.
Monkey k of the second type takes Ck seconds to find a good tool for opening the coconuts, after which it
opens its first coconut. After that the monkey opens another coconut every Dk seconds.
Unfortunately, the second type of monkey is extremely aggressive so the two types may not be in the garden
at the same time. Therefore, zoo keepers will chase away the first type of monkeys as soon as they have
picked off all the coconuts. Similarly, if monkeys of the same type stay too long after opening all the
coconuts, fights will ensue. Because of that, zoo keepers will send them away as soon as they have opened
all the coconuts.
The zoo keepers first arrive immediately after all coconuts have been picked, and again immediately after
the monkeys open them all. The time needed for monkeys to enter or leave the garden is also negligibly
small.
Tomislav especially likes the second type of monkey, but can never guess when to arrive in order to see
them. Help him calculate the time when the second type arrives if he knows the total time that monkeys
spent in the garden, but does not know the number of coconuts in the garden.
Input
The first line contains the integer T (1 T 1 000 000 000), the total time that monkeys spent in the garden,
in seconds.
The next line contains the integer N (1 N 100), the number of monkeys of the first type.
Each of the following N lines contains two integers Ak and Bk (1 Ak, Bk 1 000 000 000), how fast
monkey k of the first type is.
The next line contains the integer M (1 M 100), the number of monkeys of the second type.
Each of the following M lines contains two integers Ck and Dk (1 Ck, Dk 1 000 000 000), how fast
monkey k of the second type is.
Output
Output the number of seconds between the arrival of the first type of monkeys and the arrival of the second
type.
Example
Input:
20
448

2
3 2
1 3
3
3 1
4 1
5 1
Output:
13
CAVLI
Ngy:
16-11-2008
im:
1.9
M bi:
CAVLI
S ngi gii c/
lm:
2/4
Loi bi:
acm
T l ng:
25.0%
Thi gian chy:
5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
COCI 2008-2009
Mirko found a wooden board and N nails in his attic. Mirko hammered the nails into the board as fast as
possible. The board can be modeled by a coordinate plane and the nails as points in it. No two nails have the
same x or the same y coordinate.
In order to keep having fun, Mirko stole his sister's elastic hair band, spread it over all nails and then let
go.The elastic, naturally, tightened around the nails.
Mirko then repeats these steps while there are at least three nails in the board:
1. Write down the area of the shape enclosed by the hair band.
2. Picks the leftmost, rightmost, topmost or bottommost nail in the board.
3. Remove the chosen nail from the board; the elastic tightens again around the remaining nails.
Write a program that calculates the numbers written in step 1 of each iteration,if we know the nail Mirko
picks in step 2 of each iteration.
Input
The first line contains the integer N (3 N 300 000), the number of nails.
449

Each of the following N lines contains two integers separated by a space, the coordinates of a nail. All
coordinates will be between 1 and 1 000 000 000. No two nails will share the same x or y coordinate.
The next line contains N-2 letters 'L', 'R', 'U' or 'D'. The letters represent the nails Mirko picked in order:
'L' for the leftmost nail (smallest x coordinate),
'R' for the rightmost nail (largest x coordinate),
'U' for the topmost nail (largest y coordinate),
'D' for the bottommost nail (smallest y coordinate).
Output
Output N-2 numbers, each on a separate line. The numbers are, in order, the areas that Mirko wrote down.
Output numbers with one digit after the decimal point.
Example
Input:
8
1 6
2 4
3 1
4 2
5 7
6 5
7 9
8 3
URDLUU
Output:
34.0
24.0
16.5
14.0
9.5
5.0
ua Xe
Ngy:
03-12-2008
im:
1.1
M bi:
HAF1
S ngi gii c/
lm:
34 / 49
450

Loi bi:
oi
T l ng:
16.2%
Thi gian chy:
1s
Bi chy tt nht:
overtherainbow (100
im - 0.22s)
Gii hn m ngun:
50000B
Ngi gi:
kvd
Ngn ng cho php:
Tt c
Ngun bi:
Cuc ua F1 nm 2009 thay bng vic ua nhiu vng vo cc thi im khc nhau th li ua lun nhiu
vng 1 ln. (Tuy nhin mi vng li c nhiu ng ua, mi ng c chiu di khc nhau ch s khc
nhau,ni vi 1 ng cng ch s vng tip theo)c bit mi xe ch cn chy 1 s ng mi vng v
sang vng ua tip theo.Tuy nhin v l cuc ua F1 tm c th gii nn cc gc ng u c bom(>_
Bn hy tm ra con ng ngn nht i t vng 1 n vng cui gip cc tay ua d dng tr thnh nh
v ch.
Lu :V cuc ua F1 l ua xe t nn cc xe s khng th bay c(nhy cc)m ch c th chy trn cc
on ng k nhau.
Input
Gm mt dng duy nht cha 2 s N,M(s ng ua mi vng,s vng ua).
M dng tip mi dng N s l chiu di ca ng ua.
Output
1 dng duy nht l di ng i ngn nht.
Gii hn
0< M(s vng ua) <=1000.
0< N(s ng ua mi vng)<=1000.
0< a(chiu di mi ng ua)<=1000
V d
Input
3 3
3 2 1
4 1 1
8 1 3
Output
4
451
Hnh vung
Ngy:
07-12-2008
im:
1.3
M bi:
SQUARES
S ngi gii c/
lm:
22 / 25
Loi bi:
acm
T l ng:
55.5%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
BOI
Gi R l mt hnh ch nht vi cc cnh l s nguyn. Hnh ch nht c chia thnh cc hnh vung n
v. Xt mt ng cho, ta biu th f(R) l s lng hnh vung n v c im chung trong vi n. V d,
nu 2 cnh ca R l 2 v 4 th f(R) = 4. Vit chng trnh squ tnh s lng cc hnh ch nht R khc
nhau m f(R ) = N. Hai hnh ch nht vi 2 cnh ab v ba khng c coi l khc nhau.
Input
Trn mt dng duy nht ca standard input ghi s nguyn N (0 < N < 10^6).
Output
Mt dng duy nht ca standard output ghi mt s nguyn l s lng hnh ch nht tm c.
Example
Input:
4
Output:
4
Aladdin
Ngy:
07-12-2008
im:
1.3
M bi:
ALADDIN
S ngi gii c/
lm:
21 / 22
Loi bi:
acm
T l ng:
60.9%
Thi gian chy:
1s
Bi chy tt nht:
linh0710 (100 im 0.22s)
Gii hn m ngun:
50000B
Ngi gi:
huy391992
452

Ngn ng cho php:
Tt c
Ngun bi:
Thy Nguyn Xun My
Cho ti nay, Aladdin vn cn sng t nc Iraq au thng. Ton b gia sn, trong c c cy n thn
b chin tranh hy hoi. nui m, Aladdin li dt thm. Mt hm, anh nhn c mt n t hng dt
mt tm thm hnh vung tha mn nhng iu kin sau: Thm gm N dng v N ct to thnh N N
vung n v. Cc vung n v c mu en hoc trng Vi mi hnh vung c di cnh bng 2, ngi
ta quy nh trc s mu en phi c.
Input
Dng u ghi s nguyn N (N<=200) N 1 dng sau, mi dng ghi N 1 s trong phm vi 0..4 S th V
ca dng th U trong N 1 dng trn l s en trong hnh vung gm 4 (U,V), (U+1,V), (U,V+1),
(U+1,V+1)
Output
Nu khng c kt qu, in ra "No solution" (khng c du "") Ngc li, in ra N dng, mi dng ghi N s 0
hoc 1 tng ng vi khng mu trng hoc mu en. trnh trng hp c nhiu kt qu, bn cn
a ra tm thm tho mn: s nhn c khi vit cc s a[1,1] a[1,2] a[2,1] a[1,3] a[3,1] a[1,4] a[4,1]...
a[1,n] a[n,1] a[2,2] a[2,3] a[3,2] a[2,4] a[4,2]... lin tip l nh nht
Example
Input:
4
3 2 3
2 3 3
1 2 1
Output:
1 0 0 1
1 1 1 1
0 0 1 0
0 1 0 0
Chia hnh ch nht

Ngy:
07-12-2008
im:
1.9
M bi:
HCN
S ngi gii c/
lm:
2/2
Loi bi:
acm
T l ng:
49.9%
453

Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
ACM/ICPC World Final

2002
Mt cch chia hnh ch nht ng c nh ngha nh sau:

1/ Khng chia g c
2/ Chia hnh ch nht thnh 2 na trn v di. 2 na ny li c chia tip
3/ Chia hnh ch nht thnh 2 na tri v phi. 2 na ny li c chia tip
Cho 2 cch chia hnh ch nht A v B, 2 hnh ch nht ny c cng kch thc.
a/ Tm cch chia C s dng t ln chia nht, sao cho mi ng chia ca A v B u c trong cch chia C
b/ Tm cch chia D s dng nhiu ln chia nht, sao cho mi ng chia ca D u c trong c A v B
Input
Gm nhiu b test, mi b: Dng 1: M, N (1<=M,N<=20) ln lt l s ct v s hng ca hnh ch nht
ban u N+1 dng tip, mi dng 4*M + 3 k t m t cch chia (cc cch chia u chnh xc v c dng
hon ton ging pha di) . Ring dng u tin ca mi m t ch c 4*M + 2 k t.
Output
Vi mi test in ra : Dng 1: "Case X", trong X l s th t ca b test, nh s t 1. N+1 dng tip: 2
cch chia ging dng nh input
Example
Input:
4 3
_ _ _ _
_ _ _ _
|_ _ _ _| |_|_ _ _|
|
| |
|_ _|_ _| |_ _ _ _|
3 4
_ _ _
_ _ _
| |
| | |
| |
| |_|_ _|
|_|_ _| |
|
| |
|_ _|_| |_ _|_|
0 0
454
Output:
Case 1:
_ _ _ _
_ _ _ _
|_|_ _ _| |_ _ _ _|
|
| |
|_ _|_ _| |_ _ _ _|
Case 2:
_ _ _
_ _ _
2
| |
| |
|_|_ _| |
|_|_|_| |
|_ _|_| |_ _ _|
Qung co
Ngy:
07-12-2008
im:
1.2
M bi:
ADS
S ngi gii c/
lm:
27 / 28
Loi bi:
acm
T l ng:
59.4%
Thi gian chy:
1s
Bi chy tt nht:
iamme (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
Ha L Thanh Vy
Nhn dp Tt sp n cng ty Jelly-for-Kids quyt nh tng cng vic qung b sn phm n ngi tiu
dng. V th gim c marketing, ng Fruit-Jelly mun gi i s lng nhn vin ti a c th, lm nhim
v tip th ti i l trong thnh ph
Trong thnh ph c m con ng, n i l bn ko (nh s t 1 n n). Mi con ng ch ni trc tip
gia 2 i l, v c k hiu bng ch s ca 2 i l m n ni. ng thi, gia 2 i l bt k c khng
qu 1 con ng ni chng
ng Fruit-Jelly ngh rng, ng ta s qun l nhn vin d hn nu xp mi ngi tip th trn nhng hnh
trnh c tnh cht th t. Tc l nhng i l bn ko trn hnh trnh tha cc iu kin sau
C ng ni trc tip gia 2 i l lin tip nhau trn hnh trnh
T mt i l bt k trong hnh trnh c th i qua tt c cc on ng trong hnh trnh ri tr v ni
xut pht m khng i qua on ng no qu mt ln
455

Hnh trnh phn cng cho mi nhn vin phi c t nht mt on ng cha c nhn vin no khc i tip
th.
Mi nhn vin ch di chuyn trn hnh trnh m anh ta c phn cng. Hy tnh s lng nhn vin ti a
m ng Fruit-Jelly c th xp vic, v hnh trnh c th m mi ngi c xp.
Input
Dng u l 2 s t nhin N v M (N<=2000) (M<=5000)
Trong M dng tip theo, mi dng ghi 2 s nguyn m t mt on ng, mi on ng c m t bi
ch s ca 2 i l m n ni.
Output
Dng u tin ghi Q l s lng nhn vin ti a tm c
Example
Input:
5 6
1 2
2 4
4 5
3 5
1 3
2 3
Output:
2
Siu i xng
Ngy:
09-12-2008
im:
1.4
M bi:
NKSP
S ngi gii c/
lm:
19 / 35
Loi bi:
oi
T l ng:
20.1%
Thi gian chy:
1s
Bi chy tt nht:
timberlake (100 im 0.35s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
456

Ngn ng cho php:
Tt c
Ngun bi:
PTNK Team Selection

2008
M t xu co dai ln hn 1 ch gm cc ch ci la tinh in thng c go i la i xng, n u ta o c xu

t tri sang phi va t phi sang tri l nh nhau. M t xu c go i la siu i xng, n u n l xu i xng
hoc c to thnh bng cch ghp lin tip t nhiu xu i xng.
Yu cu: Cho m t xu S, hy m s xu con siu i xng ca S.( Xu con ca mt xu S l mt on lin
tip cc k t ca S)
D liu
Cha xu S vi di khng vt qu 1000.
Kt qu
Ghi ra s xu con tm c.
V d
D liu
abc
Kt qu
0
D liu
abacdc
Kt qu
3
Cy nh phn tm kim
Ngy:
09-12-2008
im:
0.9
M bi:
NKTREE
S ngi gii c/
lm:
54 / 75
Loi bi:
oi
T l ng:
16.6%
Thi gian chy:
1s
Bi chy tt nht:
mr_luu91 (100 im 0.29s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
PTNK Team Selection

2008
457

M t trong nhng c u truc d li u n i ti ng lu tr d liu la cy nhi phn tim ki m. Mi nt trn cy c
nhiu nht l hai nt con v nhiu nht l mt nt cha. Cc nt con c chia thnh hai loi: nt con tri v
nt con phi. Mi cy tm kim c mt nt khng c nt cha gi l nt gc, v c t nht mt nt khng c
nt con gi l nt l. Mi mt nt c gn mt gi tr no tha iu kin sau: Ti mt nt v bt k t t ca
cc gi tr thuc cy con tri vi gc v nh hn gi tr ti nt v, v t t ca cac gi tr cc nt thuc cy con
bn phai vi gc v ln hn gi tr ti nut v.
Hnh bn di m t mt cy nh phn tm kim trong nt c gi tr 5 l gc, cc nut vi gi tr 2, 4 v 8
l cc nt l.
ng i trn cy l dy cc gi tr ti cc nt lin tip, trong o mi nt sau la nt con trc tip ca nt
trc .
Yu cu: Cho m t day gm cc gi tr i mt khc nhau. Hy cho bit t n ta i hay khng cy tim ki m nhi
phn, m trn tn ti mt ng i vi dy gi tr tng ng l dy cho.
V d, tn ti cy nh phn tm kim vi day 5 1 3 2, cn khng tn ti cy nh phn tm kim vi dy 5 2 3
1.
D liu
Ln lt lit k cc gi tr ca dy cho. Hai phn t c ghi cch nhau bi khong trng hoc du xung
dng. S lng phn t ca dy khng vt qu 50 000 v mi phn t ca dy c gi tr tuyt i khng
vt qu 231.
Kt qu
Ghi ra t YES, n u tn ti cy, tng ng dy cho hoc t NO trong trng h p ng c la i.
V d
D liu
5 1 3 2
Kt qu
YES
D liu
5 2 3 1
Kt qu
NO
Chui ht
Ngy:
09-12-2008
im:
1.7
M bi:
NKNL
S ngi gii c/
lm:
7 / 17
458

Loi bi:
oi
T l ng:
21.0%
Thi gian chy:
1s
Bi chy tt nht:
tinams (100 im - 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
PTNK Team Selection

2008
Nh ta bit, mt chui ht c th c xu t rt nhiu ht ngc mu sc khc nhau. tin li, ta dng cc

ch ci in thng m t cc mu sc: chng hn ch a m t mu , ch b m t mu xanh, v.v.. Cc ht
ngc c th c 26 mu khc nhau tng ng vi 26 ch ci in thng. Nh vy, mt chui ht c th c
biu din bi mt xu k t gm cc ch ci in thng, mi k t m t mu ca cc ht ngc theo chiu
kim ng h bt u t mt ht ngc no .
Tuy nhin, do chui ht c dng vng trn, nn c th c nhng chui k t khc nhau cng biu din mt
chui ht, chng hn bacade v cadeba c th cng biu din chui ht . trnh tnh trng ny, ta quy nh
trong cc chui k t cng th hin mt chui ht, ta ch s dng chui k t c th t t in nh nht
biu din chui ht . Nh vy vi chui ht v d nu trn ch biu din bng chui acadeb.
m bo tnh thm m, mi chui ht cn c t nht 5 ht ngc.
Yu cu: Cho mt chui k t S gm cc ch ci in thng. Nhim v ca bn l m xem c bao nhiu
chui con gm cc k t lin tip ca S c th biu din mt chui ht no .
D liu
Chui k t S, gm cc ch ci in thng ( di khng qu 250).
Kt qu
Ghi ra mt s nguyn duy nht l s chui con gm cc k t lin tip ca S c th biu din mt chui ht
no .
V d
D liu
absdcabd
Kt qu
1
Gii thch
Ch duy nht 1 chui ht l : absdc
Xy dng thnh ph
Ngy:
09-12-2008
im:
0.7
M bi:
NKCITY
S ngi gii c/
78 / 81
459

lm:
Loi bi:
oi
T l ng:
58.8%
Thi gian chy:
1s
Bi chy tt nht:
hcmut (100 im - 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
PTNK Team Selection

2008
Nc Anpha ang lp k hoch xy dng mt thnh ph mi v hin i. Theo k hoch, thnh ph s c N

v tr quan trng, c gi l N trng im v cc trng im ny c nh s t 1 ti N. B giao thng
lp ra mt danh sch M tuyn ng hai chiu c th xy dng c gia hai trng im no . Mi tuyn
ng c mt thi gian hon thnh khc nhau.
Cc tuyn ng phi c xy dng sao cho N trng im lin thng vi nhau. Ni cch khc, gia hai
trng im bt k cn phi di chuyn c n nhau qua mt s tuyn ng. B giao thng s chn ra mt
s tuyn ng t trong danh sch ban u a vo xy dng sao cho iu kin ny c tha mn.
Do nhn c u t rt ln t chnh ph, b giao thng s thu hn mt i thi cng ring cho mi tuyn
ng cn xy dng. Do , thi gian hon thnh ton b cc tuyn ng cn xy dng s bng thi
gian lu nht hon thnh mt tuyn ng no .
Yu cu: Gip b giao thng tnh thi gian hon thnh cc tuyn ng sm nht tha mn yu cu nu.
D liu
Dng cha s N v M (1 N 1000; 1 M 10000).
M tip theo, mi dng cha ba s nguyn u, v v t cho bit c th xy dng tuyn ng ni gia trng
im u v trng im v trong thi gian t. Khng c hai tuyn ng no ni cng mt cp trng im.
Kt qu
Mt s nguyn duy nht l thi gian sm nht hon thnh cc tuyn ng tha mn yu cu nu.
V d
D liu
5 7
1 2 2
1 5 1
2 5 1
1 4 3
1 3 2
5 3 2
3 4 4
Kt qu
460

3
Cho ko hay b ph no
Ngy:
10-12-2008
im:
1.0
M bi:
TREAT
S ngi gii c/
lm:
43 / 60
Loi bi:
oi
T l ng:
31.3%
Thi gian chy:
1s
Bi chy tt nht:
raptor724 (100 im 0.72s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
USACO December 2008 Gold Division
Hng nm Wisconsin ti b li t chc ngy hi Halloween vo k ngh Thu. Chng s mc ha trang

v i xin ko nng dn John t trong N (1 <= N <= 100,000) chung b ( thun tin ta nh s cc
chung b t 1 -> N).
cho l b chi vui hn, chung i John s cm 1 bin bo next_i (1 <= next_i <= N) cho bit sau khi xin
ko chung i th b s phi tip tc i ti chung next_i xin ko tip.
B i s bt u xin ko t chung i. V mt con b s dng vic xin ko nu n i ti 1 chung m n
tng i qua ri.
Tnh xem mi con b s xin c bao nhiu ko, bit rng mi chung chng ch xin c 1 vin ko m
thi.
QUY CCH NHP D LIU
Dng 2..N+1: Dng i+1 gm 1 s nguyn duy nht: next_i
V D
4
1
3
2
3
QUY CCH GHI KT QU
Dng 1..N: Dng i cha 1 s nguyn l s ko m b i nhn c
461
V D
1
2
2
3
Tin mt
Ngy:
10-12-2008
im:
1.1
M bi:
SEC
S ngi gii c/
lm:
31 / 36
Loi bi:
oi
T l ng:
40.0%
Thi gian chy:
1s
Bi chy tt nht:
d_k_phong (100 im 2.81s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Bessie nh dn n b i trn. m bo b mt, n b lin lc vi nhau bng cch tin nhn nh phn.
Tng l mt nhn vin phn gin thng minh, John thu c M (1 <= M <= 50,000) tin nhn mt, tuy
nhin vi tin nhn i John ch thu c b_i (1 <= b_i <= 10,000) bit u tin.
John bin son ra 1 danh sch N (1 <= N <= 50,000) cc t m ha m n b c kh nng ang s dng.
Tht khng may, John ch bit c c_j (1 <= c_j <= 10,000) bit u tin ca t m ha th j.
Vi mi t m ha j, John mun bit s lng tin nhn m John thu c c kh nng l t m ha j ny.
Tc l vi t m ha j, c bao nhiu tin nhn thu c c phn u ging vi t m ha j ny. Vic ca bn
l phi tnh s lng ny.
Tng s lng cc bit trong d liu u vo (tng cc b_i v c_j) khng qu 500,000.
QUY CCH NHP D LIU
Dng 1: 2 s nguyn: M v N
Dng 2..M+1: Dng i+1 m t tin nhn th i thu c, u tin l b_i sau l b_i bit cch nhau bi
du cch, cc bit c gi tr 0 hoc 1.
Dng M+2..M+N+1: Dng M+j+1 m t t m ha th j, u tin l c_j sau l c_j bit cch nhau
bi du cch.
V D
462
4 5
3 0 1 0
1 1
3 1 0 0
3 1 1 0
1 0
1 1
2 0 1
5 0 1 0 0 1
2 1 1
GII THCH V D
C 4 tin nhn v 5 t m ha. Cc tin nhn thu c c phn u l 010, 1, 100 v 110. Cc t m ha c
phn u l 0, 1, 01, 01001, v 11.
QUY CCH GHI KT QU
Dng 1..M: Dng j: S lng tin nhn m c kh nng l t m ha th j
V D
1
3
1
1
2
GII THCH
0 ch c kh nng l 010 -> 1 tin nhn. 1 ch c kh nng l 1, 100, hoc 110 -> 3 tin nhn. 01 ch c th l
010 -> 1 tin nhn. 01001 ch c th l 010 -> 1 tin nhn. 11 ch c th l 1 hoc 110 -> 2 tin nhn.
Hng ro ln nht
Ngy:
10-12-2008
im:
1.9
M bi:
FENCE
S ngi gii c/
lm:
2/4
Loi bi:
oi
T l ng:
9.1%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 1.9s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
463

Ngn ng cho php:
Tt c
Ngun bi:
Nng dn John mua N (5 <= N <= 250) ci cc xy mt hng ro tht p. Mt ci hng ro l p

nu n c dng 1 a gic li vi cc nh l cc cc. Coi ng c nh mt phng ta th cc i c cm
im ta l (x_i, y_i) (1 <= x_i <= 1,000; 1 <= y_i <= 1000; x_i, y_i l s nguyn).
Bit rng khng c 3 cc no thng hng vi nhau. Hy tnh xem c th chn c nhiu nht bao nhiu ci
cc lp c 1 ci hng ro p.
45% im cho bi ny l cc test c N <= 65.
QUY CCH NHP D LIU
Dng 1: Mt s nguyn: N
Dng 2..N+1: Dng i+1 m t ta ca cc th i l 2 s nguyn cch nhau bi du cch: x_i v y_i
V D
6
5 5
2 3
3 2
1 5
5 1
1 1
M T V D
Cc cc c dng mt hnh vung vi 2 im bn trong.
QUY CCH GHI KT QU
Dng 1: Mt s nguyn, s cc ti a c th to thnh mt a gic li
V D
5
GII THCH
a gic li l ng gic (2,3), (3,2), (5,1), (5,5), (1,5).
Chi c
464

Ngy:
10-12-2008
im:
1.9
M bi:
WINCHK
S ngi gii c/
lm:
3/6
Loi bi:
oi
T l ng:
21.7%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0.22s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Ti b rt thch chi c v chi c vi nim say m v b. Nhng tht ng tic, d chng rt thch chi c,
chng li chi qu km v mun nh bn gip chng.
Cho 1 bn c kch thc NxN (4 <= N <= 500). Cc qun c ch di chuyn trn cc '+' v n qun i
phng khi nhy qua 1 qun c ca i phng, qun c b n s b loi ra khi bn c. V d sau y l 1
mt bn c kch thc 8x8:
- + - + - + - +
K l k hiu qun Vua ca Bessie; o l k hiu qun
+ - + - + - + -
c ca i phng. Bessie c i trc v s chn ra
- + - K - + - +
1 qun Vua di chuyn. Qun Vua s nhy cho lin
+ - + - + - + -
tc qua u cc qun c ca i phng (v loi cc qun
- o - o - + - +
i phng ra khi bn c mi khi nhy qua).
+ - K - + - + -
Vi bn c ny, cch i tt nht s l dng qun Vua gc tri
- o - + - + - +
di nhy lin tc qua u tt c 3 qun c ca i phng, v
+ - K - + - K -
nh vy tr chi s kt thc (di chuyn qun Vua

nh du l >KK<- + - + -
+ - + - + - + -
- o - o - + - +
- o - o - + - +
- + - o - + - +
- + - + - + - +
+ - K - + - + -
>K<- K - + - + -
+ - K - + - + -
+ - K ->K<- + -
- o - + - + - +
- + - + - + - +
- + - + - + - +
- + - + - + - +
+ ->K<- + - K -
+ - + - + - K -
+ - + - + - K -
+ - + - + - K -
Nh vy cc bc i ca qun Vua i qua cc sau:

1 2 3 4 5 6 7 8
Dng Ct
1 - + - + - + - +
start: 8
2 + - + - + - + -
move:
3 - + - K - + - +
move:
4 + - * - + - + -
move:
5 - o - o - + - +
6 * - K - * - + 7 - o - + - + - +
8 + - K - + - K -
465

Vit chng trnh xc nh xem Bessie c th kt thc tr chi c khng. C t nht 1 qun vua v 1 qun
c i phng trn bn c.
QUY CCH NHP D LIU
Dng 1: Mt s nguyn: N
Dng 2..N+1: Dng i+1 cha N k t (cc k t c th l: '-', '+', 'K', hoc 'o') biu din dng i ca
bn c. Dng 2 lun bt u bng mt k t '-'.
V D
8
-+-+-+-+
+-+-+-+-+-K-+-+
+-+-+-+-o-o-+-+
+-K-+-+-o-+-+-+
+-K-+-K-
QUY CCH GHI KT QU
Dng 1..?: Nu Bessie khng th kt thc trn u trong lt ca mnh, ghi ra "impossible" trn 1
dng. Ngc li ghi ra v tr ca qun Vua sau cc bc di chuyn. C nhiu phng n th phng
n no cng c, min l c th kt thc trn u.
V D
8 3
6 1
4 3
6 5
Cng ty
Ngy:
10-12-2008
im:
1.3
M bi:
COMPANY3
S ngi gii c/
lm:
22 / 28
Loi bi:
acm
T l ng:
34.7%
Thi gian chy:
3s
Bi chy tt nht:
- 0.02s)
466

Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP 3
Trong tp on Big Soft ca MSN, c mt cng ty nh c nhiu ngi ti nhng do gim c cng ty l
beo_chay_so xy dng mt h thng nhn s rt phc tp nn cng ty khng th pht trin tt c. H
thng nhn s c b tr nh sau. ng cao nht chnh l gim c beo_chay_so v beo_chay_so l sp
ca mi ngi khc. Sau v gim c ny l mt mi quan h nhng nht gia sp v nhn vin. Tuy nhin
nhng mi quan h ny vn phi m bo 2 nguyn tc sau:
Nu A l sp ca B v B l sp ca C th A cng l sp ca C.
Khng tn ti ng thi A,B,C sao cho A l sp ca B, B l sp ca C v C l sp ca A.
MSN ang mun ti thit li cng ty, bn hy gip MSN gi li nhiu ngi nht c th sao cho khng
c ai l sp ca ai trong s nhng ngi c chn, c nh vy mi ngi mi pht huy ht kh nng ca
mnh c.
Input
Dng u tin ghi 2 s nguyn dng N v M l s ngi ca cng ty v s mi quan h. ( 1 N 1000, 1
M N(N1)/2 )
Dng th i trong M dng tip theo ghi 2 s nguyn dng ai v bi vi ngha ngi ai l sp ca bi.
Bit rng gim c beo_chay_so lun c k hiu l ngi th 1.
Output
Gm mt dng duy nht ghi s nguyn dng S l s ngi ti a c th gi li.
Example
Input:
3 3
1 2
2 3
1 3
Output:
1
Xy dng ng
Ngy:
10-12-2008
im:
1.1
M bi:
QBBUILD
S ngi gii c/
35 / 45
467

lm:
Loi bi:
acm
T l ng:
31.7%
Thi gian chy:
1s
Bi chy tt nht:
anya (100 im - 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
IOICAMP 3
Vua Peaceful va khai hoang mt vng t lp ra t nc Peace, lc u ch c N thnh ph (c nh

s t 1 n N) v khng c con ng no.
Vua Peace chn ra 4 thnh ph c bit lm trung tm kinh t v 4 thnh ph ny phi c lin thng
vi nhau. Chi ph xy dng cc con ng khng phi nh v th nh vua mun s dng chi ph t nht
xy dng cc con ng sao cho 4 thnh ph c bit vn lin thng.
Bn c bit chi ph c tnh xy dng mt s con ng v bn hy chn mt s con ng xy
dng theo ng nh vua bit rng lun tn ti t nht mt phng n xy dng ng sao cho 4 thnh
ph c bit lin thng.
Input
Dng u tin ghi s nguyn dng N l s lng cc thnh ph.( 1 N 100 )
Dng th hai ghi 4 s nguyn l s hiu ca 4 thnh ph c bit.
Trong mt s dng tip theo, mi dng ghi 3 s nguyn u, v v c vi ngha mun xy dng mt con ng
hai chiu ni trc tip gia 2 thnh ph u v v th chi ph l c. ( 1 c 5000 )
Output
Gm 1 dng duy nht l tng chi ph nh nht xy dng h thng ng.
Example
Input:
5
2 3 4 1
1 2 10
1 5 1
5 2 1
1 4 1
4 3 3
3 2 2
Output:
5
468
Vn chuyn hng
Ngy:
10-12-2008
im:
1.6
M bi:
QBTRANS
S ngi gii c/
lm:
10 / 13
Loi bi:
acm
T l ng:
21.2%
Thi gian chy:
1s
Bi chy tt nht:
dai_ca (100 im - 0.22s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Cng ty MCA l mt cng ty vn ti ni ting ti t nc Peace, vi mng li hot ng trong khp c

nc. Sp n k nim 30 nm thnh lp, gim c cng ty quyt nh m mt t khuyn mi ln cho tt
c cc khch hng. C th l cng ty s m mt s tuyn ng vn chuyn min ph cho khch hng.
Mi tuyn ng nh vy s xut pht t mt thnh ph, qua mt s thnh ph (khng i qua thnh ph no
2 ln) ri quay v ni xut pht. Nu tnh chi ph vn chuyn trung bnh trn tng tuyn ng th chi ph
chi ra cho t khuyn mi ny s khng nh nn gim c cng mun cc tuyn ng ny tha iu kin
tng di ng i chia cho tng s con ng trong tuyn ng (gi l chi ph ca tuyt ng) l
nh nht.
Cho mt mng li vn chuyn hng ca cng ty MCA hy tm ra tuyn ng thch hp nht (tha c 2
iu kin trn) cho t khuyn mi. Xut ra chi ph ca tuyn ng tm c.
Input
Dng u tin ghi hai s nguyn N v M l s thnh ph v s con ng trong mng li. ( 1 N 100, 1
M 9000 )
M dng tip theo, mi dng ghi ba s nguyn a b c vi ngha c ng i mt chiu t a n b vi di
l c. ( 1 c 223 )
Output
Gm 1 dng duy nht ghi mt s thp phn vi l chi ph nh nht. Nu khng tn ti tuyn ng no tha
mn ghi ra -1. ( ghi chnh xc n 2 ch s sau du phy )
Example
Input:
3 3
1 2 1
2 3 1
3 1 1
469

Output:
1.00
Chia dy
Ngy:
10-12-2008
im:
1.2
M bi:
QBDIVSEQ
S ngi gii c/
lm:
29 / 31
Loi bi:
acm
T l ng:
54.3%
Thi gian chy:
1s
Bi chy tt nht:
mr_hh (100 im - 0.43s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
Dy s M phn t B c gi l dy con ca dy s A gm N phn t nu tn ti mt m chuyn C gm M

phn t tho mn B[i]=A[C[i]] vi mi I = 1M v 1 C[1] < C[2] < ... < C[m] N.
Mt cch chia dy A thnh cc dy con "c chp nhn" nu cc dy con ny l cc dy khng gim v
mi phn t ca dy A thuc ng mt dy con.
Yu cu: Bn hy chia dy con ban u thnh t dy con nht m vn "c chp nhn".
Input
Dng u tin ghi s N l s phn t ca dy A. ( N 105 )
N dng tip theo ghi N s t nhin l cc phn t ca dy A. ( Ai 109 )
Output
Ghi mt duy nht l s lng dy con t nht tha mn.
Example
Input:
4
1
5
4
6
Output:
470

2
Xy ng
Ngy:
10-12-2008
im:
2.0
M bi:
BUILD28
S ngi gii c/
lm:
0/1
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
mai_an (0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
L n Khu
Ngi ta nh xy mt con ng ct ngang khu rng Amazon. Khu rng Amazon c ta ha s l

mt hnh ch nht vi gc tri di l (0, 0), gc phi trn l (x, y). Con ng s c m t bng hai
ng thng chy song song ct cnh tri ca khu rng (0, y1) v (0, y2), ct cnh phi ca khu rng ti
(x, y3) v (x, y4). Trong y1, y2, y3, y4 phi tha mn:
0 y1 < y2 y
0 y3 < y4 y
y2 y1 = y4 y3
Tuy vy trong khu rng c N khu vc cm v l ni sinh sng ca nhng loi vt qu him. Mi khu vc
cm l mt hnh ch nht c cnh song song vi trc ta . Con ng c th i qua nh cc khu vc cm
hoc i trng vo cnh ca khu vc cm. Yu cu hy tnh xem rng ti a ca con ng l bao nhiu.
rng ca mt con ng c tnh bng khong cch gia hai ng song song.
Input
Dng th nht ghi 2 s nguyn X, Y. (0 < X, Y 106 )
Dng th hai ghi s N. ( 0 N 100 )
Dng th i trong N dng tip theo ghi ta ca gc tri di v phi trn ca hnh ch nht th i.
Output
Gm 1 dng ghi rng ca con ng ( Chnh xc n 4 ch s sau du phy )
Example
471

Input:
100 150
4
98 3 99 15
48 36 50 43
39 1 71 10
24 50 40 70
Output:
80.0000
UI BT
Ngy:
13-12-2008
im:
1.5
M bi:
THTRACE
S ngi gii c/
lm:
14 / 15
Loi bi:
acm
T l ng:
53.2%
Thi gian chy:
1s
Bi chy tt nht:
susu (100 im - 0.02s)
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
Th v si chi mt tr chi ui bt nh sau:

Trn mt th v hng gm N nt v M cnh (N 1000, M 10000), ti thi im bt u, si v th
mi ngi ng mt nt khc nhau. Gi thit cc cnh ca th u c cng mt di v vn tc ca
si v th l bng nhau: Sau mi mt n v thi gian, si (th) u c th hoc ng ti ch hoc chy sang
mt nt lin k (c cnh ni trc tip). Trong tr chi ny, si s c gng ui bt th v th tt nhin s
phi c gng chy sao cho khng b bt. Th c cht li th l thy c si s chy v hng no (nt k
tip hoc ng yn) ri mi phi quyt nh hng chy ca mnh. Mc d vy, c hai cng s cng n nt
mi sau mt n v thi gian, ngha l nu si v th nhy n cng mt nt th si s bt c th.
Bi ton t ra l vi mi trng thi ban u, gm v tr ca th v si, hy cho bit si c th chc chn bt
c th hay khng. Ni cch khc, liu c chin lc cho si bt c th trong hu hn thi gian,
khng ph thuc vo chin lc ca th hay khng.
Lu : cc bn c thc mc g v test xin lin h mr_invincible ^^
Input
D liu nhp theo khun dng nh sau:
Dng u ghi ba s nguyn dng N, M v K (K 10).
K dng tip theo, mi dng ghi hai s, l v tr ban u ca si v th.
472

M dng tip theo m t cc cnh ca th, mi dng ghi hai s l hai nt u mt ca mt cnh.
Output
Ghi kt qu gm K dng, ln lt l cu tr li cho cc trng thi ban u theo th t nh trong file input.
Trn mi dng, ghi 1 nu c chin lc si chc chn bt c th v 0 trong trng hp ngc li.
Example
Input:
5 5 2
1 5
1 2
1 2
2 3
2 4
2 5
3 4
Output:
1
0
Khu vui chi

Ngy:
14-12-2008
im:
2.0
M bi:
HCN2
S ngi gii c/
lm:
1/4
Loi bi:
acm
T l ng:
21.4%
Thi gian chy:
1s-10s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
Mt mnh t c quy hoch lm khu vui chi. Tuy nhin mnh t li khng vung vn, trong khi khu
vui chi li yu cu phi c dng hnh ch nht. Khun vin ca mnh t c xc nh bi mt ng gp
khc khp kn khng t ct vi cc hnh ch nht c to nguyn trn h to vung gc -cc Oxy.
Xc nh trong khun vin mnh t hnh ch nht c din tch ln nht tho mn cc iu kin:
473

- Hnh ch nht phi nm hon ton trong khun vin mnh t cho (ngha l hnh ch nht khng c
cha im nm ngoi khun vin mnh t)
- Bn nh ca hnh ch nht phi c to nguyn
- Cc cnh phi song song vi trc to Ox hoc Oy
Input
- Dng 1: N l s nh ca ng gp khc bao quanh mnh t. (N<=100)
- Dng th i trong s N dng tip theo cha 2 s nguyn Xi, Yi (0<=Xi,Yi<=1000) c ghi cch nhau bi
1 du cch. Cc nh ca ng gp khc c nh s t 1 theo 1 chiu i vng quanh n
Output
Gm 1 dng duy nht cha din tch hnh ch nht ln nht tho mn bi.
Example
Input:
7
0 5
2 7
3 5
4 9
6 5
5 0
0 0
Output:
25
ua xe
Ngy:
14-12-2008
im:
1.8
M bi:
DUAXE
S ngi gii c/
lm:
5/8
Loi bi:
acm
T l ng:
18.5%
Thi gian chy:
1s
Bi chy tt nht:
tienpro (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
474

Trong 1 cuc ua xe phn khi ln, ng ua gm N on ng. im chuyn tip gia 2 on ng
lin tip gi l cc nt, c tt c N-1 nt nh th. R rng ai cng mun i vi tc cao nht v hc
nhanh nht, tuy nhin c cc rng buc sau:
- Vn tc ti v tr xut pht v v ch phi bng 0 (tc l xe phi dng ng ch)
- Xe ch c th tng tc mc gia tc ti a A (m/s^2)
- Xe ch c th gim tc (phanh) mc gia tc ti a B (m/s^2) iu ny c ngha l ti mi thi im, gia
tc a ca xe phi tho mn -B<=a<=A
- Xe khng b gii hn vn tc trn ng nhng khi qua cc nt chuyn tip, m bo an ton, li xe
khng c php vt qu mt vn tc V (m/s) no , tu thuc vo tng nt.
Gi thit vn tc ca xe khng b gii hn no khc ngoi cc rng buc trn. Hy tnh thi gian ngn nht
xe c th v ch.
Input
D liu nhp vo c khun dng nh sau:
- Dng 1 ghi 3 s nguyn dng N, A, B (N<=1000)
- N dng tip, mi dng m t 1 chng ng, gm 2 s nguyn dng l di ca chng v vn tc gii
hn ti im nt cui chng. Ch rng im xut pht l im u ca chng 1 v im ch l im cui
chng N
Output
Thi gian ngn nht (n v giy) xe c th n ch. Kt qu ghi di dng s thc chnh xc n 3 ch
s thp phn. Bi ca bn s c coi l Accept nu kt qu sai lch khng qu 0.01 so vi kt qu ca file
p n.
Example
Input:
1 1 1
100 0
Output:
20.000
Input:
2 1 1
10 10
90 0
Output:
475

20.000
Game on board
Ngy:
14-12-2008
im:
2.0
M bi:
BGAME
S ngi gii c/
lm:
1/1
Loi bi:
acm
T l ng:
62.4%
Thi gian chy:
1s-26s
Bi chy tt nht:
- 5.05s)
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
BOI
Hai ngi chi A v B chi mt tr chi trn mt bng hnh vung kch thc n*n. Cc vung n v ca
bng c th c mu trng hoc en. Tr chi ch c chi trn cc vung mu trng, khng c ng
n cc mu en. Mi ngi chi c mt qun c, ban u c t ti mt gi l xut pht mt
trong s cc mu trng ca bng. xut pht ca A khc xut pht ca B.
Ti mi lt i, ngi chi s di chuyn qun c ca mnh sang mt trong s cc trng hng xm ca n
(c th l pha trn, pha di, bn phi, hoc bn tri). Nu ngi chi di chuyn qun c ca mnh n
vung ang b chim bi qun c ca i phng th anh ta s c thm mt lt i tip. Ch rng trong
trng hp ny, hng di chuyn lt i th hai c th khc lt i trc .
Ngi chi A i trc, sau cc ngi chi lun phin nhau thc hin lt i. Mc tiu ca tr chi l di
chuyn qun c ca mnh n c xut pht ca i phng. Ngi chi no di chuyn qun c ca
mnh n xut pht ca i th trc th s ginh chin thng. Ngay c khi lt i cui cng ca ngi
chi cha 2 bc di chuyn, v anh ta ch nhy qua xut pht ca i th (khi ang b chim bi qun
c ca i phng), th anh ta vn ginh chin thng. Chng ta mun tnh xem ngi chi no c chin lc
ginh chin thng (m khng cn quan tm xem i th ca mnh c chi tt n u).
Task
Vit chng trnh:
c vo cch b tr bng vung v cc xut pht ca 2 ngi chi t standard input.
Tm xem ngi no s c mt chin lc ginh thng li.
Vit kt qu ra standard output
Input
Dng u tin ca standard input cha mt s nguyn t l s lng test ( 1 t 10). Sau s l m t ln
lt ca t test. Mi test c m t nh sau: Trn dng u tin ca b test l s nguyn n ( 2 n 300), l
di ca bng vung. N dng tip theo cha thng tin v bng vung. Mi dng cha n k t (khng
476

c du cch gia). Mi k t c th l . ( mu trng), # ( mu en), A ( xut pht ca A), hoc B
( xut pht ca B).
Bn c th chc chn rng s tn ti mt ng i gm cc trng gia im xut pht ca A v im xut
pht ca B.
Output
Vi mi test, in ra trn ng 1 dng ca standard output mt k t A hoc B ch ra ngi no s c chin
lc ginh chin thng.
Example
Input:
2
4
A...
.#..
....
...B
4
A...
....
..#.
...B
Output:
B
A
Ct dy
Ngy:
15-12-2008
im:
1.7
M bi:
CUTSEQS
S ngi gii c/
lm:
6/9
Loi bi:
acm
T l ng:
16.0%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
477

Cho s nguyn N v mt dy s nguyn a1, a2, , aN. Nhim v ca bn l phi ct dy s trn thnh mt s
dy s (gi nguyn th t) tha mn:
Tng ca mi dy s khng ln hn s nguyn M.
Tng ca cc s ln nht trong cc dy trn l nh nht.
Input
Dng u gm 2 s nguyn N v M.
Dng th hai gm N s nguyn ca dy a1, a2, , aN.
Output
Gm mt s duy nht l tng ca cc s ln nht trong cc dy s trn. Nu khng c cch ct no tha mn
hai iu kin trn, in ra -1.
Example
Input:
8 17
2 2 2 8 1 8 2 1
Output:
12
Gii thch: Ct thnh 3 dy 2 2 2, 8 1 8, 2 1
Gii hn:
1 N 100000.
0 ai 106.
M < 263.
ua xe - IOICamp
Ngy:
18-12-2008
im:
1.5
M bi:
RACE
S ngi gii c/
lm:
13 / 13
Loi bi:
acm
T l ng:
54.8%
Thi gian chy:
1s
Bi chy tt nht:
- 0.21s)
478

Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
L Huy Bnh
Trong tt c cc cuc ua trn th gii th cuc ua Cng thc 1 (F1) l cuc ua c quan tm n nhiu
nht. N tp hp c tt c nhng tay ua ti gii nht cng nh nhng k thut tin tin nht phc v
cho mt mc ch duy nht l chin thng.
ng ua xe l mt ng vng m im xut pht trng vi im kt thc, cc tay ua s phi hon thnh
mt s vng ua nht nh ty thuc vo tng ng ua. ng ua xe c n khc quanh m ta coi nh
khc quanh th n+1 l khc quanh th 1. Gia 2 khc quanh bt k l mt on ng thng m ta s nh
s on ng thng th i l on ng thng sau khc quanh th i. on ng thng th i c di l
Si.
cho xe ua khi b vng khi ng ua th cc nh k thut tnh ton c rng ti khc quanh th i
th xe ua khng c i qu vn tc mi , ng thi nu ti khc quanh th i xe ua i vi vn tc vi th trn
on ng thng th i (l on ng thng ngay sau ) n cng phi i vi vn tc vi.
m bo an ton trong trng hp xy ra tai nn, xe ua ch c php np mt lng xng nht nh v
ch c np thm khi v ch, do vy lng xng hon thnh mt vng ua s ch l mt s F0 c nh.
Bit rng khi i trn on ng thng c di Si vi vn tc vi th xe ua s tiu tn mt lng xng l
Si.vi.
Bn hy tnh vn tc hp l trn mi on ng thng cho xe ua xe ua hon thnh mt vng ua sm
nht.
Input
Dng u tin ghi 2 s nguyn n v F0 l s khc quanh v lng xng dnh cho 1 vng ua. (N<=10 000;
F0<=10^9)
n dng tip theo ghi n s nguyn m1..mn m mi l vn tc ln nht ca xe ua khc quanh th i.
(Mi<=10^9)
n dng cui ghi n s nguyn S1..Sn m Si l di ca on ng thng th i. (Si<=10^9)
Output
Gm n dng, dng th i ghi s thc vi l vn tc hp l ca xe ua trn on ng thng th i. S thc
c ghi vi chnh xc 5 ch s sau du phy.
Example
Input:
2 7
2
4
2
1
479
Output:
2.00000
3.00000
Pairs of Integers
Ngy:
20-12-2008
im:
1.5
M bi:
QBINT
S ngi gii c/
lm:
13 / 15
Loi bi:
acm
T l ng:
36.4%
Thi gian chy:
3s
Bi chy tt nht:
gerrob (100 im - 0.03s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngun bi:
2001-2002 ACM
Northeastern European
Regional Programming
Contest
Ngn ng cho php:
Tt c
Cho s nguyn dng N, bn hy tm tt c cc cp s nguyn dng X, Y sao cho tng ca n ng bng

N. S nguyn X c t nht 2 ch s v khng bt u bng ch s 0. S nguyn Y nhn c t s nguyn X
bng cch xo i 1 ch s v c th bt u bng mt ch s 0.
Input
Dng u tin ghi s lng Test t (1 <= t <= 1000).
t dng tip theo mi dng ghi 1 s nguyn dng N (10 <= N <= 109)
Output
Vi mi Test:
Dng u tin ghi s lng cc cp s khc nhau tm c. Cc dng tip theo ghi mi cp s theo quy cch
sau:
X+Y=N
Cc cp s in ra theo th t tng dn ca X.
Example
Input:
480

2
234567
10000000
Output:
1
213243 + 21324 = 234567
10
9050000 + 950000 = 10000000
9090500 + 909500 = 10000000
9090905 + 909095 = 10000000
9090910 + 909090 = 10000000
9090950 + 909050 = 10000000
9091000 + 909000 = 10000000
9095000 + 905000 = 10000000
9100000 + 900000 = 10000000
9500000 + 500000 = 10000000
10000000 + 0000000 = 10000000
Choosing Gloves
Ngy:
21-12-2008
im:
1.9
M bi:
GLOVE
S ngi gii c/
lm:
3/7
Loi bi:
acm
T l ng:
16.7%
Thi gian chy:
1s-2s
Bi chy tt nht:
- 1.16s)
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
BOI
Trong tng hm ti tm ti cn nh ca gio s ha hc Acidrain, c 2 ngn ko ng ton gng tay mt

cha gng tay tri v ci cn li cha gng tay phi. Trong mi ngn ko u c nhng chic gng tay vi n
mu khc nhau. Gio s bit c bao nhiu chic gng tay ca mi mu trong mi ngn ko (s lng gng
tay cng mu c th khc nhau trong c 2 ngn). ng cng bit chc chn rng c th tm c mt cp
gng tay cng mu.
Th nghim ca gio s ch c th thnh cng nu nh ng s dng ng i gng tay cng mu (khng
quan trng l mu g), cho nn trc mi cuc th nghim, gio s i xung tng hm v chn gng tay t 2
ngn ko, hi vng rng s c t nht mt cp gng cng mu. Tng hm qu ti n ni khng th nhn ra
c mu ca bt k chic gng tay no m khng phi i ra khi . Gio s rt ght vic phi i vo tng
hm hn mt ln (trong trng hp khng c cp gng no cng mu), cng nh vic mang theo mt lng
qu ln nhng chic gng khng cn thit n phng th nghim.
481
Task
Vit chng trnh:
c vo s lng mu v s lng gng tay ca mi mu trong mi ngn ko t standard input,
Tnh s gng tay nh nht cn phi ly chc chn rng trong s chng c th tm c t nht mt
cp gng tay cng mu (cn phi ch r s lng gng phi ly mi ngn ko)
Vit kt qu ra standard output
Input
Dng u tin ca standard input cha mt s nguyn dng n ( 1 n 20), m t s lng mu khc nhau.
Cc mu c nh s t 1 n n. Dng th 2 cha n s nguyn khng m 0 a1, a2, , an 10^8, vi ai
l s lng gng tay mu i trong ngn ko cha gng tay tri. Cui cng, dng th 3 ca input cha n s
nguyn khng m 0 b1, b2, , bn 10^8, vi bi l s lng gng tay mu i trong ngn ko cha gng tay
phi.
Output
Dng u tin ca standard output cha mt s nguyn s lng gng tay phi ly t ngn ko cha gng
tay tri. Dng th 2 ca output cha mt s nguyn s lng gng tay phi ly t ngn ko cha gng tay
phi. Tng ca 2 s ny l nh nht c th. Nu c vi kt qu ng, bn ch cn in ra mt trong s .
Example
Input:
4
0 7 1 6
1 5 0 6
Output:
2
8
S nh phn c ngha
Ngy:
21-12-2008
im:
1.2
M bi:
BINARY
S ngi gii c/
lm:
26 / 39
Loi bi:
acm
T l ng:
12.1%
Thi gian chy:
2s
Bi chy tt nht:
huhuhu (100 im -
482

0.04s)
Gii hn m ngun:
50000B
Ngi gi:
Ngn ng cho php:
Tt c
Ngun bi:
cun
Cho s nguyn khng m N (N < 231). Hy xc nh xem trong phm vi t 0 ti N c bao nhiu s m trong
dng biu din nh phn ca n c ng K ch s 0 c ngha.
V d: N = 18, K = 3 c 3 s:
1. 8 = 1000
2. 17 = 10001
3. 18 = 10010
Input
Gm mt s dng, mi cha hai s nguyn N v K cch nhau mt du cch.
Output
ng vi mi b N, K Input a ra s lng tm c.
Example
Input:
18 3
8 1
Output:
3
4
S hiu t hp
Ngy:
21-12-2008
im:
1.2
M bi:
SHTH
S ngi gii c/
lm:
24 / 26
Loi bi:
acm
T l ng:
32.2%
Thi gian chy:
1s
Bi chy tt nht:
mr_hh (100 im - 0.06s)
Gii hn m ngun:
50000B
Ngi gi:
cun
483

Ngn ng cho php:
Tt c
Ngun bi:
c add ln bi V
Khnh Trung
Cho tp hp A gm N phn t. Mi tp con gm K (1 <= K <= N) phn t ca A c gi l mt t hp

chp K ca N phn t cho
Bi ton t ra l:
- Cho s hiu ca mt t hp chp K ca N s nguyn dng u tin, hy tm t hp chp .
- Cho t hp chp K ca N s nguyn dng u tin, hy tnh s hiu ca t hp chp .
Input
Gm 2 dng c dng nh sau:
Dng 1: Ghi 2 s nguyn N, K ( 3 <= N <= 300 )
Dng 2: Ghi s nguyn S
Dng 3: Gm K s nguyn B1, B2, ... BK ( B1 < B2 < ... < BK )
Output
Dng 1: Ghi ra dy s A1, A2, ... AK l t hp chp K ca N s nguyn dng u tin c s hiu S. Cc s
vit theo th t tng dn.
Dng 2: Ghi s hiu ca t hp chp K: B1, B2, ... BK.
Example
Input:
3 2
2
2 3
Output:
1 3
3
S hiu chnh hp
Ngy:
23-12-2008
im:
1.4
M bi:
SHCH
S ngi gii c/
17 / 21
484

lm:
Loi bi:
acm
T l ng:
30.1%
Thi gian chy:
1s
Bi chy tt nht:
iamme (100 im - 0.01s)
Gii hn m ngun:
50000B
Ngi gi:
cun
Ngn ng cho php:
Tt c
Ngun bi:
V Khnh Trung
Cho tp hp E gm n phn t. Mt chnh hp chp k ca n phn t l mt b sp th t k phn t ca A,

cc phn t i mt khc nhau.
Bi ton t ra l:
- Cho s hiu ca mt chnh hp chp k ca n s nguyn dng u tin, hy tm chnh hp chp .
- Cho chnh hp chp k ca n s nguyn dng u tin, hy tnh s hiu ca chnh hp chp .
Input
Gm 2 dng c dng nh sau:
Dng 1: Ghi 2 s nguyn N, K ( 3 <= N <= 100 )
Dng 2: Ghi s nguyn S
Dng 3: Gm K s nguyn B1, B2, ... BK.
Output
Dng 1: Ghi ra dy s A1, A2, ... AK l chnh hp chp k ca n s nguyn dng u tin c s hiu S.
Dng 2: Ghi s hiu ca chnh hp chp k: B1, B2, ... BK.
Example
Input:
3 2
4
3 1
Output:
2 3
5
Gii thch:
S hiu
Chnh hp
1 2
485

2
1 3
2 1
2 3
3 1
3 2
Prime Again
Ngy:
25-12-2008
im:
1.7
M bi:
PAGAIN
S ngi gii c/
lm:
8 / 30
Loi bi:
acm
T l ng:
10.1%
Thi gian chy:
5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
Tm s nguyn t gn nht nh hn N.(3 <= N <= 2^32)
D liu
Dng u tin cha s nguyn T l s lng test. (T <= 10000)
T dng tip theo, mi dng cha mt s nguyn N.
Kt qu
Vi mi test, in kt qu trn mt dng.
V d
D liu:
3
5
10
17
Kt qu:
3
7
13
486
King ba chn ( hard version )

Ngy:
26-12-2008
im:
2.0
M bi:
TRIPOD2
S ngi gii c/
lm:
1/5
Loi bi:
acm
T l ng:
7.7%
Thi gian chy:
1.5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
beo_map
Ngn ng cho php:
Tt c
Ngun bi:
bi tng t bi TRIPOD nhng c gii hn ln hn.

Trong mt chuyn i d ngoi, BB mun cng cc bn bc bp nu cm trn khu t cm tri. Trn mt t
c n hn , khng c 2 hn no c cng v tr. Mi ngi s chn ra 3 trong s cc hn ny bc
ni ln. 3 hn phi c chn sao cho bn knh hnh trn cha chng l nh nht v nu c mt ci ni
nh bc c ln 3 hn ny th ci ni c bn knh ln hn cng c th bc c ln 3 hn ny. Bn
hy gip BB tm ra 3 hn cn chn.
Input
Dng u tin ghi s n l s hn .
Trong n dng sau, dng th u ghi mt cp s nguyn xu, yu l ta ca hn th u.
Output
Ghi ra bn knh hnh trn cha 3 hn tm c ( Chnh xc n 5 ch s sau du phy ).
Example
Input:
3
0 0
4 0
0 4
Output:
2.82842
Gii hn:
3 N 100000.
|xu|, |yu| 2100000000
487
Minimum Rotations
Ngy:
29-12-2008
im:
1.6
M bi:
MINMOVE
S ngi gii c/
lm:
9 / 25
Loi bi:
acm
T l ng:
8.3%
Thi gian chy:
0.5s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngun bi:
Based on a problem from

ACM Central European
Programming Contest
Ngn ng cho php:
Tt c
Cho mt xu S[1..n]. Ta nh ngha mt php xoay trn S l vic chuyn k t u tin ca S v cui xu. C
th l, sau mt php xoay th S tr thnh T = S[2..n] + S[1].
V d: S = abcaa, th sau mt php xoay ta c S = bcaaa.
Tm s php xoay t nht bin S thnh xu c th t t in nh nht.
Input
Mt dng duy nht cha xu S. S ch cha cc ch ci in thng trong bng ch ci ting Anh (a .. z), v
di ca S khng qu 100000.
Output
Mt dng duy nht cha mt s nguyn biu th s php xoay t nht.
Example
Input:
mississippi
Output:
10
B test v gii hn thi gian c cp nht. Mt s bi b "chy qu lu" :)
488
H nhn to
Ngy:
30-12-2008
im:
1.7
M bi:
ALAKE
S ngi gii c/
lm:
6/9
Loi bi:
acm
T l ng:
21.9%
Thi gian chy:
1s
Bi chy tt nht:
princeathar (100 im 1.6s)
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
USACO
Nhng ngy h nng nc v ngt ngt n v nhng ch b ang bt u ku ca. Bc John quyt nh
xy mt h nc nhn to. H nc c th c m t nh 1 vng t 2 chiu gm N on (N<=100 000)
nh s t 1 n N t tri sang phi. on th i c m t bi 2 s nguyn W_i (1<=W_i<=1000) v H_i
(1<=H_i<=1 000 000 000 ln lt l rng v chiu cao ca on th i. Khng c 2 on no c cao
bng nhau. 2 bc tng cao v tn chn 2 u tri v phi. Sau y l 1 v d v hnh dng h nc.
on
***
***
***
**********
4 <- cao
**********
***************
***************
1 |2|
Lc mt tri mc, bc John bt u nc vo ni c cao thp nht vi tc 1 vung 1x1 trn 1

pht. Nc s ri xung n khi n chm vo y v chy sang cc vng bn cnh nh thng thng
Nc
Nc trn
* |
* V
....
*~~~~~~~~~~~~*
**
*~~~~** :
*~~~~**~~~~~~*
**
*~~~~** :
*~~~~**~~~~~~*
**
*~~~~**~~~~~~*
*~~~~**~~~~~~*
*********
*~~~~*********
*~~~~*********
*~~~~*********
*~~~~*********
*~~~~*********
**************
**************
**************
**************
**************
**************
489

Sau 4 pht
on 1 b ph
Sau 26 pht
Sau 50 pht
on 3 b ph
on 2 b ph
Input
Dng 1: N
Dng 2..N+1: dng th i+1 gm 2 s W_i v H_i
Output
Gm N dng, dng th i ghi thi im m on th i b mc nc ph ln vi cao 1
Example
Input:
3
1 4
1 7
1 2
Output:
6
11
1
Cc bn c thc mc g v test xin lin h mr_invincible
:)
Triomino Game
490

Ngy:
31-12-2008
im:
1.9
M bi:
TRIOMINO
S ngi gii c/
lm:
3/6
Loi bi:
acm
T l ng:
33.3%
Thi gian chy:
1s
Bi chy tt nht:
gerrob (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
Byte Code
X v Y ang chi tr chi nh sau: H bt u vi mt bng vung trng kch thc 2xN v lun
phin chi. X i trc. Trong mt nc i, mt ngi chi phi t mt qun L-triomino (nh hnh bn
phi) vo bng, theo mt trong 4 hng, v khng c t chn ln cc c triomio. Ngi no khng
th thc hin nc i na th thua.
Cho kch thc ca bng, tnh xem ai s l ngi chin thng nu gi s c X v Y u chi ti u.
Input
Input cha nhiu test. Dng u tin ghi s nguyn T l s lng test. (T<=50)
Mi test cha s nguyn N trn 1 dng, l kch thc ca bng (N<=800)
Output
Vi mi test, in ra trn mt dng k t "X" hoc "Y" th hin ai l ngi chin thng tr chi .
Example
Input:
2
3
4
Output:
X
Y
Chui ht (Hard version)

Ngy:
01-01-2009
im:
1.9
M bi:
NKNL2
S ngi gii c/
lm:
3/9
491

Loi bi:
acm
T l ng:
27.8%
Thi gian chy:
1s-3s
Bi chy tt nht:
tinams (100 im - 1.59s)
Gii hn m ngun:
50000B
Ngi gi:
racer
Ngn ng cho php:
Tt c
Ngun bi:
PTNK Team Selection

2008
bi tng t bi "Chui ht" (NKNL) nhng c gii hn ln hn.

Nh ta bit, mt chui ht c th c xu t rt nhiu ht ngc mu sc khc nhau. tin li, ta dng cc
ch ci in thng m t cc mu sc: chng hn ch a m t mu , ch b m t mu xanh, v.v.. Cc ht
ngc c th c 26 mu khc nhau tng ng vi 26 ch ci in thng. Nh vy, mt chui ht c th c
biu din bi mt xu k t gm cc ch ci in thng, mi k t m t mu ca cc ht ngc theo chiu
kim ng h bt u t mt ht ngc no .
Tuy nhin, do chui ht c dng vng trn, nn c th c nhng chui k t khc nhau cng biu din mt
chui ht, chng hn bacade v cadeba c th cng biu din chui ht. trnh tnh trng ny, ta quy nh
trong cc chui k t cng th hin mt chui ht, ta ch s dng chui k t c th t t in nh nht
biu din chui ht . Nh vy vi chui ht v d nu trn ch biu din bng chui acadeb.
m bo tnh thm m, mi chui ht cn c t nht 5 ht ngc.
Yu cu: Cho mt chui k t S gm cc ch ci in thng. Nhim v ca bn l m xem c bao nhiu
chui con gm cc k t lin tip ca S c th biu din mt chui ht no .
Input
Chui k t S, gm cc ch ci in thng ( di khng qu 1000).
Output
Ghi ra mt s nguyn duy nht l s chui con gm cc k t lin tip ca S c th biu din mt chui ht
no .
Example
Input:
absdcabd
Output:
1
Gii thch
Ch duy nht 1 chui ht l : absdc
492
S phong ph
Ngy:
03-01-2009
im:
0.7
M bi:
NKABD
S ngi gii c/
lm:
68 / 82
Loi bi:
oi
T l ng:
31.3%
Thi gian chy:
1s
Bi chy tt nht:
hieubeo (100 im 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
PTNK 10 Final Exam Semester I, 2008
Trong s hc, s phong ph l cc s m tng cc c s ca s (khng k chnh n) ln hn s . V

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.
Bn hy lp trnh m xem c bao nhiu s phong ph trong on [L,R].
D liu
Gm 2 s L, R (1 <= L <= R <= 105)
Kt qu
Gm 1 s nguyn duy nht l s s phong ph trong on [L, R].
Ch
C 50% s test c 1 <= L <= R <= 103
V d
D liu
1 50
Kt qu
9
Gii thch:
T 1 n 50 c 9 s phong ph l:
12, 18, 20, 24, 30, 36, 40, 42, 48
Hiu chnh vn bn
493

Ngy:
03-01-2009
im:
0.9
M bi:
NKEDIT
S ngi gii c/
lm:
47 / 49
Loi bi:
oi
T l ng:
38.3%
Thi gian chy:
1s
Bi chy tt nht:
minhtrang (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Cho trc mt s nguyn K v hai vn bn di dng hai xu S v P (c di khng qu 50 k t), ch

gm cc ch ci in thng ('a'..'z').
Ngi ta hiu chnh c hai vn bn theo quy tc sau: tm xu con (ngha l mt on gm cc k t lin tip)
chung di nht ca hai xu S v P. Sau nu xu con chung ny c di >=K th xa xu con chung ny
khi S v P.
Trong trng hp c nhiu xu con chung di nht, ngi ta chn xu xa theo quy tc sau:
Chn xu con chung di nht c v tr tri nht thuc xu S
Nu xu ny vn xut hin nhiu ln xu P, chn xu c v tr tri nht thuc xu P
Qu trnh ny c lp li cho n khi S v P khng cn xu con chung no c di >= K.

V d, vi K=2, S=aabhh, P=haahaa
Bc 1: S=aabhh P=haahaa
Bc 2: S=bhh P=hhaa
Kt thc: S=b P=aa
n y S v P khng cn xu con chung no c di >= 2. Ta kt thc qu trnh hiu chnh vn bn.
Bn hy lp trnh thc hin qu trnh hiu chnh vn bn trn v in ra s bc hiu chnh, xu S v P cui
cng.
D liu
Dng 1: K
Dng 2: S
Dng 3: P
Kt qu
494
Dng 1: s bc
Dng 2: S
Dng 3: P
V d
D liu
2
aabhh
haahaa
Kt qu
2
b
aa
Bt chut
Ngy:
03-01-2009
im:
1.5
M bi:
NKCATM
S ngi gii c/
lm:
13 / 31
Loi bi:
oi
T l ng:
14.4%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
Mo ui chut trong mt cn phng c dng hnh ch nht 2xN (1<=N<=30). Mt s c tng chn nn
mo cng nh chut u khng th i qua c.
Mo v chut ln lt di chuyn. Ban u, mo di chuyn trc. Mo bt c chut khi mo di chuyn vo
chut ang ng.
Ti mi lt, mo c th di chuyn qua khng qu 2 (ngha l c th ng yn, di chuyn 1 , hoc di
chuyn 2 ); chut c th di chuyn qua khng qu 1 (ngha l c th ng yn hoc di chuyn 1 ). T
mt , mo v chut c th di chuyn qua 4 k cnh.
Bn hy lp trnh tnh xem sau my lt th mo bt c chut?
D liu
Dng 1: N
495

Dng 2: Gm N k t ., #, A hoc B th hin dng u tin ca cn phng (# ch tng cn . ch trng, A
ch v tr mo ang ng, B ch v tr chut ang ng)
Dng 3: Gm N k t ., #, A hoc B th hin dng th hai ca cn phng
Bit c ng mt k t A v ng mt k t B.
Kt qu
Nu mo khng th bt c chut, in ra -1. Nu mo bt c chut, in ra s lt mo s bt chut, bit
rng mo th lun tm cch bt chut nhanh nht c th, cn chut th lun tm cch trnh mo cng lu
cng tt.
V d
D liu
4
A...
.#.B
Kt qu
2
Gii thch
Trong lt 1: mo di chuyn 2 v bn phi,
d chut ng yn hay di chuyn 1 ,
mo s lun bt c chut sau lt 2.
Dy chia ht
Ngy:
04-01-2009
im:
0.7
M bi:
NKDIVSEQ
S ngi gii c/
lm:
80 / 82
Loi bi:
oi
T l ng:
66.2%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:
Sec. 9 Team Selection

Test, District I HCMC,
2008
Ngn ng cho php:
Tt c
Thy Hong xy dng mt dy s v hn A t dy cc s nguyn dng bng cch ln lt xt cc s t

nhin bt u t 1 v ln lt chn cc s cho dy A theo quy tc : chn mt s chia ht cho 1 (hin nhin l
496

s 1), sau l hai s chia ht cho 2, tip theo l 3 s chia ht cho 3, 4 s chia ht cho 5, 5 s chia ht cho
5. Nh vy cc s u tin ca dy A l: 1, 2, 4, 6, 9, 12, 16, 20, 24, 28, 30, 35, 40, 45, 50, 54, ..
Thy Hong tm ra quy lut xc nh mt cch nhanh chng cc phn t ca dy. Bn l ngi lp trnh gii,
hy gip cc bn i tuyn Ton vit chng trnh kim tra quy lut m Thy Hong tm ra c ng hay
khng.
Yu cu: Cho s t nhin N. Hy xc nh s th N ca dy s.
D liu
Cha duy nht s N (1 N 100000).
Kt qu
Ghi ra s th N tm c.
V d
D liu
10
Kt qu
28
D liu
13
Kt qu
40
Gi th
Ngy:
04-01-2009
im:
0.7
M bi:
NKLETTER
S ngi gii c/
lm:
76 / 87
Loi bi:
oi
T l ng:
42.4%
Thi gian chy:
1s
Bi chy tt nht:
kauke (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

2008
Ngn ng cho php:
Tt c
V Gim c cng ty XYZ cn gi mt vn ban quan tro ng ti m t i tac cua min h. Vn ban la m t xu S
cc ch ci la tinh in thng. bao mt n i dung vn ban, ng Giam c gi 2 bc th. Bc th th nh t
497

l phn u Sb ca xu S, bc th th 2 l phn cui Se ca S. Hai bc th Sb va Se am bao y u n i
dung cua S, tuy nhin co th m t ph n cu i cua Sb c th c vi t l p la i trong ph n u cua Se, song s k
t c vi t l p la i khng bi t trc.
V d: vi vn bn S=truongnguyenduquannhat to ra hai bc th:
Sb=truongngueNdu
ngueNduquanNhat=Se=
Sb=truongnguyendu v Se=nguyenduquannhat
Yu c u: Cho hai xu Sb va Se, hy xc nh mt xu S c th l ni dung ca bc th sao cho di ca
xu S la ngn nh t.
D liu
Dng u cha xu Sb, dng th hai cha xu Se. Mi xu co dai khng qua 250.
K t qua
Ghi ra dai cua xu S tim c.
V d
D liu
truongnguyendu
nguyenduquannhat
Kt qu
22
S thn thin
Ngy:
04-01-2009
im:
0.7
M bi:
NKNUMFRE
S ngi gii c/
lm:
83 / 91
Loi bi:
oi
T l ng:
46.8%
Thi gian chy:
1s
Bi chy tt nht:
hung0710 (100 im 0.07s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:

2008
Ngn ng cho php:
Tt c
498

S t nhin c rt nhiu tnh cht th v. V d vi s 23, s o 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.
Hy nhp vo 2 s nguyn a,b (10ab30000). Hy m xem trong khong t a n b (k c a v b) c bao
nhiu s thn thin.
D liu
Bao gm mt dng cha 2 s a,b. Hai s c cch nhau bng mt khong trng
Kt qu
Bao gm mt dng l kt qu ca bi ton.
V d
D liu
20 30
Kt qu
3
Word Counting
Ngy:
04-01-2009
im:
0.8
M bi:
WORDCNT
S ngi gii c/
lm:
59 / 70
Loi bi:
acm
T l ng:
29.0%
Thi gian chy:
1s
Bi chy tt nht:
ng_hung2812 (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:
ACM Regional, Ho Chi

Minh City 2008
Nguyn ang vit mt phn mm m t trong mt xu k t. Cu cm 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 k t t a n z v k t trng. Mi t l mt chui cc k t lin tip khc k t
trng v cc t phn tch nhau bi t nht mt k t trng. Nhim v ca bn l vit chng trnh gip
Nguyn tm s P ni trn.
D liu vo
499

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 k t c khng qu 1000 t tng ng vi mi b d liu, mi t c
khng qu 20 k t.
D liu ra
Vi mi b d liu, ghi ra trn mt dng s P m Nguyn mun tm.
V d
D liu vo
2
a aa bb cc def ghi
a a a a a bb bb bb bb c c
D liu ra
3
5
Lucky Numbers
Ngy:
04-01-2009
im:
1.0
M bi:
LUCKYNUM
S ngi gii c/
lm:
41 / 42
Loi bi:
acm
T l ng:
47.1%
Thi gian chy:
1s
Bi chy tt nht:
ronaldinho (100 im 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
Trong mt s nc chu , 8 v 6 c coi l nhng ch s may mn. Bt c s nguyn no ch cha ch

s 8 v 6 c coi l s may mn, v d 6, 8, 66, 668, 88, 886 . Nguyn l mt hc sinh rt thch ton.
Nguyn thch cc s may mn nhng ch thch cc s c dng
S = 8866
trong S c t nht mt ch s v ch s 6 v 8 khng nht thit phi ng thi xut hin. V d, 8, 88, 6,
66, 86, 886, 8866 l cc s c dng S.
500

Cho trc mt s nguyn dng X (1 < X < 10 000), Nguyn mun tm s may mn nh nht dng S, c
khng qu 200 ch s v chia ht cho X.
Nhim v ca bn l vit mt chng trnh tm s cho Nguyn.
D liu vo
Trn mi dng tip theo cha mt s nguyn X tng ng vi mi b d liu.
D liu ra
Vi mi b d liu, ghi ra trn mt dng s may mn dng S nh nht chia ht cho X. Trng hp khng
tn ti s S c khng qu 200 ch s nh vy, ghi -1.
V d
D liu vo
4
6
8
43
5
D liu ra
6
8
86
-1
Hanoi Subway System Construction

Ngy:
05-01-2009
im:
1.9
M bi:
HNSUBWAY
S ngi gii c/
lm:
2/4
Loi bi:
acm
T l ng:
39.9%
Thi gian chy:
1s
Bi chy tt nht:
just4one (100 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
501

H Ni ang xy dng h thng tu in ngm. H thng tu in ngm bao gm M ga c nh s t 1
n M v K tuyn tu in ngm kt ni trc tip gia cc cp ga. Khu vc ni H Ni c T ta nh
chung c ri nhau c m t trn bn l cc a gic li c nh s t 1 n T. Cc tuyn tu in
ngm c th i ngm di cc ta nh chung c. Tc ca tu in ngm khi chy ngm di cc ta nh
chung c k c ngm di bin l v1 v v2 khi chy trn cc on khc (v1 < v2). Thi gian i gia hai ga a
v b l thi gian nh nht i t a n b (c th i qua cc ga trung gian v thi gian chuyn tuyn l
khng ng k). Ngi ta phi chn ga trung tm t nhng ga c sao cho thi gian i t ga trung tm n
ga xa n nht (tnh theo thi gian i) l nh nht.
Hnh di y m t mt h thng tu in ngm vi bn ga v bn tuyn tu in ngm. Trong khu vc ni
c ba ta nh chung c v trn hai on ng tu in ngm phi chy vi tc v1.
Cho trc mt h thng tu in ngm, nhim v ca bn l vit mt chng trnh tm ra ga trung tm

tha mn yu cu ni trn v a ra thi gian i t ga trung tm tm c n ga xa n nht.
D liu vo
Vi mi b d liu, dng u tin cha nm s nguyn M, K, T, v1, v2 (M < 31, K < 50, T < 10, 0 < v1 <
v2 < 100) cch nhau bi du cch, tng ng l s lng ga, s lng tuyn tu in ngm, s lng ta nh
chung c, tc ca tu in ngm khi i ngm di ta nh chung c, v tc ca tu in ngm khi
khng i ngm di ta nh chung c. Dng th i trong M dng tip theo cha hai s nguyn Xi v Yi (10000 Xi,Yi 10000) cch nhau bi du cch l ta ca ga th i. Dng th j trong K dng tip theo
cha hai s nguyn cch nhau bi du cch l s hiu ca hai ga hai u ca tuyn tu in ngm th j.
Dng th g trong T dng tip theo cha m t ca ta nh chung c th g. Dng ny cha s nguyn Vg
(Vg < 8) l s lng nh ca a gic m t ta nh chung c th g v tip theo l Vg cp s nguyn (c tr
tuyt i khng ln hn 10000) cch nhau bi du cch l ta nh ca a gic theo mt th t i
vng quanh a gic.
D liu ra
Vi mi b d liu, ghi ra trn mt dng mt s nguyn l phn nguyn ca (tmax * 100) vi tmax l thi
gian i t ga trung tm tm c n ga xa n nht.
V d
D liu vo
1
4 4 3 1 2
1 8
7 8
7 1
14 8
1 2
2 3
502

2 4
3 4
3 4 8 6 5 2 5
4 7 6 9 6 9 4 7 4
6 10 8 11 9 12 9 13 8 12 7 11 7
D liu ra
500
Earthquakes
Ngy:
05-01-2009
im:
1.7
M bi:
EARTHQK
S ngi gii c/
lm:
7/9
Loi bi:
acm
T l ng:
32.2%
Thi gian chy:
1s
Bi chy tt nht:
hung0710 (100 im 0.05s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:

PAS fpc JAVA NICE JAR
C# NEM ST ASM D
Ngun bi:
FORT ADA BASH PERL
PYTH

Minh City 2008
Nm 3010, mt nhm ngi t Tri t chuyn n sng hnh tinh Alpha. V kh hu ca hnh tinh ny
rt khc nghit, ch mt phn t nht nh c th trng trt c.
Gi s b mt ca hnh tinh ny l mt mt phng, mnh t c th trng trt c hnh dng l mt a gic
khng t ct c N nh c ta tng ng l (X1, Y1), (X2, Y2), ..., (Xn , Yn), c lit k theo chiu kim
ng h. Trn mnh t c th trng trt, nhm ngi n t Tri t sng mt trm nghin cu t ti v
tr (Xp, Yp).
Trn hnh tinh Alpha thng c ng t xy ra. Mi trn ng t to ra mt vt nt m con ngi khng
th i qua c. Vt nt ny c th chy ngang qua mnh t c th trng trt v chia mnh t ny ra thnh
cc phn ri nhau. Tht may mn, vt nt ny khng bao gi ct qua trm nghin cu. V d trong hnh trn
cho thy hai vt nt ct mnh t c th trng trt lm ba phn, v phn t c th trng trt m nhm ngi
sng trong trm nghin cu tip cn c sau hai trn ng t c din tch l 22.
Gi s c M trn ng t xy ra c nh s t 1 n M. Mi trn ng t to ra mt vt nt c m t
bi mt ng thng i qua hai im (Xj1, Yj1) v (Xj2, Yj2) (j=1..M).
503

Nhim v ca bn l vit mt chng trnh tnh phn din tch c th trng trt m nhm ngi sng
trong trm nghin cu ti v tr (Xp, Yp) c tip cn c sau M trn ng t.
D liu vo
Vi mi b d liu, dng u tin cha s nguyn N (3 N 1000). Dng th i trong N dng tip theo cha
hai s nguyn Xi v Yi (-10000 Xi,Yi 10000) cch nhau bi du cch, l ta ca nh th i ca a
gic th hin mnh t c th trng trt. Dng tip theo cha hai s nguyn (Xp,Yp) (-10000 Xp,Yp
10000) cch nhau bi du cch, l ta ca trm nghin cu. Dng tip theo cha s nguyn M (1 M
1000). Dng th j trong M dng tip theo cha bn s nguyn Xj1, Yj1, Xj2, v Yj2 cch nhau bi du
cch, m t ng thng biu din vt nt to ra bi trn ng t th j.
D liu ra
Vi mi b d liu, ghi ra trn mt dng mt s nguyn l phn nguyn ca (s * 100) vi s l din tch ca
phn c th trng trt v tip cn c sau M trn ng t.
V d
D liu vo
2
3
0 0
2 0
0 2
0 0
1
1 1 1 0
6
1 1
9 1
9 5
5 5
5 8
1 8
5 3
2
1 1 5 8
7 1 7 2
D liu ra
150
2200
504
Pretty Printing
Ngy:
05-01-2009
im:
1.9
M bi:
PRETTYP
S ngi gii c/
lm:
2/4
Loi bi:
acm
T l ng:
39.9%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
Mt cng ty Tin hc quyt nh xut bn mt bn tin ni b m t nhng d n kt thc thnh cng. Mi

phng ban np mt on vn bn s c in trong mt c thit k sn trong bn tin. Cho mt on vn
bn ch cha cc k t t a n z v k t trng. Mi t l mt chui cc k t lin tip khc k t trng v
cc t trong on vn bn phn tch nhau bi t nht mt k t trng hoc du xung dng.
Vic in n phi tun theo nhng nguyn tc sau:
Vn bn s c in bng font c chiu ngang c nh (c ngha l mi k t chim mt chiu ngang

c nh) t tri sang phi v xung dng khi ht dng.
S lng k t trn mi dng phi ging nhau.
Cc t c in trong phi ng theo th t trong vn bn ban u. Mt t khng c tch ra hay

in trn qu mt dng.
Cc t lin tip nhau trn cng mt dng phi cch nhau bi ng mt k t trng.
Cc dng ch cha cc t trong on vn bn gc v cc k t trng.
Dng no bt u bng k t trng th ch bao gm ton k t trng.
Ngi bin tp bn tin mun nh gi mc p ca mt bn in on vn bn thng qua vic nh ngha

mt cn i ca n l tng ca cc ly tha m ba ca s lng cc k t trng cui cc dng k c
dng gm ton k t trng. mt cn i cng nh, bn in on vn bn cng p.
Xt v d sau v mt on vn bn c in trong mt c ba dng, mi dng c chiu ngang l 20 k t:
aaa bbbbbbbbb c dddd
aaa bbbbbbbbb
eeeeeee ffffff
c dddd eeeeeee
ggggggggg
ffffff ggggggggg
Trong v d ny, mt cn i ca bn in on vn bn bn tri l 03 + 63 + 113 = 1547 trong khi

mt cn i ca bn in on vn bn bn phi l 73 + 63 + 43 = 623.
505

Cho trc mt on vn bn v mt in, nhim v ca bn l vit chng trnh tm ra bn in p nht
(c mt cn i nh nht).
D liu vo
Vi mi b d liu, dng u tin cha s nguyn L (0 < L 100) l s lng dng ca in. Dng th
hai cha mt s nguyn W (0< W 1000) l s lng k t trn mt dng ca in. Cc dng tip theo
cha ni dung on vn bn c khng qu 1000 t, kt thc bi mt dng trng.
D liu ra
Vi mi b d liu, ghi ra trn mt dng mt cn i ca bn in on vn bn p nht. Trong trng
hp khng tn ti cch no in on vn bn trong cho, ghi -1.
V d
D liu vo
3
3
20
aaa bbbbbbbbb
c dddd
eeeeeee ffffff
ggggggggg
2
5
abcde abcde
2
5
abcde abcde
a
D liu ra
623
0
-1
Traffic Network
506

Ngy:
05-01-2009
im:
2.0
M bi:
TRAFFICN
S ngi gii c/
lm:
0/9
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
canhteo (0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
Mng li giao thng thnh ph gm n nt c nh s t 1 n n v m ng mt chiu ni cc cp nt.

gim c di ca ng i ngn nht gia hai nt trng yu s v t khc nhau, mt danh sch gm k
ng hai chiu c xut xem xt xy dng.
Nhim v ca bn l vit mt chng trnh chn ra mt ng trong danh sch xut trn xy dng
sao cho di ng i ngn nht gia s v t l nh nht.
D liu vo
Vi mi b d liu, dng u tin cha nm s nguyn dng n (n 10 000), m (m 100 000), k (k < 300),
s (1 s n), t (1 t n) cch nhau bi du trng. Dng th i trong m dng tip theo cha ba s nguyn
dng di, ci, li cch nhau bi du trng, trong li l di ( 0< li 1000) ca ng mt chiu th i t nt
di n nt ci. Dng th j trong k dng tip theo cha ba s nguyn dng uj, vj v qj (qj 1000) cch nhau
bi du trng, trong qj l di ca ng hai chiu c xut th j ni gia hai nt uj v vj.
D liu ra
Vi mi b d liu, ghi ra trn mt dng di nh nht c th ca ng i ngn nht gia hai nt trng
yu sau khi xy dng xong mt ng hai chiu t danh sch xut. Trng hp khng c ng i t s
n t, ghi -1.
D liu vo
1
4 5 3 1 4
1 2 13
2 3 19
3 1 25
3 4 17
4 1 18
1 3 23
2 3 5
2 4 25
507

D liu ra
35
Winning Strategy
Ngy:
05-01-2009
im:
2.0
M bi:
WINSTRAT
S ngi gii c/
lm:
0/0
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
(0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
Mt bng c n hng nh s t 0 n n-1 v n ct nh s t 0 n n-1. Ta ca mt thuc hng i v

ct j l (i,j). Mi nhn gi tr 0 hoc 1. Trong bng ny, c m c gi tr 0. Cc cn li c gi tr 1. Hai
ngi chi mt tr chi bng cch lun phin thc hin cc bc i. Ngi chi th nht thc hin bc i
u tin. Mi ngi chi ch c thc hin mt bc i mi lt. Ngi chi n lt mnh m khng th
thc hin bc i no na l ngi thua v ngi chi cn li l ngi chin thng. Mt bc i hp l l
mt hnh ng i gi tr (0 thnh 1 hoc 1 thnh 0) ca bn ti bn gc ca mt hnh ch nht nm bn
trong bng tha mn cc iu kin sau:
hnh ch nht phi c nhiu hn 1 hng v nhiu hn 1 ct,
vi ta hng ln nht v ta ct ln nht trong bn phi c gi tr l 0.
Cho trc gi tr cc trong mt bng, nhim v ca bn l vit mt chng trnh gip ngi chi th nht
xc nh xem c tn ti chin thut chi m bo anh ta lun thng bt k ngi chi th hai chi th
no.
D liu vo
Vi mi b d liu, dng u tin cha s nguyn n (0 < n < 1000) l kch thc ca bng. Dng tip theo
cha s nguyn m (0 < m < n) l ta ca mt c gi tr 0.
D liu ra
Vi mi b d liu, ghi ra trn mt dng s 1 nu tn ti chin thut thng cho ngi chi th nht, hoc s
0 trong trng hp ngc li.
V d
508

D liu vo
4
100
1
0 0
100
3
0 1
0 20
0 30
100
2
2 3
3 2
10
2
1 2
2 3
D liu ra
0
0
0
1
Farthest Headquarters
Ngy:
05-01-2009
im:
1.9
M bi:
HEADQRT
S ngi gii c/
lm:
3/8
Loi bi:
acm
T l ng:
10.5%
Thi gian chy:
1s
Bi chy tt nht:
just4one (100 im - 0.6s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
Microhoo v Googloo l hai cng ty Tin hc cnh tranh nhau cng mt thnh ph. Mi cng ty c mt s
vn phng nm mt s im trong thnh ph. bo v thng tin quan trng khi lt n i th, c hai
cng ty cam kt s t tr s chnh cng xa nhau cng tt.
509

Cho trc v tr ca cc vn phng ca Microhoo v Googloo, nhim v ca bn l vit mt chng trnh
gip hai cng ty chn t cc vn phng c t tr s chnh sao cho khong cch gia hai tr s chnh
ca hai cng ty l ln nht.
D liu vo
Vi mi b d liu, dng u tin cha s nguyn n (2 n 30000) l tng s lng vn phng ca c hai
cng ty. Dng th i trong n dng tip theo cha ba s nguyn xi, yi, ci (0 |xi|, |yi| 108, 0 ci 1) cch
nhau bi du trng, vi (xi, yi) l ta ca vn phng th ith v n l vn phng ca Microhoo nu ci = 0
v Googloo nu ci = 1.
Cho bit mi cng ty c t nht mt vn phng.
D liu ra
Vi mi b d liu, ghi ra trn mt dng phn nguyn ca khong cch ln nht gia tr s chnh ca
Microhoo v Googloo.
V d
D liu vo
2
2
0 0 0
3 -2 1
5
1 5 1
-5 2 0
3 7 1
6 -2 0
5 1 0
D liu ra
3
9
Adventure Tourism
Ngy:
05-01-2009
im:
2.0
M bi:
ATOURISM
S ngi gii c/
lm:
0/4
510

Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
tokucha (0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
Cc tour du lch mo him ngy cng thu ht c s quan tm ca cc bn tr. Tuy vy, t chc du lch
mo him l c mt vn . N i hi ban t chc phi chu o, t m n tn tng chi tit nh nht trong
khu chun b.
Tour du lch k ny c p du khch nam v q du khch n tham gia. Ngoi lc lng hu cn v ng cu
khn cp, ban t chc cn phn cng thm k hng dn vin i vi on. chng th nht ng i kh
hp v cheo leo, c on phi i thnh hng mt. c th tr gip nhau, quy tc hnh thnh on i l cnh
mt du khch n phi c mt du khch nam hay mt hng dn vin (i trc hoc i sau), cnh mt hng
dn vin phi c t nht mt du khch. C nhiu cch t chc on thnh hng i. K hiu B l du khch
nam, G l du khch n, v M l hng dn vin, mi cch t chc on tng ng vi mt xu p+q+k k t
t tp (B, G, M). Hai cch t chc on gi l khc nhau nu cc xu tng ng khc nhau. V d, vi on
c 2 du khch nam, 2 du khch n v 1 hng dn vin ( p = q = 2, k = 1) s c tt c 24 cch t chc on
nh m t di y:
STT
Hng i
BBGGM 7
BGMBG
13
MGBBG
19
GBGMB
BBGMG 8
BGMGB
14
MGBGB
20
GBMBG
BGBGM 9
BMGBG
15
MGGBB
21
GBMGB
BGBMG 10
BMGGB
16
GBBGM
22
GMBBG
BGGBM 11
MBGBG
17
GBBMG
23
GMBGB
BGGMB 12
MBGGB
18
GBGBM
24
GMGBB
STT
Hng i
STT
Hng i
STT
Hng i
Cho p, q, v k, gi n l s cch khc nhau t chc hng i. Nhim v ca bn l vit mt chng trnh
tnh phn d ca n khi chia cho 107.
D liu vo
Mi b d liu c mt dng duy nht cha ba s nguyn p, q v k (0 p, q 1 000, 0 k 10) cch nhau
bi du trng.
D liu ra
Vi mi b d liu, ghi ra trn mt dng phn d ca s cch t chc thnh hng i khc nhau khi chia cho
107.
V d
511

D liu vo
1
2 2 1
D liu ra
24
Moebius
Ngy:
05-01-2009
im:
2.0
M bi:
MOEBIUS
S ngi gii c/
lm:
0/1
Loi bi:
acm
T l ng:
0.0%
Thi gian chy:
1s
Bi chy tt nht:
hocmai185 (0 im - 0s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngn ng cho php:
Tt c
Ngun bi:

Minh City 2008
Tuy tr chi Moebius khng c ph bin, nhng vn c mt s ngi hm m c th b c ngy ra ngi

chi Moebius. Tr chi ny yu cu ngi chi tm cch xa mt cp cha x v z c ch nh trc nm
trn mt Moebius vi chi ph nh nht.
Moebius c lm t mt ming ba hnh ch nht ABCD kch thc . Mi mt ca ming ba c
chia thnh li cc vung bng nhau kch thc 1x1. Trn c hai li, cc ct c nh s t n N
v cc dng c nh s t n M, bt u t nh A. Ngoi ra, mi , nm ti dng v ct , c
vit ch x, ch z hoc rng. Dn hai mp AB v CD ca t giy vi nhau, nhng xoay mp giy
nh C trng vi nh A v nh D trng vi nh B, chng ta c c mt Moebius ch c 1 mt duy
nht.
Mt php xa cp cha x v z c th thc hin ch khi c mt ng i trc tip t n xuyn qua cc

rng k cnh vi ti a 2 ln i hng. Cc trung gian c th nm bn ngoi Moebius. Mc nh cc
nm ngoi Moebius l rng. Chi ph xa cp cha x v z c tnh bng chiu di ca ng i ngn
nht t n nh cch m t trn. Sau php xa, cha v cha tr thnh rng. Hnh trn cho thy hai
php xa lin tip vi chi ph l 5 v 8.
Nhim v ca bn l vit mt chng trnh thc hin php xa cp cha x v z cho trc s dng ti a
1 php xa trung gian sao cho tng chi ph l nh nht v a ra tng chi ph .
D liu vo
Vi mi b d liu, dng u tin cha 2 s nguyn v ( cch nhau bi du trng. Dng tip theo cha hai
cp ba C u v m t hai cn xa, vi l ch mt trc hoc ch mt sau, v l ta ca trn li ban u.
512

M dng tip theo m t mt trc ca Moebius. Dng th i trong M dng ny cha N k t lin tip nhau,
nhn gi tr x, z hoc . (. cho trng), m t dng th i ca mt trc.
M dng tip theo m t mt sau ca Moebius. Dng th j trong M dng ny cha N k t lin tip nhau,
nhn gi tr x, z hoc du chm . (. k hiu rng), m t dng th j ca mt sau.
D liu ra
Vi mi b d liu, ghi ra trn mt dng tng chi ph nh nht. Ghi trong trng hp cp cho khng
th xa c s ti a 1 php xo trung gian.
V d
D liu vo
1
3 10
F 2 7
B 2 1
.....xxx.z
.....xzx.x
.....xxx.z
.z........
xz........
zz........
D liu ra
13
Palindrome di nht
Ngy:
11-01-2009
im:
1.9
M bi:
PALINY
S ngi gii c/
lm:
3 / 13
Loi bi:
acm
T l ng:
27.8%
Thi gian chy:
1s
Bi chy tt nht:
Gii hn m ngun:
50000B
Ngi gi:
huy391992
Ngn ng cho php:
Tt c
Ngun bi:
Nguyn Honh Tin
Cho xu S. Tm xu i xng di nht gm cc k t lin tip trong S
Input
Dng 1: N (s k t ca xu S; N<=50 000)
513

Dng 2: Xu k t di N
Output
1 dng duy nht gm di ca xu i xng di nht
Example
Input:
5
abacd
Output:
3
ng t
Ngy:
15-01-2009
im:
1.9
M bi:
DAMAGE
S ngi gii c/
lm:
3/3
Loi bi:
oi
T l ng:
79.8%
Thi gian chy:
1s
Bi chy tt nht:
tinams (100 im - 0.75s)
Gii hn m ngun:
50000B
Ngi gi:
paulmcvn
Ngun bi:
USACO January 2009 Gold Division

Translated by
duyhung123abc
Ngn ng cho php:
Tt c
Mt trn ng t va xy ra Wisconsin v tn ph trang tri ca nng dn John. Trn ng t ph

hy mt s cnh ng khin cho n b khng th t chn ln cnh ng . Mt iu khc thng l tt
c con ng ni cc cnh ng u khng b tn ph.
Nh thng l, trang tri c xem l mt tp hp cc P cnh ng (1<=P<=30000) c nh s t 1 n
P v c ni vi nhau bng C ng i hai chiu (1<=C<=100000) nh s t 1 n C. ng i th i ni
hai cnh ng a_i v b_i (1<=a_i b_i<=P). Ch l cc ng i c th ni cnh ng a_i vi chnh n hoc
gia 2 cnh ng c th c nhiu ng i. Chung b c t cnh ng 1.
C N con b (1<=N<=P) cc cnh ng khc nhau gi v cho FJ v thng bo 1 s nguyn report_j
(2<=report_j<=P) c ngha l cnh ng report_j tha 2 iu kin: + Cnh ng report_j khng b tn ph +
Con b ng cnh ng report_j khng th v c cnh ng 1 v trn ng i c mt s cnh ng b
tn ph v khng th i qua cc cnh ng
Cho bit thng tin ca N con b, hy xc nh s lng t nht cc cnh ng sao cho t cc cnh ng
khng th v c cnh ng 1 (bao gm lun nhng cnh ng b ph hy)
514
D liu
Dng u cha 3 s nguyn: P, C v N
C dng sau mi dng cha 2 s a_i v b_i m t ng ni th i ni hai cnh ng a_i v b_i
N dng sau mi dng cha mt s nguyn l thng tin ca cc con b
Kt qu
Gm 1 dng duy nht l s lng t nht cc cnh ng khng v c cnh ng 1.
V d
D liu
4 3 1
1 2
2 3
3 4
3
Kt qu
3
Gii thch
Cnh ng 2 b ph hy, vy cc con b cnh ng 2,3,4 s khng th v chung
515

Booklet PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Booklet PDF

Uploaded by

Copyright:

Available Formats

Tuyn tp bi

Bn quyn VNOI 2008-2009

Tuyn tp bi VOJ 17-01-2009

Another Assignment Problem

Trao i thng tin

Lung vi chi ph nh nht

Phn cng hoan thanh sm nh t

Khi lp phng ln nht

on con c tng ln nht

Huyn thoi Lc Vn Tin

Tuyn tp bi VOJ 17-01-2009

Chin trng qua

Vua Midas thch vng

Cu chuyn ngi lnh

Floyd hoc Dijkstra ( C bn )

Mt cht v Huffman Tree

Din tch hnh ch nht

Th trng , tr gii tr tui teen

Cp ghp khng trng s

B ghp y trng s cc tiu

Dch chuyn tc thi

Chu vi cc hnh ch nht

Din tch cc tam gic vung cn

Khong cch mong manh

Tuyn tp bi VOJ 17-01-2009

Lch thi u bng

on cao tro ca bn nhc

Phng trnh Pythagore nghim nguyn

Dy con tng di nht ( bn d )

Dy con tng di nht (bn kh)

Cng vin Disneyland (version 1)

Cng vin Disneyland (version 2)

Tam gic en trng

Tuyn tp bi VOJ 17-01-2009

Tam gic vung

on cao tro ca bn nhc

Kim tra chng trnh

Mng truyn tin

Tuyn tp bi VOJ 17-01-2009

Tng cc c chung ln nht

Cng vin Disneyland

Lp lch trn hai my

Tuyn tp bi VOJ 17-01-2009

Mng my tnh an ton

Tr chi di chuyn con tt

Help Conan ! (version 3)

Conan Needs Help Again (Help Conan 4 )!

Brainfck Nhp xut

Lung cc i trn mng

Cp ghp cc i trn th hai pha

Lp lch gim thiu tr hn

Thm kch nng trang

Tuyn tp bi VOJ 17-01-2009

Nhng con ng quanh nng trang

Nguy him r rng trc mt

Dy con di nht c tng chia ht cho K

Cy khung nh nht ( HEAP )

Tuyn tp bi VOJ 17-01-2009

The secret key

Counting paths in a complete graph

The Nth digit

Exploring the maze

Help Conan 8 !! Hurry up !!