Follow me on Twitter Visit my personal website
Thanks to Evan Putra Limanto for contributing additional problems.
ABCDEF binary search
ACMAKER dp hard
ACODE dp medium
AE00 adhoc
AE1B adhoc
AE2A dp trick
AIBOHP dp medium
AIRLINES dp for one case matrix expo for other
ALICECUB dp or bfs precomputation
ALL bfs nice hard implementation
ANARC05B dp binary search
ANARC05H dp
ANARC07C simulation medium
ANARC07G dp
ANARC08B ad-hoc stupid
ANARC08E dp
ANARC08F shortest path
ANARC08G elementary graph theory
ANARC08H josephsus problem
ANARC09A dp
ANARC09B adhoc
ANARC09C number theory easy
ANARC09F geometry
ANDROUND segment tree
ANTTT geometry connected components
ARDA1 kmp
ARITH2 adhoc
ASSIGN dp
BABTWR easy LIS
BABY hard DP, bitmasks
BINSTIRL simple math
BOBALLS2 math
BRCKTS segment tree
BROKEN adhoc
BRPAR math
BRTREE simulation tricky
BYTESE2 adhoc
CDOWN recursion
CERC07B bitmasks same as DFLOOR
CERC07K bfs nice state
CFRAC2 adhoc
CHASE adhoc
CHMAZE BFS nice state
CISTFILL binary search
CLEANRBT BFS then DP, hard
CLIQSEP simple adhoc
COCONUTS maxflow, mincut
COMPANY graph theory remove transitions
COUNT dp hard
COURIER dp bitmasks
CPRIME number theory
CPU adhoc
CRSCNTRY dp very easy
CSUBSEQS dp medium
CTGAME dp
CUBERT newton raphson or binary search
CVJETICI bit
CYLINDER simple math
CZ_PROB1 dp easy
DEADFR adhoc
DEPEND topological sort
DEPOSIT math
DFLOOR same as CERC07B
DISTANCE adhoc
DIV2 number theory
DIV number theory
DIVSUM number theory precomputation
DOORSPEN geometry convex hull
DP dp
DQUERY segment tree merge sort
DSUBSEQ dp
EASYPROB adhoc
EDIST dp easy
EDS adhoc
ENCONDIN adhoc
ETF number theory
EXPEDI greedy data-structure
FACT0 number theory sieve
FACT1 pollard rho
FACVSPOW simple math binary search
FAKETSP beginner rubbish
FAMILYP simulation
FCANDY DP weak test data assume difference doesnt exceed 200
FCTRL2 simple math
FENCE1 simple math
FERT21_0 adhoc big integer easy
FINDPRM number theory sieve dp binary search adhoc
FNRANK number theory inclusion exclusion
FP dp greedy
FPOLICE dp
FRACTION farey sequences
FREQUENT segment trees
FRQPRIME number theory binary search math
FSEATS dp
FUNPROB math
GCDEX number theory
GEM simulation
GEOPROB geometry bigint easy
GEORGE dijkstra nice
GNY07C adhoc
GNY07D adhoc
GNY07F adhoc
GNY07H dp bitmask tricky harder version of BYTESH1, M3TILE
GNYR09F dp easy
GOALFR geometry easy
GORELIAN bfs hard on implementation
GS gaussian elimination
GSS1 segment tree easy
GSS3 segment tree easy
HAMSTER1 math trigonometry ternary search
HANGOVER simple math
HEAPULM sorting recursion easy segment trees
HELLOKIT beginner easy
HELPBOB dp bitmask
HELPR2D2 segment tree data-structure
HERDING bfs
HIKE bfs
HIST2 dp bitmask
HISTOGRA adhoc
HS08FOUR matrix expo hard
HS08PAUL number theory easy
IMAGE flood fill add up 4 - neighbours for each cell
IM maxflow
IMPORT floyd warshall
INCARDS bfs
INCPOWK number theory adhoc easy
INCSEQ dp + BIT
INTEGER1 binary search
INTERVA2 sorting datastructure bit
INUMBER bfs
INVCNT bit or merge sort
INVENT disjoint sets adhoc
JANE bfs medium
JEDNAKOS dp
JOCHEF dp
JRIDE adhoc
KGSS segment tree
KPMATRIX dp BIT hard
KPPOLY geometry ternary search
KSEQ math
LAGRANGE adhoc
LCMSUM number theory
LEGO sparse graphs co-ordinate compression connected components
LIFEGAME matrix exponentiation
LIM gaussian elimination
LINES math adhoc
LSORT dp bit
M00PAIR dp
M3TILE dp bitmask harder version of BYTESH1
MARBLES adhoc
MARTIAN dp hard
MATSUM 2D BIT
MAWORK bfs good state
MAXSUMSQ adhoc data-structure
MB1 adhoc number theory
MBEEWALK dp different dx, dy
MBIPALIN adhoc
MBLAST dp easy
MCHAOS bit
MCIRGAME big int dp catalan numbers google it
MCOINS very easy DP
MCONVERT big integer
MDIGITS adhoc
MELE3 dijkstra
MENU medium dp
MEOWIST beginner easy sorting
MFISH dp hard
MIB rank of a permutation
MICEMAZE dijkstra / bfs
MINVEST dp knapsack medium
MIXTURES medium dp, see matrix chain multiplication CLRS
MKBUDGET easy dp
MKJUMPS backtracking
MKLABELS math
MKMONEY adhoc
MKPALS adhoc
MKTHNUM segment tree merge sort
MKUHAR simple math binary search hard
MKWAVES brute force
MLAND kruskals ternary search
MLASERP BFS normal
MMASS adhoc string parsin
MMATRIX brute force
MMAXPER dp easy
MMINPAID dp / bfs bitmask
MNERED dp
MOBIVINA maxflow, mincut
MONODIG bfs hard
MONONUM dp
MORSE dp medium
MOVIE math
MPILOT dp easy
MPOLY geometry ternary search
MREPLBRC dp v.hard
MSAFE adhoc data-structure
MSE06H BIT easy
MSE08G adhoc precomputation
MSE08H math
MSKYCODE squarefree numbers inclusion-exclusion
MSTRING dp medium
MTOTALF maxflow easy
MUL2COM big integer
MYSTIC math dp
MZVRK adhoc easy
NDIVPHI math number theory
NETADMIN maxflow
NG0FRCTN adhoc
NGM2 number theory inclusion exclusion
NGON dp
NHAY KMP
NICEDAY segment tree
NOCHANGE dp hard
NOTATRI binary search
NUMQDW matrix exponentiation
ODDDIV number theory precomputation fast IO
ONEZERO bfs simple
ORDERS bit
PA06ANT graph theory matrix exponentiation
PAIRGRPH brute force
PARADOX graph theory adhoc
PARTIT dp easy
PARTPALI dp
PARTY dp easy
PATHEADS concept of bucket sort and sieve
PATULJCI binary search random
PDECODE permutation exponentiation
PERIOD KMP
PERMUT1 dp
PFDEP topological sort
PHIDIAS dp easy
PHONELST sorting
PHONY number theory
PIE binary search easy
PIGBANK dp easy ugly optimisations needed
PIZZALOC bitmasks easy
PLHOP matrix exponentiation
PON miller rabin primality testing
POTHOLE bfs topological sort
PRHYME tries
PRIME1 number theory
PRO set
PT07X dp on tree
PYRA adhoc graph theory
QCJ2 dp
QUEEN bfs hard
QUERYSTR prefix table
QUEST4 matching
RACETIME adhoc data-structure
RAIN3 dp easy
RAINBOW dp knapsack on components easy
RATING bit
REC big integer math
RELINETS brute force disjoint sets
REMGAME recursion memoisation easy weak test data
RENT dp binary search to convert n^2 to nlogn
RESN04 adhoc math
RIGHTTRI binary search
RLM beginner easy rubbish
ROADNET beginner easy
ROBBERY2 math adhoc
ROCK easy dp
RRSCHED datastructure BIT efficient simulation
SAMER08A 3 dijkstras basic graph theory
SAMER08C dp medium
SAMER08D dp hard
SAMER08E beginner easy
SAMER08F beginner easy
SAMER08G beginner easy
SCALE brute force binary search
SCAVHUNT beginner easy
SCUBADIV dp easy
SEQ5 adhoc data-structure
SEQ6 math
SEQ matrix exponentiation recurrence
SERVICE dp
SETNJA adhoc biginteger
SHPATH dijkstra
SOLIT bfs hard
SQFREE number theory sieve hard inclusion exclusion
SQRBR dp easy
SSHUFFLE dp medium
STABARDS matching
STABLEMP as name suggests
STREET dp hard
SUBS binary search
SUBSEQ simple datastructure
SUBSUMS bitmasks binary search
SUMFOUR binary search easy
SVADA binary search hard
SWTHIN adhoc math
TAXI matching maxflow
TEM dp
TEMPTISL dp easy
TETRAVEX brute force adhoc
THREECOL dp
TOURIST dp hard
TPERML unranking a permutation
TRAFFICN dijkstra easy basic graph theory
TREE1 big int math
TREE combinatrics recursion dp/memoisation big integer
TRGRID adhoc
TRIP dp, efficient reconstruction
TRSTAGE dijkstra bitmasks medium
TRT dp
TTTABLE adhoc
TUTMRBL easy number theory
TWINSNOW
UCI2009B number theory easy
UCI2009D backtracking
UJ easy bigint math
UPSUB dp LIS
VBOSS dp hard sorting
VGCD big integer adhoc
VMILI geometry convex hull
VOCV dp on tree, harder version of PT07X
VONNY backtracking
WEIRDFN data-structure
WIJGT geometry dfs
WORMS dp big integer
WSCIPHER adhoc
XOINC dp
YAPP adhoc
YODA dp easy
YODANESS bit or segment tree or merge sort
ANGELS Bipartite Matching
CATTLEB Computational Geometry, Physics
DISJPATH Maximum Flow
GUESSING Binary Search
MTREE dp on tree
PALIN Adhoc
SUBST1 Suffix Arrays
ARRANGE Sorting
DISQUERY Lowest Common Ancestor
MATCHING Maximum Matching
TREASURY dp on tree, bignum
BOOKS1 Binary Search
CNTTREE dp on tree
DISUBSTR Suffix Arrays
MATGAME Grundy numbers
MUDDY Maximum Matching
PLD Suffix Arrays, Manacher's
TWENDS dp
BOTTOM Strongly Connected Components
CORNET Disjoint Set Data Structure
EPALIN KMP, Manacher's
MDOLLS Greedy
QTREE2 Lowest Common Ancestor
TWOPATHS dp on tree
BUILDING Line Sweep
CPCRC1C Simple dp
FASTFLOW Maximum Flow
MROADS Binary search
SCITIES Hungarian Algorithm
CATM BFS
CTRICK Segment Tree
GREED Minimum Cost Maximum Flow
MSE06I Minimum Cost Maximum Flow
NUMOFPAL Suffix Arrays, Manacher's
SHOP2 Maximum Flow
ABA12C dp
ACQUIRE dp convex hull trick
ACTIV dp, binary search
ADDREV ad hoc
ADFRUITS dp lcs, backtracking
AEROLITE dp
AGGRCOW binary search
AKVQLD03 binary indexed tree
ALIEN sliding window
ALLIZWEL dfs
AMR10G ad hoc
AMR11E sieve, math
AMR12D ad hoc
APIO10A dp convex hull trick
APS sieve
ARRAYSUB rmq
ATOMS simple math, biginteger
BADXOR dp
BANKROB maxflow
BAT1 dp
BAT2 dp
BAT3 dp
BAT4 dp
BCAKE dp max 2d range sum
BENEFACT dfs, longest path
BISHOPS simple math, biginteger
BLOPER greedy
BLOPER2 binary search, meet in the middle, bitmasks
BORW dp
BRDGHRD binary indexed tree
BRIDGE binary indexed tree
BRKSTRNG knuth's optimization
BUGLIFE dfs
BUSYMAN greedy, interval scheduling
BWIDOW ad hoc
BYTESM2 dp
CADYDIST ad hoc
CAGES hard ad hoc
CAM5 dfs
CANDY ad hoc
CANDY3 ad hoc
CAPCITY strongly connected components
CBANK math
CDC12_H segment tree
CERC07S treap with implicit keys
CLOPPAIR geometry, line sweep
CNTPRIME segment tree
COD1 ad hoc
CODERE3 dp lis, lds
CODESPTB inversion count
CODFURY sliding window
COINS dp
COLORSEG dp
COMBAT binary indexed tree
COURAGE segment tree
CRAN02 ad hoc, math
CRAN04 binary search
CRYPTO trivia problem, bigint
CSHOWB ad hoc
CSTREET mst
CTOI09_1 binary search, bfs
CUBEFR sieve
CUBES ad hoc
DAVIDG mst
DCEPC11B math
DCEPC12E ad hoc, matrix update operations
DCEPC206 binary indexed tree
DCEPC501 dp
DCEPCA03 math, euler totient function
DCOWS dp
DICT trie
DIEHARD dp
DYNACON1 link cut tree
EC_CONB ad hoc
EC_ESTA online median finding
EC_MODE mst
EC_P tarjan
EDIT dp edit distance with modifications
EIGHTS ad hoc
EKO binary search
ELEVTRBL bfs
EMTY2 ad hoc
ENIGMATH easy math
EXPLOSN dp on tree
FACEFRND ad hoc
FANCY math
FARIDA dp
FARMER ad hoc
FASHION ad hoc
FCTRL math
FIBOSUM matrix exponentiation
FLWRS dp, formula
FONTSIZE binary search, math
FOXLINGS disjoint set
FREQ2 sqrt decomposition, ad hoc
FRND ad hoc
FRNDCIRC disjoint set
GCJ082A dp, backtracking
GCPC11J dfs, longest path
GERGOVIA greedy
GIVEAWAY balanced binary search tree, segment tree
GLJIVE ad hoc
GNYR04C dp
GONE digit dp
GOODA tarjan
GOODB math, euler
GOODG dp convex hull trick
GRASSPLA heavy light decomposition
GSHOP ad hoc
GSS4 segment tree
GUANGGUN math
HACKRNDM binary search
HAROWS ad hoc
HAYBALE bit
HG math, sieve
HIGHWAYS mst
HILO segment tree
HOMO ad hoc
HORRIBLE binary indexed tree
HOTELS sliding window
HPYNOS ad hoc
ICPC12C ad hoc
IITKWPCA ad hoc
IITKWPCB ad hoc
IITKWPCE ad hoc, strings
IITKWPCO ad hoc
IITWPC4D binary indexed tree
IITWPC4E segment tree, line sweep
IITWPC4I disjoint set
IITWPC4J dp
INGRED dp bitmask
INS14C ad hoc, greedy
INS14K ad hoc
IOIPALIN dp lcs
ITRIX12E matrix exponentiation
IWGBS dp, biginteger
JNEXT ad hoc
JULKA biginteger
KFSTB dfs, finding number of paths
KOILINE binary indexed tree
KOIREP sliding window
KOSARE dp hard
KOZE bfs
KRECT dp, bit manipulation
KSMALL ad hoc
LABYR1 dfs
LARSUBP binary indexed tree
LASTDIG ad hoc
LASTDIG2 ad hoc, biginteger
LCA lowest common ancestor
LCPC12F ad hoc
LCS suffix array
LITE segment tree
LKS dp
LOOPEXP math, probability
LOPOV ad hoc
LQDCANDY ad hoc
LUCIFER digit dp
MAIN111 sieve, math
MAIN112 dp bitmask
MAIN72 dp
MAKEMAZE bfs
MAXWOODS dp
MAY99_2 ad hoc
MAY99_4 dp
MBALL dp
MC dp
MCAMP greedy
MFLAR10 ad hoc
MIDO ad hoc
MINNUM biginteger
MISERMAN dp
MKEQUAL ad hoc
MLK ad hoc
MON2012 dynamic segment tree
MRECAMAN ad hoc
MSCHED greedy
MSTRMND interactive problem
MULTQ3 segment tree
MYQ1 ad hoc
NAKANJ bfs
NATALIAG bfs
NAUGHTY ad hoc
NFACTOR sieve
NFURY dp
NITK06 ad hoc
NITTROAD reverse mst
NR1 math, biginteger
NR2 bit manipulation
NSTEPS ad hoc
NY10A ad hoc
NY10E dp
OLOLO good ad hoc
ONP infix to postfix
OPCPIZZA binary search
ORDERSET binary indexed tree, balanced binary search tree
PARKET1 math
PAUWS dp
PEBBLE ad hoc, game
PERMUT2 ad hoc
PIHU1 binary search
POSTERS ad hoc
PPATH bfs
PT07Y dfs
PT07Z dfs
PTIME sieve, math
PTRELIC interactive problem, binary search
PUCMM210 ad hoc
QN01 ad hoc
QN02 bit manipulation
QTREE heavy light decomposition
RANGESUM binary indexed tree
RAONE digit dp
REPAIR1 dp, probability, math
RIOI_2_3 bfs
RKS ad hoc
RLTOUR ad hoc
RMID binary indexed tree
RMID2 binary indexed tree
ROHAAN floyd warshal
ROOTCIPH ad hoc
RPLB dp
RPLC ad hoc
RPLD ad hoc
RPLN rmq
SAFECRAC dp, dfs
SALMAN dfs, segment tree
SBANK ad hoc
SEGSQRSS segment tree
SKY binary search, bfs
SLIDE dp
SMARIO bfs, bitmask
SNGINT greedy
SOLDIERS biginteger
SPCQ ad hoc
SPCS ad hoc
SPCU ad hoc
SPEC_SET ad hoc
SSEQ binary indexed tree, binary search
STAMPS ad hoc
STPAR ad hoc
SUBMERGE tarjan
SUBSN binary search, strings
SUBXOR trie
SUMITR dp
SUMSUM segment tree
TAP2012D trie
TAP2013C dp, dfs
TBATTLE sieve, sliding window
TEAM2 ad hoc
TEMPLEQ binary indexed tree, binary search
TESSER kmp
TEST ad hoc
TETRAHRD matrix exponentiation
THEATRE ad hoc
THRBL binary indexed tree
TIEROPE dp
TIPTOP ad hoc
TOANDFRO ad hoc
TRAVERSE dp
TREEORD dfs
TRICOUNT ad hoc
TRIGALGE math, binary search
TRIKA dp
TROOPS recursion
TSHOW1 math, strings
UCV2013A math, exponentiation by squaring
UCV2013H bfs
UCV2013J ad hoc
UCV2013K dp bitmask
ULM09 mst
UOFTAB ad hoc
UOFTAE dp
UOFTCC sliding window
UOFTCD ad hoc
UOFTCE bfs
UOFTCF dp
UPDATEIT bit
VACATION floyd warshal
VILLAGES ad hoc, bit manipulation
WACHOVIA dp knapsack
WAL3A ad hoc
WATER bfs
WILLITST ad hoc
WINDVANE segment tree
WPC4F dp
WPC5I sieve, math
WTK josephus
XMEN dp lis
YELBRICK ad hoc, math
ZIGZAG ad hoc