Solution for SPOJ Hướng dẫn và chia sẻ lời giải cho các problems trên vn.spoj.com //vnspoj.github.io/ Tue, 08 Jun 2021 14:46:47 +0000 Tue, 08 Jun 2021 14:46:47 +0000 Jekyll v3.9.0 NKTEST - Kiểm tra chương trình //vnspoj.github.io/problems/NKTEST.html stack data-structure BONUS - VOI 2011 Phần thưởng //vnspoj.github.io/problems/BONUS.html dp ZABAVA - ZABAVA //vnspoj.github.io/problems/ZABAVA.html dp math YPKTH - Phần tử thứ K //vnspoj.github.io/problems/YPKTH.html segment-tree binary-search sortings data-structure XUCXAC - Xúc xắc //vnspoj.github.io/problems/XUCXAC.html dijkstra dp heap data-structure XAYNHA - Xây nhà bằng đá quý //vnspoj.github.io/problems/XAYNHA.html math WEATHER - Điều kiện thời tiết //vnspoj.github.io/problems/WEATHER.html tarjan dfs graph dp math VSTEPS - Steps - Bậc thang //vnspoj.github.io/problems/VSTEPS.html dp VRATF - Những con đường quanh nông trang //vnspoj.github.io/problems/VRATF.html math brute-force implementation VOSTRIBO - Tribonacci //vnspoj.github.io/problems/VOSTRIBO.html matrix math dp VOSTRAVL - Du lịch //vnspoj.github.io/problems/VOSTRAVL.html euler dfs stack data-structure graph VOSSEVEN - Bài toán số 7 //vnspoj.github.io/problems/VOSSEVEN.html dp VOSRTRI - Tam giác vuông //vnspoj.github.io/problems/VOSRTRI.html math VNEMPIRE - Đế chế //vnspoj.github.io/problems/VNEMPIRE.html dsu kruskal mst prim math sortings data-structure VMUNCH - Gặm cỏ //vnspoj.github.io/problems/VMUNCH.html bfs graph queue data-structure VMST - Cây khung //vnspoj.github.io/problems/VMST.html kruskal mst dsu graph greedy VMMTFIVE - Tổng trên ma trận! //vnspoj.github.io/problems/VMMTFIVE.html brute-force implementation VMCANDLE - Aladdin và cây đèn cầy //vnspoj.github.io/problems/VMCANDLE.html math VECTOR - Tổng vector //vnspoj.github.io/problems/VECTOR.html binary-search dfs sortings VDANGER - Nguy hiểm rõ ràng trước mắt //vnspoj.github.io/problems/VDANGER.html dijkstra dp graph VCOWFLIX - Đi xem phim //vnspoj.github.io/problems/VCOWFLIX.html dp V11WATER - Nước đọng //vnspoj.github.io/problems/V11WATER.html dp UPGRANET - VOI 2011 Nâng cấp mạng //vnspoj.github.io/problems/UPGRANET.html mst lca dsu tree dfs graph TTRIP - TTRIP - Tham quan Thành Cổ //vnspoj.github.io/problems/TTRIP.html dijkstra floyd graph TTRAVEL - Time Travel //vnspoj.github.io/problems/TTRAVEL.html data-structure brute-force implementation TRICIR - Tam giác vuông trên vòng tròn //vnspoj.github.io/problems/TRICIR.html dsu math TREEPATH - Đường đi trên cây //vnspoj.github.io/problems/TREEPATH.html bignum dp tree TREAT - Cho kẹo hay bị phá nào //vnspoj.github.io/problems/TREAT.html tarjan dfs graph TRAFFICN - Traffic Network //vnspoj.github.io/problems/TRAFFICN.html dijkstra graph TJALG - Tìm TPLT mạnh //vnspoj.github.io/problems/TJALG.html tarjan dfs dp graph TCDFZ - Chữ số tận cùng khác 0 //vnspoj.github.io/problems/TCDFZ.html math greedy TAYTRUC - Đường lên Tây Trúc //vnspoj.github.io/problems/TAYTRUC.html dp SUBSTR - Xâu con //vnspoj.github.io/problems/SUBSTR.html kmp string STONE1 - Rải sỏi //vnspoj.github.io/problems/STONE1.html dp tree dfs STNODE - VOI09 Nút st - xung yếu //vnspoj.github.io/problems/STNODE.html dp dfs graph STMERGE - VOI 2013 - Trộn xâu //vnspoj.github.io/problems/STMERGE.html dp STABLE - Ổn định //vnspoj.github.io/problems/STABLE.html bfs queue graph SPSEQ - Sequences //vnspoj.github.io/problems/SPSEQ.html dp lis SHTH - Số hiệu tổ hợp //vnspoj.github.io/problems/SHTH.html bignum math SHHV - Số hiệu hoán vị //vnspoj.github.io/problems/SHHV.html bignum math SHCH - Số hiệu chỉnh hợp //vnspoj.github.io/problems/SHCH.html bignum math SETNJA - Setnja //vnspoj.github.io/problems/SETNJA.html bignum brute-force dp SEC - Tin mật //vnspoj.github.io/problems/SEC.html trie tree dp dfs SEARCH1 - Other search problem //vnspoj.github.io/problems/SEARCH1.html counting implementation SEARCH - Dãy số //vnspoj.github.io/problems/SEARCH.html counting implementation SAFENET2 - Mạng máy tính an toàn //vnspoj.github.io/problems/SAFENET2.html tarjan dfs graph data-structure ROTATION - Quay bánh xe //vnspoj.github.io/problems/ROTATION.html math ROBOCON - VOI 2012 Robocon //vnspoj.github.io/problems/ROBOCON.html bfs queue graph data-structure REVAMP - Revamping Trails //vnspoj.github.io/problems/REVAMP.html dijkstra graph RABGAME - Trò chơi thỏ //vnspoj.github.io/problems/RABGAME.html bignum dp QUAD - Xây hàng rào //vnspoj.github.io/problems/QUAD.html math brute-force QTLOVE2 - Hoa hướng dương //vnspoj.github.io/problems/QTLOVE2.html matrix math dp QMAX4 - Giá trị lớn nhất 4 //vnspoj.github.io/problems/QMAX4.html tree set data-structure QMAX3VN - Giá trị lớn nhất 3 //vnspoj.github.io/problems/QMAX3VN.html tree set data-structure QMAX2 - Giá trị lớn nhất ver2 //vnspoj.github.io/problems/QMAX2.html segment-tree data-structure QMAX - Giá trị lớn nhất //vnspoj.github.io/problems/QMAX.html segment-tree dp rmq data-structure QHROAD - Phá đường //vnspoj.github.io/problems/QHROAD.html dsu greedy QBTICKET - Mua vé tàu hoả //vnspoj.github.io/problems/QBTICKET.html dp QBSTR - Xâu con chung dài nhất //vnspoj.github.io/problems/QBSTR.html dp string QBSQUARE - Hình vuông 0 1 //vnspoj.github.io/problems/QBSQUARE.html dp QBSEQ - Dãy con dài nhất có tổng chia hết cho K //vnspoj.github.io/problems/QBSEQ.html dp QBSCHOOL - Đến trường //vnspoj.github.io/problems/QBSCHOOL.html dijkstra dp graph heap data-structure QBROBOT - VOI07 Robot cứu hỏa //vnspoj.github.io/problems/QBROBOT.html dijkstra binary-search dp graph QBRECT - Hình chữ nhật 0 1 //vnspoj.github.io/problems/QBRECT.html stack dp greedy QBPOINT - Bộ ba điểm thẳng hàng //vnspoj.github.io/problems/QBPOINT.html math brute-force QBPAL - Đếm chuỗi đối xứng //vnspoj.github.io/problems/QBPAL.html bignum dp QBMST - Cây khung nhỏ nhất ( HEAP ) //vnspoj.github.io/problems/QBMST.html kruskal dsu mst graph QBMSEQ - VOI07 Dãy con không giảm dài nhất //vnspoj.github.io/problems/QBMSEQ.html math brute-force QBMAX - Đường đi có tổng lớn nhất //vnspoj.github.io/problems/QBMAX.html dp QBHEAP - Hàng đợi có độ ưu tiên //vnspoj.github.io/problems/QBHEAP.html heap implementation data-structure QBDIVSEQ - Chia dãy //vnspoj.github.io/problems/QBDIVSEQ.html lis dp QBBUILD - Xây dựng đường //vnspoj.github.io/problems/QBBUILD.html dijkstra graph QBAGENTS - Các đại lý //vnspoj.github.io/problems/QBAGENTS.html bfs queue dp PYRAMID2 - Duyệt binh //vnspoj.github.io/problems/PYRAMID2.html math greedy PWRFAIL - Mất điện //vnspoj.github.io/problems/PWRFAIL.html dijkstra graph PWALK - Dạo chơi đồng cỏ //vnspoj.github.io/problems/PWALK.html dfs PVOI14_5 - Chữ P //vnspoj.github.io/problems/PVOI14_5.html math dp PVOI14_4 - Chữ M //vnspoj.github.io/problems/PVOI14_4.html binary-index-tree dp sortings binary-search data-structure PVOI14_1 - ĐINH GHIM //vnspoj.github.io/problems/PVOI14_1.html math PTRANG - Phân Trang //vnspoj.github.io/problems/PTRANG.html dp PTQMSEQ - Dãy số vòng tròn //vnspoj.github.io/problems/PTQMSEQ.html math greedy POTATO - Ăn khoai //vnspoj.github.io/problems/POTATO.html brute-force POST3 - Ai cộng nhanh nhất //vnspoj.github.io/problems/POST3.html implementation POST - A cộng B //vnspoj.github.io/problems/POST.html math PNUMBER - Tìm số nguyên tố //vnspoj.github.io/problems/PNUMBER.html math PIZZALOC - Pizza Location //vnspoj.github.io/problems/PIZZALOC.html math sortings brute-force graph PCIRCLE - Vòng số nguyên tố //vnspoj.github.io/problems/PCIRCLE.html math brute-force PBCWATER - Tính toán lượng nước //vnspoj.github.io/problems/PBCWATER.html heap dp data-structure dijkstra PBCSEQ - Các đoạn nguyên //vnspoj.github.io/problems/PBCSEQ.html lis sortings dp PBCPOINT - Nối điểm //vnspoj.github.io/problems/PBCPOINT.html bfs dsu dp queue PBCGANGS - Các băng đảng //vnspoj.github.io/problems/PBCGANGS.html dsu PBCDEM - Đếm dãy //vnspoj.github.io/problems/PBCDEM.html bignum binary-search dp PATULJCI - Snow White and the N dwarfs //vnspoj.github.io/problems/PATULJCI.html binary-search greedy PARIGAME - VOI 2011 Trò chơi chẵn lẻ //vnspoj.github.io/problems/PARIGAME.html dp PALINY - Palindrome dài nhất //vnspoj.github.io/problems/PALINY.html string binary-search brute-force PA06ANT - Ant //vnspoj.github.io/problems/PA06ANT.html matrix math dp ORDERSET - Order statistic set //vnspoj.github.io/problems/ORDERSET.html data-structure set OPTCUT - Chặt cây //vnspoj.github.io/problems/OPTCUT.html dp ONE4EVER - Forever Alone Person //vnspoj.github.io/problems/ONE4EVER.html matrix math dp NUMBER - Biến đổi số //vnspoj.github.io/problems/NUMBER.html tarjan dfs graph NTTREE - Tổng trọng số trên cây //vnspoj.github.io/problems/NTTREE.html dfs dp tree graph NTPFECT - Đại diện hoàn hảo //vnspoj.github.io/problems/NTPFECT.html tree dp dfs graph NOTE - Gấp tiền //vnspoj.github.io/problems/NOTE.html math NKTREE - Cây nhị phân tìm kiếm //vnspoj.github.io/problems/NKTREE.html math NKTOSS - Tung đồng xu //vnspoj.github.io/problems/NKTOSS.html bignum dp NKTICK - Xếp hàng mua vé //vnspoj.github.io/problems/NKTICK.html dp NKTEAM - Team Selection //vnspoj.github.io/problems/NKTEAM.html binary-index-tree sortings data-structure NKTABLE - NKTable //vnspoj.github.io/problems/NKTABLE.html bfs NKSGAME - VOI08 Trò chơi với dãy số //vnspoj.github.io/problems/NKSGAME.html binary-search NKSEQ - Dãy số //vnspoj.github.io/problems/NKSEQ.html dp greedy NKREZ - Hội trường //vnspoj.github.io/problems/NKREZ.html binary-search dp sortings NKRACING - Vòng đua F1 //vnspoj.github.io/problems/NKRACING.html kruskal dsu mst graph NKPOS - Người đưa thư //vnspoj.github.io/problems/NKPOS.html graph NKPOLICE - Police //vnspoj.github.io/problems/NKPOLICE.html tarjan lca dfs NKPATH - Đường đi trên lưới //vnspoj.github.io/problems/NKPATH.html dp NKPALIN - Chuỗi đối xứng //vnspoj.github.io/problems/NKPALIN.html dp NKONEARC - Mạng máy tính //vnspoj.github.io/problems/NKONEARC.html tarjan NKNUMFRE - Số thân thiện //vnspoj.github.io/problems/NKNUMFRE.html math NKMAXSEQ - Dãy con dài nhất //vnspoj.github.io/problems/NKMAXSEQ.html binary-index-tree NKLUCK - Dãy số may mắn //vnspoj.github.io/problems/NKLUCK.html binary-index-tree binary-search sortings data-structure NKLINEUP - Xếp hàng //vnspoj.github.io/problems/NKLINEUP.html segment-tree rmq data-structure NKLETTER - Gửi thư //vnspoj.github.io/problems/NKLETTER.html string NKINV - Dãy nghịch thế //vnspoj.github.io/problems/NKINV.html binary-index-tree NKGUARD - Bảo vệ nông trang //vnspoj.github.io/problems/NKGUARD.html bfs NKFLOW - Luồng cực đại trên mạng //vnspoj.github.io/problems/NKFLOW.html flow NKCITY - Xây dựng thành phố //vnspoj.github.io/problems/NKCITY.html kruskal dsu mst graph NKCABLE - Nối mạng //vnspoj.github.io/problems/NKCABLE.html dp NKBUS - Bus //vnspoj.github.io/problems/NKBUS.html dp sortings NKBRACKE - Dãy ngoặc đúng //vnspoj.github.io/problems/NKBRACKE.html segment-tree data-structure NKBM - Cặp ghép cực đại trên đồ thị hai phía //vnspoj.github.io/problems/NKBM.html flow graph NKABD - Số phong phú //vnspoj.github.io/problems/NKABD.html dp math NK05MNIM - Bốc sỏi //vnspoj.github.io/problems/NK05MNIM.html math brute-force NICEQUAD - Tứ giác đẹp //vnspoj.github.io/problems/NICEQUAD.html math brute-force NETACCEL - Tăng tốc mạng máy tính //vnspoj.github.io/problems/NETACCEL.html dijkstra graph NDCCARD - Các lá bài Blackjack //vnspoj.github.io/problems/NDCCARD.html dp brute-force NCOB - Cuộc đấu cân não //vnspoj.github.io/problems/NCOB.html game math brute-force MYSTERY - Số huyền bí //vnspoj.github.io/problems/MYSTERY.html math brute-force MULONE - Nhân 1 //vnspoj.github.io/problems/MULONE.html math brute-force MTWALK - Mountain Walking //vnspoj.github.io/problems/MTWALK.html bfs binary-search queue graph MTREE - Another Tree Problem //vnspoj.github.io/problems/MTREE.html dp dfs math MSTICK - Wooden Sticks //vnspoj.github.io/problems/MSTICK.html lis sortings MSE07B - Double Queue //vnspoj.github.io/problems/MSE07B.html set data-structure MRECAMAN - Recaman’s Sequence //vnspoj.github.io/problems/MRECAMAN.html set data-structure MPILOT - Pilots //vnspoj.github.io/problems/MPILOT.html dp MNERED - NERED //vnspoj.github.io/problems/MNERED.html dp MMMGAME - M&M Game //vnspoj.github.io/problems/MMMGAME.html math brute-force game MMAXPER - Rectangles Perimeter //vnspoj.github.io/problems/MMAXPER.html dp MMASS - Mass of Molecule //vnspoj.github.io/problems/MMASS.html stack data-structure MINROAD - VOI 2014 - Con duong Tung Truc //vnspoj.github.io/problems/MINROAD.html binary-search sortings dp MINK - Huyền thoại Lục Vân Tiên //vnspoj.github.io/problems/MINK.html dequeue data-structure MINCUT - VOI 2015 Day 2 - Cắt hình //vnspoj.github.io/problems/MINCUT.html binary-search dp MESSAGE - Truyền tin //vnspoj.github.io/problems/MESSAGE.html tarjan stack graph MEDIAN - Phần tử trung vị //vnspoj.github.io/problems/MEDIAN.html binary-index-tree binary-search data-structure MECUNG - Mê cung //vnspoj.github.io/problems/MECUNG.html bfs data-structure graph MDOLLS - Nested Dolls //vnspoj.github.io/problems/MDOLLS.html lis sortings dp MDIGITS2 - First Number //vnspoj.github.io/problems/MDIGITS2.html string brute-force MCOINS - Coins Game //vnspoj.github.io/problems/MCOINS.html dp game MCARDS - Card Sorting //vnspoj.github.io/problems/MCARDS.html lis brute-force MBLAST - BLAST //vnspoj.github.io/problems/MBLAST.html string dp MBEEWALK - Bee Walk //vnspoj.github.io/problems/MBEEWALK.html bfs queue graph MAXCUB - Khối lập phương lớn nhất //vnspoj.github.io/problems/MAXCUB.html dp MAXARR1 - Help Conan 12 ! //vnspoj.github.io/problems/MAXARR1.html dp MATCH2 - Bộ ghép đầy đủ trọng số cực tiểu //vnspoj.github.io/problems/MATCH2.html flow graph MATCH1 - Cặp ghép không trọng số //vnspoj.github.io/problems/MATCH1.html flow graph M3TILE - LATGACH3 //vnspoj.github.io/problems/M3TILE.html dp M00PAIR - 0 0 Pairs //vnspoj.github.io/problems/M00PAIR.html bignum dp LUCKYNUM - Lucky Numbers //vnspoj.github.io/problems/LUCKYNUM.html bfs dp LUBENICA - Lubenica //vnspoj.github.io/problems/LUBENICA.html lca dp tree graph LTPMSEQ - Tìm xâu //vnspoj.github.io/problems/LTPMSEQ.html trie tree string LSFIGHT - Đấu trường VM08 //vnspoj.github.io/problems/LSFIGHT.html dp LQDGONME - Dãy con chung dài nhất (new ver) //vnspoj.github.io/problems/LQDGONME.html dp brute-force LQDDIV - Phân tập //vnspoj.github.io/problems/LQDDIV.html binary-search dfs sortings LNACS - Dãy con chung không liền kề dài nhất //vnspoj.github.io/problems/LNACS.html dp LIS - Dãy con tăng dài nhất (bản khó) //vnspoj.github.io/problems/LIS.html dp lis LIQ - Dãy con tăng dài nhất ( bản dễ ) //vnspoj.github.io/problems/LIQ.html dp lis LINEGAME - VOI09 Trò chơi với băng số //vnspoj.github.io/problems/LINEGAME.html dp LEM7 - COMPANY //vnspoj.github.io/problems/LEM7.html dp LEM6 - BIRTHDAY //vnspoj.github.io/problems/LEM6.html bignum math LATGACH4 - Lát gạch 4 //vnspoj.github.io/problems/LATGACH4.html matrix math LATGACH - Lát gạch //vnspoj.github.io/problems/LATGACH.html bignum dp LASCALE - Quả Cân //vnspoj.github.io/problems/LASCALE.html math KQUERY - K-query //vnspoj.github.io/problems/KQUERY.html binary-index-tree sortings data-structure KPLANK - Bán dừa //vnspoj.github.io/problems/KPLANK.html dp stack KMIN - KMIN //vnspoj.github.io/problems/KMIN.html heap data-structure KMEDIAN - Above the Median //vnspoj.github.io/problems/KMEDIAN.html binary-index-tree binary-search sortings data-structure KKDD - K - Không đơn độc //vnspoj.github.io/problems/KKDD.html binary-index-tree dp binary-search sortings data-structure KINV - Dãy nghịch thế độ dài K //vnspoj.github.io/problems/KINV.html binary-index-tree data-structure dp KGSS - Maximum Sum //vnspoj.github.io/problems/KGSS.html segment-tree data-structure KDIFF - Trồng hoa //vnspoj.github.io/problems/KDIFF.html dequeue dp KCOIN - Trò chơi với đồng xu //vnspoj.github.io/problems/KCOIN.html brute-force KANDP - Mã và tốt //vnspoj.github.io/problems/KANDP.html bfs queue graph KAGAIN - Chiến trường Ô qua //vnspoj.github.io/problems/KAGAIN.html stack dp IVANA - Trò chơi vòng số //vnspoj.github.io/problems/IVANA.html dp IOIBIN - Các thùng nước //vnspoj.github.io/problems/IOIBIN.html dsu INSUL - Cách nhiệt //vnspoj.github.io/problems/INSUL.html math HSPC14J - Sàng //vnspoj.github.io/problems/HSPC14J.html math HSPC14I - Chơi nhảy //vnspoj.github.io/problems/HSPC14I.html math HSPC14H - Táo chuối //vnspoj.github.io/problems/HSPC14H.html dp HSPC14A - Biến đổi cặp số //vnspoj.github.io/problems/HSPC14A.html math HOUSES - Những ngôi nhà //vnspoj.github.io/problems/HOUSES.html dfs HIREHP - Cho thuê xe //vnspoj.github.io/problems/HIREHP.html segment-tree data-structure HEAP1 - Một chút về Huffman Tree //vnspoj.github.io/problems/HEAP1.html data-structure tree HBTLCA - dynamic LCA //vnspoj.github.io/problems/HBTLCA.html lca HAOI6000 - HAOI 6000 //vnspoj.github.io/problems/HAOI6000.html bfs dp HAF1 - Đua Xe //vnspoj.github.io/problems/HAF1.html dp GSS - Đoạn con có tổng lớn nhất //vnspoj.github.io/problems/GSS.html segment-tree data-structure GRAPH_ - Tìm khớp và cầu (Cơ bản) //vnspoj.github.io/problems/GRAPH_.html tarjan tree dfs dp graph GONDOR - GONDOR //vnspoj.github.io/problems/GONDOR.html dijkstra FWATER - Tưới nước đồng cỏ //vnspoj.github.io/problems/FWATER.html prim mst graph FOCUS - Chuyên gia ruồi //vnspoj.github.io/problems/FOCUS.html binary-search binary-index-tree sortings FLOYD - Floyd hoặc Dijkstra ( Cơ bản ) //vnspoj.github.io/problems/FLOYD.html dijkstra floyd graph FLOW1 -Giao lưu //vnspoj.github.io/problems/FLOW1.html flow dp FIRS - Hàng cây //vnspoj.github.io/problems/FIRS.html segment-tree FINDNUM - Tìm số //vnspoj.github.io/problems/FINDNUM.html math FBRICK - Xếp hình //vnspoj.github.io/problems/FBRICK.html matrix math EGG - Thả trứng , trò giải trí tuổi teen //vnspoj.github.io/problems/EGG.html dp math DTKSUB - Chuỗi con xuất hiện K lần //vnspoj.github.io/problems/DTKSUB.html binary-search string DTGAME - Tiền bạc luôn là thứ quý giá //vnspoj.github.io/problems/DTGAME.html dp DTDOI - Đổi tiền //vnspoj.github.io/problems/DTDOI.html greedy dp sortings DQUERY - D-query //vnspoj.github.io/problems/DQUERY.html binary-index-tree sortings data-structure DHTABLE2 - Bảng thông tin điện tử //vnspoj.github.io/problems/DHTABLE2.html bfs DHSERV - Dịch vụ truyền thông //vnspoj.github.io/problems/DHSERV.html dijkstra DHRECT - Trò chơi xếp hình chữ nhật //vnspoj.github.io/problems/DHRECT.html sortings math DHLOCO - Trò chơi lò cò //vnspoj.github.io/problems/DHLOCO.html matrix dp DHLOCK - Khóa số //vnspoj.github.io/problems/DHLOCK.html math brute-force greedy DHLEXP - Biểu thức logic //vnspoj.github.io/problems/DHLEXP.html binary-search-tree data-structure DHFRBUS - Vé xe miễn phí //vnspoj.github.io/problems/DHFRBUS.html dijkstra DHEXP - Biểu thức //vnspoj.github.io/problems/DHEXP.html sortings greedy CWAY - Đếm số đường đi trên đồ thị đầy đủ //vnspoj.github.io/problems/CWAY.html dp bignum CTREE - Tô màu nhỏ nhất //vnspoj.github.io/problems/CTREE.html dp CTNBULLS - Bulls and Cows //vnspoj.github.io/problems/CTNBULLS.html dp CT - Counting triangles //vnspoj.github.io/problems/CT.html math CRECT - Đếm các hình chữ nhật //vnspoj.github.io/problems/CRECT.html dp math stack CREC01 - Đếm hình chữ nhật trên bảng 0-1 //vnspoj.github.io/problems/CREC01.html dp math CRATE - Coder Rating //vnspoj.github.io/problems/CRATE.html binary-index-tree sortings CPPSET - Tập hợp động //vnspoj.github.io/problems/CPPSET.html set data-structure COUNTPL - Đếm số Palindrome //vnspoj.github.io/problems/COUNTPL.html dp COUNTCBG - COUNT N //vnspoj.github.io/problems/COUNTCBG.html math COMNET - VOI 2013 - Mạng truyền thông //vnspoj.github.io/problems/COMNET.html dsu kruskal COLLECT - VOI05 Bộ sưu tập //vnspoj.github.io/problems/COLLECT.html bfs CLOCK - Chỉnh đồng hồ //vnspoj.github.io/problems/CLOCK.html bfs CHUOIHAT - Chuỗi hạt //vnspoj.github.io/problems/CHUOIHAT.html dp bignum CHNTOWER - Tháp Hà Nội //vnspoj.github.io/problems/CHNTOWER.html dp CHESSCBG - Bàn cờ thế //vnspoj.github.io/problems/CHESSCBG.html bfs CHEER - Động viên đàn bò //vnspoj.github.io/problems/CHEER.html kruskal dsu mst graph CHEAT - Chơi bi-a 1 lỗ //vnspoj.github.io/problems/CHEAT.html stack CENTRE28 - CENTRE //vnspoj.github.io/problems/CENTRE28.html dijkstra dp CBUYING - Chocolate Buying //vnspoj.github.io/problems/CBUYING.html greedy sortings CATALAN - Dãy số Catalan //vnspoj.github.io/problems/CATALAN.html dp math CARDSHUF - Cards shuffing //vnspoj.github.io/problems/CARDSHUF.html splay-tree binary-search-tree data-structure CARDS - Tráo bài //vnspoj.github.io/problems/CARDS.html splay-tree binary-search-tree data-structure CAR - Lập lịch sửa chữa ô tô //vnspoj.github.io/problems/CAR.html sortings greedy C11TRCNT - Bắn máy bay //vnspoj.github.io/problems/C11TRCNT.html math C11SUM - Siêu trộm KID và Mật khẩu đêm Trung thu! //vnspoj.github.io/problems/C11SUM.html dp math C11STR2 - Tiền tố và hậu tố //vnspoj.github.io/problems/C11STR2.html z-function C11SEQ - Dãy số //vnspoj.github.io/problems/C11SEQ.html binary-index-tree dp C11PAIRS - Đếm cặp //vnspoj.github.io/problems/C11PAIRS.html math stack C11KM - Khuyến mãi //vnspoj.github.io/problems/C11KM.html dp C11ID - Mã số //vnspoj.github.io/problems/C11ID.html sortings math C11DK2 - C11DK2 //vnspoj.github.io/problems/C11DK2.html matrix math C11CAVE - Hang động //vnspoj.github.io/problems/C11CAVE.html dp C11CAL - Tính toán //vnspoj.github.io/problems/C11CAL.html matrix math C11BEAU - Tên đẹp //vnspoj.github.io/problems/C11BEAU.html greedy math C11BC2 - Robin //vnspoj.github.io/problems/C11BC2.html dsu kruskal C11BC1 - The country of heaven //vnspoj.github.io/problems/C11BC1.html dp BWPOINTS - VOI 2011 Nối điểm đen trắng //vnspoj.github.io/problems/BWPOINTS.html greedy sortings BONUS13 - VOI 2013 - Phần thưởng //vnspoj.github.io/problems/BONUS13.html brute-force BONGDA - Lịch thi đấu bóng đá //vnspoj.github.io/problems/BONGDA.html greedy BONES - Xúc xắc bò //vnspoj.github.io/problems/BONES.html brute-force BLOPER - Operators //vnspoj.github.io/problems/BLOPER.html greedy BLGEN - Chuỗi gen đặc trưng //vnspoj.github.io/problems/BLGEN.html dp BINLADEN - Bin Laden //vnspoj.github.io/problems/BINLADEN.html dijkstra BINARY2 - SPBINARY2 //vnspoj.github.io/problems/BINARY2.html dp BIGNUM - BIGNUM //vnspoj.github.io/problems/BIGNUM.html bignum BESTSPOT - Vị trí tốt nhất //vnspoj.github.io/problems/BESTSPOT.html dijkstra heap BEADSNB - Chuỗi ốc //vnspoj.github.io/problems/BEADSNB.html lis dp BCDIV - Chia nhóm //vnspoj.github.io/problems/BCDIV.html dp BASEH - Cơ số H //vnspoj.github.io/problems/BASEH.html math BARICAVN - BARICA //vnspoj.github.io/problems/BARICAVN.html dp sortings BARIC - Bò Ba-ri //vnspoj.github.io/problems/BARIC.html dp BALLGAME - Ball game //vnspoj.github.io/problems/BALLGAME.html heap set sortings data-structure AZNET - VOI 2014 - Mang truyen thong //vnspoj.github.io/problems/AZNET.html kruskal dsu mst graph AUCTION - Going Once, Going Twice, Gone! //vnspoj.github.io/problems/AUCTION.html dp ASSIGN1 - Phân công hoàn thành sớm nhất //vnspoj.github.io/problems/ASSIGN1.html flow graph AREA - Diện tích hình chữ nhật //vnspoj.github.io/problems/AREA.html segment-tree sortings data-structure ANT - Kiến //vnspoj.github.io/problems/ANT.html math AMSSEQ - Dãy số //vnspoj.github.io/problems/AMSSEQ.html dp ADS - Quảng cáo //vnspoj.github.io/problems/ADS.html dfs graph ACMNB - ACM //vnspoj.github.io/problems/ACMNB.html sortings greedy bfs Breadth First Travel - Duyệt theo chiều rộng //vnspoj.github.io/category/bfs bignum Big Integer - Xử lý số nguyên lớn //vnspoj.github.io/category/bignum binary-index-tree Binary Index Tree //vnspoj.github.io/category/binary-index-tree binary-search-tree Binary Search Tree //vnspoj.github.io/category/binary-search-tree binary-search Binary Search - Chặt nhị phân //vnspoj.github.io/category/binary-search brute-force Brute Force - Duyệt, vét, đệ quy, nhánh cận //vnspoj.github.io/category/brute-force counting Counting - Các bài toán đếm //vnspoj.github.io/category/counting dag Directed Acyclic Graph - Đồ thị không chu trình //vnspoj.github.io/category/dag data-structure Data Structure - Stack, Queue, Dequeue, Heap, Set, Map, Binary Search Tree //vnspoj.github.io/category/data-structure dequeue Dequeue - Hàng đợi hai đầu //vnspoj.github.io/category/dequeue dfs Depth First Travel - Duyệt theo chiều sâu //vnspoj.github.io/category/dfs dijkstra Dijkstra - Đường đi ngắn nhất //vnspoj.github.io/category/dijkstra dp Dynamic Programming - Quy hoạch động //vnspoj.github.io/category/dp dsu Disjoint Set Union //vnspoj.github.io/category/dsu euler Chu trình Euler //vnspoj.github.io/category/euler flow Flow - Luồng, cặp ghép cực đại //vnspoj.github.io/category/flow floyd Floyd - Floyd–Warshall - Đường đi ngắn nhất //vnspoj.github.io/category/floyd game Game - Các bài toán trò chơi //vnspoj.github.io/category/game graph Graph - Đồ thị //vnspoj.github.io/category/graph greedy Greedy - Tham lam //vnspoj.github.io/category/greedy hamilton Chu trình Hamilton //vnspoj.github.io/category/hamilton heap Heap - Priority Queue - Hàng đợi ưu tiên //vnspoj.github.io/category/heap implementation Implementation //vnspoj.github.io/category/implementation Categories //vnspoj.github.io/category/index.html kmp KMP - Tìm kiếm chuỗi //vnspoj.github.io/category/kmp kruskal Kruskal - Tìm cây khung nhỏ nhất MST //vnspoj.github.io/category/kruskal lca Last Common Ancestor - Tổ tiên chung gần nhất //vnspoj.github.io/category/lca lis Longest Increasing Subsequence - Dãy con tăng dài nhất //vnspoj.github.io/category/lis math Math - Lý thuyết toán //vnspoj.github.io/category/math matrix Matrix - Ma trận & Kỹ thuật nhân ma trận //vnspoj.github.io/category/matrix mst Minimum Spanning Tree - Cây khung nhỏ nhất //vnspoj.github.io/category/mst prim Prim - Tìm cây khung nhỏ nhất MST //vnspoj.github.io/category/prim queue Queue - Hàng đợi //vnspoj.github.io/category/queue rmq Range Minimum Query //vnspoj.github.io/category/rmq segment-tree Segment Tree - Interval Tree //vnspoj.github.io/category/segment-tree set Set - Binary Search Tree (BST) - Cây nhị phân tìm kiếm //vnspoj.github.io/category/set sortings Sortings - Sắp xếp //vnspoj.github.io/category/sortings splay-tree Splay Tree //vnspoj.github.io/category/splay-tree stack Stack - Ngăn xếp //vnspoj.github.io/category/stack string String - Xử lí chuỗi //vnspoj.github.io/category/string tarjan Tarjan - Thành phần liên thông, Cầu Khớp //vnspoj.github.io/category/tarjan topo Sắp xếp Topo - DAG //vnspoj.github.io/category/topo tree Tree - LCA, Trie, Quy hoạch động //vnspoj.github.io/category/tree trie Trie - Cây tiền tố, hậu tố //vnspoj.github.io/category/trie z-function Z Function - Tìm kiếm chuỗi //vnspoj.github.io/category/z-function Submask Enumeration //vnspoj.github.io/wiki/algebra/all-submasks.html Balanced Ternary //vnspoj.github.io/wiki/algebra/balanced-ternary.html Arbitrary-Precision Arithmetic //vnspoj.github.io/wiki/algebra/big-integer.html Binary Exponentiation //vnspoj.github.io/wiki/algebra/binary-exp.html Chinese Remainder Theorem //vnspoj.github.io/wiki/algebra/chinese-remainder-theorem.html Discrete Logarithm //vnspoj.github.io/wiki/algebra/discrete-log.html Discrete Root //vnspoj.github.io/wiki/algebra/discrete-root.html Number of divisors / sum of divisors //vnspoj.github.io/wiki/algebra/divisors.html Euclidean algorithm for computing the greatest common divisor //vnspoj.github.io/wiki/algebra/euclid-algorithm.html Extended Euclidean Algorithm //vnspoj.github.io/wiki/algebra/extended-euclid-algorithm.html Finding Power of Factorial Divisor //vnspoj.github.io/wiki/algebra/factorial-divisors.html Factorial modulo P //vnspoj.github.io/wiki/algebra/factorial-modulo.html Integer factorization //vnspoj.github.io/wiki/algebra/factorization.html Fast Fourier transform //vnspoj.github.io/wiki/algebra/fft.html Fibonacci Numbers //vnspoj.github.io/wiki/algebra/fibonacci-numbers.html Gray Code //vnspoj.github.io/wiki/algebra/gray-code.html Linear Diophantine Equation //vnspoj.github.io/wiki/algebra/linear-diophantine-equation.html Linear Congruence Equation //vnspoj.github.io/wiki/algebra/linear_congruence_equation.html Modular Inverse //vnspoj.github.io/wiki/algebra/module-inverse.html Montgomery Multiplication //vnspoj.github.io/wiki/algebra/montgomery_multiplication.html Euler's totient function //vnspoj.github.io/wiki/algebra/phi-function.html Operations on polynomials and series //vnspoj.github.io/wiki/algebra/polynomial.html Primality tests //vnspoj.github.io/wiki/algebra/primality_tests.html Sieve of Eratosthenes With Linear Time Complexity //vnspoj.github.io/wiki/algebra/prime-sieve-linear.html Primitive Root //vnspoj.github.io/wiki/algebra/primitive-root.html Sieve of Eratosthenes //vnspoj.github.io/wiki/algebra/sieve-of-eratosthenes.html Binomial Coefficients //vnspoj.github.io/wiki/combinatorics/binomial-coefficients.html Placing Bishops on a Chessboard //vnspoj.github.io/wiki/combinatorics/bishops-on-chessboard.html Balanced bracket sequences //vnspoj.github.io/wiki/combinatorics/bracket_sequences.html Burnside's lemma / Pólya enumeration theorem //vnspoj.github.io/wiki/combinatorics/burnside.html Catalan Numbers and its Applications //vnspoj.github.io/wiki/combinatorics/catalan-numbers.html Counting labeled graphs //vnspoj.github.io/wiki/combinatorics/counting_labeled_graphs.html Generating all K-combinations //vnspoj.github.io/wiki/combinatorics/generating_combinations.html The Inclusion-Exclusion Principle //vnspoj.github.io/wiki/combinatorics/inclusion-exclusion.html Stars and bars //vnspoj.github.io/wiki/combinatorics/stars_and_bars.html Deleting from a data structure in O(T(n)log n) //vnspoj.github.io/wiki/data_structures/deleting_in_log_n.html Disjoint Set Union //vnspoj.github.io/wiki/data_structures/disjoint_set_union.html Fenwick Tree //vnspoj.github.io/wiki/data_structures/fenwick.html Randomized Heap //vnspoj.github.io/wiki/data_structures/randomized_heap.html Segment Tree //vnspoj.github.io/wiki/data_structures/segment_tree.html Sparse Table //vnspoj.github.io/wiki/data_structures/sparse-table.html Sqrt Tree //vnspoj.github.io/wiki/data_structures/sqrt-tree.html Sqrt Decomposition //vnspoj.github.io/wiki/data_structures/sqrt_decomposition.html Minimum stack / Minimum queue //vnspoj.github.io/wiki/data_structures/stack_queue_modification.html Treap //vnspoj.github.io/wiki/data_structures/treap.html Divide and Conquer DP //vnspoj.github.io/wiki/dynamic_programming/divide-and-conquer-dp.html Dynamic Programming on Broken Profile. Problem "Parquet" //vnspoj.github.io/wiki/dynamic_programming/profile-dynamics.html Finding the largest zero submatrix //vnspoj.github.io/wiki/dynamic_programming/zero_matrix.html Games on arbitrary graphs //vnspoj.github.io/wiki/game_theory/games_on_graphs.html Sprague-Grundy theorem. Nim //vnspoj.github.io/wiki/game_theory/sprague-grundy-nim.html Finding area of simple polygon in O(N) //vnspoj.github.io/wiki/geometry/area-of-simple-polygon.html Basic Geometry //vnspoj.github.io/wiki/geometry/basic-geometry.html Check if two segments intersect //vnspoj.github.io/wiki/geometry/check-segments-intersection.html Circle-Circle Intersection //vnspoj.github.io/wiki/geometry/circle-circle-intersection.html Circle-Line Intersection //vnspoj.github.io/wiki/geometry/circle-line-intersection.html Convex hull trick and Li Chao tree //vnspoj.github.io/wiki/geometry/convex_hull_trick.html Delaunay triangulation and Voronoi diagram //vnspoj.github.io/wiki/geometry/delaunay.html Convex Hull construction using Graham's Scan //vnspoj.github.io/wiki/geometry/grahams-scan-convex-hull.html Half-plane intersection - S&I algorithm in O(N logN) //vnspoj.github.io/wiki/geometry/halfplane-intersection.html Search for a pair of intersecting segments //vnspoj.github.io/wiki/geometry/intersecting_segments.html Lattice points inside non-lattice polygon //vnspoj.github.io/wiki/geometry/lattice-points.html Length of the union of segments //vnspoj.github.io/wiki/geometry/length-of-segments-union.html Intersection Point of Lines //vnspoj.github.io/wiki/geometry/lines-intersection.html Minkowski sum of convex polygons //vnspoj.github.io/wiki/geometry/minkowski.html Finding the nearest pair of points //vnspoj.github.io/wiki/geometry/nearest_points.html Oriented area of a triangle //vnspoj.github.io/wiki/geometry/oriented-triangle-area.html Pick's Theorem //vnspoj.github.io/wiki/geometry/picks-theorem.html Check if point belongs to the convex polygon in O(log N) //vnspoj.github.io/wiki/geometry/point-in-convex-polygon.html Point location in O(log n) //vnspoj.github.io/wiki/geometry/point-location.html Finding the equation of a line for a segment //vnspoj.github.io/wiki/geometry/segment-to-line.html Finding Intersection of Two Segments //vnspoj.github.io/wiki/geometry/segments-intersection.html Finding common tangents to two circles //vnspoj.github.io/wiki/geometry/tangents-to-two-circles.html Vertical decomposition //vnspoj.github.io/wiki/geometry/vertical_decomposition.html 0-1 BFS //vnspoj.github.io/wiki/graph/01_bfs.html 2-SAT //vnspoj.github.io/wiki/graph/2SAT.html Assignment problem solution using min-cost-flo< //vnspoj.github.io/wiki/graph/Assignment-problem-min-flow.html Floyd-Warshall algorithm //vnspoj.github.io/wiki/graph/all-pair-shortest-path-floyd-warshall.html Bellman-Ford Algorithm - shortest paths with negative weights //vnspoj.github.io/wiki/graph/bellman_ford.html Check whether a graph is bipartite //vnspoj.github.io/wiki/graph/bipartite-check.html Breadth First Search //vnspoj.github.io/wiki/graph/breadth-first-search.html Finding Bridges Online //vnspoj.github.io/wiki/graph/bridge-searching-online.html Finding bridges in a graph in O(N+M) //vnspoj.github.io/wiki/graph/bridge-searching.html Finding articulation points in a graph in O(N+M) //vnspoj.github.io/wiki/graph/cutpoints.html Depth First Search //vnspoj.github.io/wiki/graph/depth-first-search.html D´Esopo-Pape //vnspoj.github.io/wiki/graph/desopo_pape.html Dijkstra Algorithm //vnspoj.github.io/wiki/graph/dijkstra.html Dijkstra on sparse graphs //vnspoj.github.io/wiki/graph/dijkstra_sparse.html Maximum flow - Dinic's algorithm //vnspoj.github.io/wiki/graph/dinic.html Edge connectivity / Vertex connectivity //vnspoj.github.io/wiki/graph/edge_vertex_connectivity.html Maximum flow - Ford-Fulkerson and Edmonds-Karp //vnspoj.github.io/wiki/graph/edmonds_karp.html Finding the Eulerian path in O(M) //vnspoj.github.io/wiki/graph/euler_path.html Checking a graph for acyclicity and finding a cycle in O(M) //vnspoj.github.io/wiki/graph/finding-cycle.html Negative Cycle Search //vnspoj.github.io/wiki/graph/finding-negative-cycle-in-graph.html Number of paths with fixed length. Shortest Path of fixed length. //vnspoj.github.io/wiki/graph/fixed_length_paths.html Flows with demands //vnspoj.github.io/wiki/graph/flow_with_demands.html Heavy-light decomposition //vnspoj.github.io/wiki/graph/hld.html Kirchhoff's Theorem //vnspoj.github.io/wiki/graph/kirchhoff-theorem.html Kuhn's Algorithm for Maximum Bipartite Matching //vnspoj.github.io/wiki/graph/kuhn_maximum_bipartite_matching.html Lowest Common Ancestor - O(sqrt(N)) and O(log N) with O(N) preprocessing //vnspoj.github.io/wiki/graph/lca.html Lowest Common Ancestor - Binary Lifting //vnspoj.github.io/wiki/graph/lca_binary_lifting.html Lowest Common Ancestor - Farach-Colton and Bender algorithm //vnspoj.github.io/wiki/graph/lca_farachcoltonbender.html Lowest Common Ancestor - Tarjan's off-line algorithm //vnspoj.github.io/wiki/graph/lca_tarjan.html Minimum-cost flow - Successive shortest path algorithm //vnspoj.github.io/wiki/graph/min_cost_flow.html Maximum flow - MPM algorithm //vnspoj.github.io/wiki/graph/mpm.html Minimum spanning tree - Kruskal's algorithm //vnspoj.github.io/wiki/graph/mst_kruskal.html Minimum spanning tree - Kruskal with Disjoint Set Union //vnspoj.github.io/wiki/graph/mst_kruskal_with_dsu.html Minimum spanning tree - Prim's algorithm //vnspoj.github.io/wiki/graph/mst_prim.html Prüfer code //vnspoj.github.io/wiki/graph/pruefer_code.html Maximum flow - Push-relabel method improved //vnspoj.github.io/wiki/graph/push-relabel-faster.html Maximum flow - Push-relabel algorithm //vnspoj.github.io/wiki/graph/push-relabel.html Solve RMQ by finding LCA //vnspoj.github.io/wiki/graph/rmq_linear.html Search for connected components in a graph //vnspoj.github.io/wiki/graph/search-for-connected-components.html Second Best Minimum Spanning Tree //vnspoj.github.io/wiki/graph/second_best_mst.html Strong Orientation //vnspoj.github.io/wiki/graph/strong-orientation.html Strongly Connected Components and Condensation graph //vnspoj.github.io/wiki/graph/strongly-connected-components.html Topological Sorting //vnspoj.github.io/wiki/graph/topological-sort.html Paint the edges of the tree //vnspoj.github.io/wiki/graph/tree_painting.html E-Maxx Algorithms in English from CP-Algorithms //vnspoj.github.io/wiki/index.html Calculating Determinant of Matrix by Gauss //vnspoj.github.io/wiki/linear_algebra/determinant-gauss.html Calculating the determinant using Kraut method //vnspoj.github.io/wiki/linear_algebra/determinant-kraut.html Gauss method for solving system of linear equations //vnspoj.github.io/wiki/linear_algebra/linear-system-gauss.html Rank of a matrix //vnspoj.github.io/wiki/linear_algebra/rank-matrix.html Newton's method for finding roots //vnspoj.github.io/wiki/num_methods/roots_newton.html Simpson integration //vnspoj.github.io/wiki/num_methods/simpson-integration.html Ternary Search and its Applications //vnspoj.github.io/wiki/num_methods/ternary_search.html 15 Puzzle Game: Existence Of The Solution //vnspoj.github.io/wiki/others/15-puzzle.html Josephus Problem //vnspoj.github.io/wiki/others/josephus_problem.html Search the subarray with the maximum/minimum sum //vnspoj.github.io/wiki/others/maximum_average_segment.html The Stern-Brocot Tree and Farey Sequences //vnspoj.github.io/wiki/others/stern_brocot_tree_farey_sequences.html Optimal schedule of jobs given their deadlines and durations //vnspoj.github.io/wiki/schedules/schedule-with-completion-duration.html Scheduling jobs on one machine //vnspoj.github.io/wiki/schedules/schedule_one_machine.html Scheduling jobs on two machines //vnspoj.github.io/wiki/schedules/schedule_two_machines.html K-th order statistic in O(N) //vnspoj.github.io/wiki/sequences/k-th.html Longest increasing subsequence //vnspoj.github.io/wiki/sequences/longest_increasing_subsequence.html Range Minimum Query //vnspoj.github.io/wiki/sequences/rmq.html Aho-Corasick algorithm //vnspoj.github.io/wiki/string/aho_corasick.html Expression parsing //vnspoj.github.io/wiki/string/expression_parsing.html Lyndon factorization //vnspoj.github.io/wiki/string/lyndon_factorization.html Finding repetitions //vnspoj.github.io/wiki/string/main_lorentz.html Manacher's Algorithm - Finding all sub-palindromes in O(N) //vnspoj.github.io/wiki/string/manacher.html Prefix function. Knuth–Morris–Pratt algorithm //vnspoj.github.io/wiki/string/prefix-function.html Rabin-Karp Algorithm //vnspoj.github.io/wiki/string/rabin-karp.html String Hashing //vnspoj.github.io/wiki/string/string-hashing.html Suffix Array //vnspoj.github.io/wiki/string/suffix-array.html Suffix Automaton //vnspoj.github.io/wiki/string/suffix-automaton.html Suffix tree. Ukkonen's algorithm //vnspoj.github.io/wiki/string/suffix-tree-ukkonen.html Z-function and its calculation //vnspoj.github.io/wiki/string/z-function.html Binary Exponentiation | Luỹ thừa nhị phân | 🇻🇳 //vnspoj.github.io/wikivn/algebra/binary-exp.html Modular Inverse | Nghịch đảo module | 🇻🇳 //vnspoj.github.io/wikivn/algebra/module-inverse.html Euler's totient function | Hàm phi Euler | 🇻🇳 //vnspoj.github.io/wikivn/algebra/phi-function.html Sieve of Eratosthenes | Sàng Eratosthenes | 🇻🇳 //vnspoj.github.io/wikivn/algebra/sieve-of-eratosthenes.html Breadth First Search (BFS) | 🇻🇳 //vnspoj.github.io/wikivn/graph/breadth-first-search.html Depth First Search (DFS) | 🇻🇳 //vnspoj.github.io/wikivn/graph/depth-first-search.html Dijkstra Algorithm | Tìm đường đi ngắn nhất | 🇻🇳 //vnspoj.github.io/wikivn/graph/dijkstra.html Dijkstra on sparse graphs | Tìm đường đi ngắn nhất | 🇻🇳 //vnspoj.github.io/wikivn/graph/dijkstra_sparse.html Lowest Common Ancestor - Binary Lifting (Cha chung gần nhất) | 🇻🇳 //vnspoj.github.io/wikivn/graph/lca_binary_lifting.html Rabin-Karp Algorithm | 🇻🇳 //vnspoj.github.io/wikivn/string/rabin-karp.html String Hashing | 🇻🇳 //vnspoj.github.io/wikivn/string/string-hashing.html Z-function | 🇻🇳 //vnspoj.github.io/wikivn/string/z-function.html