Mt vi gi PTIT Summer Round 4

Bi A: Nam chm
Kt qu bng s ln c 2 nam chm lin tip y nhau cng thm 1.
Bi B: Cp s cng
Vi mi s lu li tp hp cc v tr xut hin ca n ri kim tra dy s ny c l cp s cng
hay khng?
Bi C: S tuyt p
1 s tuyt p ta ch cn quan tm xem tng ca cc s c l s p khng, vy ta ch cn bit c
bao nhiu s a v bao nhiu s b xem c th to ra s tuyt p khng, ri tnh cc hon v c
th c sinh ra.
Vi i ch s a, v (n-i) ch s b, s cc s tuyt p c to ra bng
!
!( )!
n
n
i i n i
| |
|
\

.
= .
tnh c gi tr biu thc ny, c 2 cch nh sau:
Cch 1: Phn tch thnh tha s nguyn t v lu s m vo mng vi n!, i! v (n-i)!. Sau khi
gin c i th cng vic cn li ch l nhn cc tha s nguyn t vi nhau.
Cch 2: Dng mod nghch o (mod inverse). S
1
a

c gi l mod inverse ca a modulo

BASE nu nh ( )
1
. 1 mod a a BASE

. Vi iu kin ( ) gcd a, n 1 = , mod inverse ca a c

tnh bng ( )
( )
1 mod
n
a n

trong ( ) n l phi hm Euler ca n. Trong trng hp ny, n =

BASE 1000000007 = l mt s nguyn t nn A ( S ) 2 n B E = .
Bi D: Chui c bit
C nhiu cch gii quyt, mt trong s l:
chui c bit s c nhiu nht l 2 gi tr v cc gi tr ny xen k nhau.
Hng gii quyt gi F[i][j] l chui c sinh ra bi s i v j. j l s cui ca dy. Ri rc ha
thc hin cho mng.
Kt qu: max(F[i][j]) vi mi i, j.
Bi E: Truy vn
Cc gi tr x tha mn c s ln xut hin t nht x ln nhiu nht l khong 450 s.
X l tch ly vi tt c cc gi tr ny.
Bi F: Xp hng
S dng mt hng i (queue) m t bi ton.
C th lm n gin hn nh sau: vi a l chnh lch gii hn gii tnh cho php.
FOR(i,1,n){
if(abs(nam[i]-nu[i]) > a+1) {
return i-2;
}
}
if(abs(nam[n]-nu[n] = a+1)) return n-1;
else return n;

Bi G: Vn chuyn bnh piza
Cu trc d liu.
Cn duy tr 2 tp hp A v B cha cc bnh theo th t kch thc bnh tng dn. Nu s lng
bnh l chn th s phn t ca A v B l bng nhau, nu l th A t hn B mt phn t.
Thao tc ly bnh s l phn t u tin ca tp hp B. Mi ln b sung thm 1 phn t, cn cp
nht li c 2 tp hp trn sao cho duy tr ng th t.
Bi H: Hnh trnh du lch
Cht nh phn + ng i ngn nht.
Trng hp vi gc cua gii hn bng 180 m vn khng th i c, y l trng hp
impossible.
Cht nh phn tm gc cua nh nht sao cho tn ti ng i t nt 1 ti nt N sao cho mi gc
cua u khng vt qu gc gii hn ny. nh du ng i bng mng 2 chiu, F[i][j] l
ng i ngn nht ti nh j, c nh lin trc l i.
Bi I: Chia phn
A funny problem.
p s ca bi ton bng m gcd(n, m). Phn chng minh dnh cho bn c.
Bi J: Nui cy vi khun
Vi gii hn n <= 1000, ta hon ton c th x l bng BIT 2D hoc Segment tree 2D.
Trong trng hp n <= 100 000, ta s dng 1 chiu (Ox) l BIT hoc Segment tree, chiu cn li
(Oy) s dng cy nh phn c kh nng tnh tng trn on nh Splay tree hay Treap, ...