cp-problems icon indicating copy to clipboard operation
cp-problems copied to clipboard

Published 20 hours ago • verified publisher icon crazymerlyn
→

Metadata

A list of interesting competitive programming problems

aho

automat

belman-ford

bfs

bfs-grid

big

binary_search

  • [ ] http://codeforces.com/contest/920/problem/G (5) //[NICE][MATH][IE]

  • [ ] http://codeforces.com/contest/140/problem/C (4) //[NICE][GREEDY]

  • [ ] http://codeforces.com/contest/898/problem/E (4) //[NICE][SIMPLE][PREPROCESS]

  • [ ] http://codeforces.com/contest/888/problem/C (3) //Can be done without BS

  • [ ] http://codeforces.com/contest/68/problem/B (3) //[EASY][DOUBLE]

  • [ ] http://codeforces.com/contest/42/problem/A (2) //Or simple math

  • [ ] http://codeforces.com/contest/883/problem/I (4) //[NICE][SET][2Pointers]

  • [ ] http://codeforces.com/contest/51/problem/C (4) //[NICE][GREEDY-CHECK]

  • [ ] http://codeforces.com/contest/729/problem/C 3

  • [ ] http://codeforces.com/contest/714/problem/D 8

  • [ ] 13150 (UVA) 4

  • [ ] http://codeforces.com/contest/749/problem/D 5

  • [ ] 11692 (UVA) 4

  • [ ] 11516 (UVA) 3

  • [ ] http://codeforces.com/contest/760/problem/B 3

  • [ ] http://codeforces.com/contest/675/problem/D 4 //dunno — solvable with treap

  • [ ] http://www.spoj.com/problems/NDS/ 4 //BS over LIS

  • [ ] http://www.spoj.com/problems/VECTAR4/ 3

  • [ ] http://codeforces.com/contest/767/problem/D 4 //NICE

  • [ ] http://codeforces.com/contest/627/problem/D (7) //with dp — NICE

  • [ ] http://codeforces.com/contest/779/problem/D (3) //NICE + EASY

  • [ ] http://www.spoj.com/problems/CNTINDX/ (4) //Map+BS === OK

  • [ ] 13177 UVA (3) //BS over answer == OK

  • [ ] http://codeforces.com/contest/801/problem/C (3) //BS + SUM -EASY

  • [ ] http://codeforces.com/contest/803/problem/D (3) //BS by answer

  • [ ] http://codeforces.com/contest/807/problem/C (3) //Or math

  • [ ] http://codeforces.com/contest/818/problem/F (4) //NICE — Live VS Clique

  • [ ] http://codeforces.com/contest/845/problem/E (5) //VERY NICE — min(X,Y) .. add time, repeat

  • [ ] http://www.spoj.com/problems/MATHLOVE/ (2) //BS + Gaus (or otter ways)

  • [ ] http://www.spoj.com/problems/SABBIRGAME/ (3) //Binary search over answer ::max(0,ANS)

  • [ ] http://codeforces.com/contest/846/problem/D (4) //BS+Precalculation OR 2D-RMQ

  • [ ] http://www.spoj.com/problems/RPLC/ (3) //Classical

  • [ ] http://www.spoj.com/problems/TRIGALGE/ (2) //On doubles — simple function given

  • [ ] http://www.spoj.com/problems/ABA12E/ (4) //VERY NICE — BS on answer + 2Pointers

  • [ ] http://codeforces.com/contest/847/problem/E (4) //NICE: Back+Front OR Front+Back

  • [ ] http://www.spoj.com/problems/MAIN8_C/ (3) //Classical — simultion over array

  • [ ] http://www.spoj.com/problems/FUNFACT/ (4) //VERY NICE — Sterling Approximation

  • [ ] http://codeforces.com/contest/16/problem/C (3) //[or math][simple formula check]

  • [ ] http://codeforces.com/contest/21/problem/C (3) //[NICE][prefix-sum+lower_bound]

  • [ ] http://codeforces.com/contest/24/problem/E (5) //[doubles]

  • [ ] http://codeforces.com/contest/875/problem/E (6) //VERY NICE [BS][Keep possible places]

bits

  • [ ] http://codeforces.com/contest/879/problem/C (3) //[NICE] one of each operation is enough

  • [ ] http://codeforces.com/contest/92/problem/B (2) //Bit addition/shifting (but big number)

  • [ ] http://codeforces.com/contest/907/problem/C (3) //Nice but ugly statement: sets

  • [ ] 11659 UVA (4)

  • [ ] 11535 UVA (4)

  • [ ] http://codeforces.com/contest/779/problem/E (5) //NICE + Parsing

  • [ ] http://www.spoj.com/problems/EC_CONB/ (1) //reverse numbers

  • [ ] http://codeforces.com/contest/769/problem/D (4) //freq + brute-force

  • [ ] http://www.spoj.com/problems/HAP01/ (2) //builtin_popcount

  • [ ] http://codeforces.com/contest/862/problem/C (3) //VERY NICE — Random works well

  • [ ] http://www.spoj.com/problems/KOMPICI/ (4) //NICE — Bitmask over digits

bitset

bridges

brute-force

  • [ ] http://codeforces.com/gym/101806/problem/X (6) //[VERY NICE][DFS][IFS][OBSERVATION]

  • [ ] 8259 — High Score LA //[VERY NICE][TS works too] add only low number to minimum (NOT WORKING?)

  • [ ] http://codeforces.com/contest/922/problem/B (2) //Test all pairs — observe 3rd

  • [ ] http://codeforces.com/contest/919/problem/B (1) //Simply simulate

  • [ ] http://codeforces.com/contest/146/problem/B (2) //Test all bigger numbers

  • [ ] http://codeforces.com/contest/911/problem/B (1)

  • [ ] 7692 — Square Deal (4) //Permutations+Swap

  • [ ] http://codeforces.com/contest/907/problem/A (2) //try all triples 0→ 200

  • [ ] http://codeforces.com/contest/124/problem/B (3) //next-permutation

  • [ ] http://codeforces.com/contest/910/problem/C (3) //Next-permutation

  • [ ] http://codeforces.com/contest/898/problem/B (2) //Try all possibilities

  • [ ] 6160 — Countdown (5) //[NICE][DFS][EFFICIENT?]

  • [ ] http://codeforces.com/contest/122/problem/C (3) //Just around 2^10 lucky [RECURSION]

  • [ ] 7899 — Mr. Panda and Strips (4) //Weak test-cases

  • [ ] 7671 What a Beautiful Lake (2) //Try up/down from every node

  • [ ] http://codeforces.com/contest/110/problem/A (1) //4 or 7

  • [ ] http://codeforces.com/contest/106/problem/B (2) //Cycles -_-

  • [ ] http://codeforces.com/contest/895/problem/A (2) //All segments [in circle]

  • [ ] http://codeforces.com/contest/893/problem/B (2) //Try each divisor

  • [ ] http://codeforces.com/contest/894/problem/A (1) //3-cycles

  • [ ] http://codeforces.com/contest/892/problem/C (3) //Try to find "1" ASAP

  • [ ] http://codeforces.com/contest/102/problem/A (2) //Iterate over all triples

  • [ ] http://codeforces.com/contest/96/problem/B (2) //Check all

  • [ ] http://codeforces.com/contest/94/problem/B (1) //3cycles

  • [ ] http://codeforces.com/contest/887/problem/B (3) //Test all numbers

  • [ ] http://codeforces.com/gym/101597/problem/A (4) //[MATH][MODULO][SIMULATION]

  • [ ] http://codeforces.com/contest/68/problem/C (5) //[VERY NICE][RECURSION][MAX COST MIN FLOW]

  • [ ] http://codeforces.com/contest/68/problem/A (1) //Simple simulation

  • [ ] http://codeforces.com/contest/66/problem/B (2) //Test always whole platform

  • [ ] http://codeforces.com/contest/879/problem/C (3) //[NICE] one of each operation is enough

  • [ ] http://codeforces.com/contest/46/problem/C (2) //[2pointers][N^2 works too]

  • [ ] http://codeforces.com/contest/47/problem/D (4) //[Implementation][DFS]

  • [ ] http://codeforces.com/contest/51/problem/D (4) //Check all/check without 1s/2nd

  • [ ] http://code-festival-2017-qualc.contest.atcoder.jp/tasks/code_festival_2017_qualc_b (2)

  • [ ] http://codeforces.com/contest/53/problem/B (3) //at most 60 possibilities

  • [ ] http://codeforces.com/contest/55/problem/B (3) //Try all permutations & possibilities [NICE]

  • [ ] http://codeforces.com/contest/877/problem/B (3) //NICE [N^2][PrefixSum]

  • [ ] LA 6623 — Battle for Silver (3) //4 for-cycles inside ~ K4 search

  • [ ] UVA 12169 (2)

  • [ ] http://codeforces.com/contest/725/problem/C 4

  • [ ] http://codeforces.com/contest/725/problem/E 6

  • [ ] http://codeforces.com/contest/724/problem/B 3

  • [ ] 11961 UVA (2)

  • [ ] 11898 UVA (4)

  • [ ] 11659 UVA (4)

  • [ ] http://codeforces.com/contest/753/problem/C 7

  • [ ] 11699 UVA (4)

  • [ ] 11548 UVA (3)

  • [ ] 11471 UVA (5) //With dynamic programming

  • [ ] http://codeforces.com/contest/698/problem/D 8 //with geometry

  • [ ] http://codeforces.com/gym/101840 F //[NICE][BS][DISTANCE]

  • [ ] 11206 UVA (6) //4^20 (but somehow passes)

  • [ ] 11214 UVA (6) //Úvaha + pruning

  • [ ] 11127 UVA (4) //Simple dfs [just realize you can do so]

  • [ ] http://www.spoj.com/problems/BOKAM143SOU/ (3) //just implement for-cycles

  • [ ] http://www.spoj.com/problems/BLOPER/ (4) dfs with little pruning

  • [ ] 13173 UVA (3) //just brute-force + branching

  • [ ] http://codeforces.com/contest/799/problem/D (4) //VERY NICE [only top 34 needed] — trick with 2 [~20]

  • [ ] 10890 UVA (4) //Simple brute-force times out, but with simple pruning AC (answer detection

  • [ ] http://codeforces.com/contest/813/problem/B (3) //All*All (BF) care for overflow! NICE & EASY

  • [ ] http://codeforces.com/contest/817/problem/C (3) //Check S+Constant (NICE!)

  • [ ] 10732 UVA (2) //Brute-force passes .. just don't trust them O(N^2)

  • [ ] 10748 UVA (5) //VERY Nice (knights have K^2 moves not 8^K)

  • [ ] http://codeforces.com/contest/818/problem/D (4) //NICE for each 'A' check all remaining (max SQRT)

  • [ ] http://codeforces.com/contest/834/problem/E (5) //NICE — hard to imple: all 11122...999 OK

  • [ ] http://www.spoj.com/problems/JHAGIRLS/ (4) //Efficient — or store output in array

  • [ ] http://codeforces.com/contest/846/problem/B (3) //Brute-force

  • [ ] http://www.spoj.com/problems/ALONE/ (4) //Generate everything <10^15 [NICE]

  • [ ] http://codeforces.com/contest/861/problem/B (3) //Check all floor-sizes

  • [ ] http://www.spoj.com/problems/RRANGE/ (3) //Compare all queries agains all updates + GAUSS

  • [ ] http://codeforces.com/contest/598/problem/B (3) //Treap works too ;-)

  • [ ] http://www.spoj.com/problems/AMR10I/ (4) //Can be solved with brute-force with dp

  • [ ] http://codeforces.com/contest/868/problem/C (4) //Brute-force (fixet at most 6 each bits)

  • [ ] http://codeforces.com/contest/868/problem/D (5) //NICE: Maximal K is low (I assumed 15)

  • [ ] http://codeforces.com/contest/31/problem/C (2) //LOW-Constaints: N^2

  • [ ] http://codeforces.com/contest/32/problem/D (3) //Simply try all possibilities

  • [ ] http://codeforces.com/contest/876/problem/C (3) //Try N and ~100 lower

  • [ ] http://codeforces.com/contest/44/problem/B (2) //N^2 works fine

centroid

  • [ ] http://codeforces.com/gym/101840 E //NICE

  • [ ] DCP-176: Motku2 [DevSkills]

  • [ ] http://codeforces.com/contest/715/problem/C 9

  • [ ] http://codeforces.com/contest/741/problem/D 8

  • [ ] 13164 UVA (7)

  • [ ] http://codeforces.com/contest/752/problem/F 5

  • [ ] http://codeforces.com/contest/766/problem/E 6

  • [ ] http://codeforces.com/contest/833/problem/D 7 //Very nice — hard (thinking + imple) + FW

  • [ ] http://www.spoj.com/problems/HOLI/ (4) //VERY NICE: 2*Distances from centroids

coloring

  • [ ] http://codeforces.com/contest/741/problem/C 6

  • [ ] 11331 UVA (4)

  • [ ] http://codeforces.com/contest/664/problem/D 4

combinatorics

constructive

  • [ ] http://codeforces.com/contest/922/problem/F (6) //[NICE][MATH][GREEDY]

  • [ ] http://codeforces.com/contest/916/problem/C (3) //Graph construction

  • [ ] http://codeforces.com/contest/148/problem/B (3) //[SIMULATION](math or bs)

  • [ ] http://codeforces.com/contest/909/problem/F (6) //[VERY NICE][BITS]

  • [ ] http://codeforces.com/contest/141/problem/C (4) //[NICE][BRUTE-FORCE]

  • [ ] http://codeforces.com/contest/907/problem/D (5) //[VERY NICE][RANDOM]

  • [ ] http://codeforces.com/contest/124/problem/C (3) //[NICE][SIEVE]

  • [ ] http://codeforces.com/contest/125/problem/C (4) //[NICE][C(N,2)]

  • [ ] http://codeforces.com/contest/902/problem/C (4) //[NICE]//Tree isomorphism

  • [ ] http://codeforces.com/contest/112/problem/C (3) //[GREEDY]//Max + 1s

  • [ ] http://codeforces.com/contest/110/problem/B (2) //Easy modulo

  • [ ] http://codeforces.com/contest/894/problem/C (3) //[VERY NICE] //AiAiGCD

  • [ ] http://codeforces.com/contest/97/problem/B (4) //NICE — Walls in middles [D&C]

  • [ ] http://codeforces.com/contest/85/problem/A (3) //MODULO / SHIFT

  • [ ] http://codeforces.com/contest/81/problem/D (3) //NICE — MAX(N/2) — even/odd

  • [ ] http://codeforces.com/contest/63/problem/D (3) //NICE[GO BY LINES][4 WAYS B/D ODD/EVEN]

  • [ ] http://codeforces.com/contest/42/problem/C (4) //Constructive works too but random is fine :)

  • [ ] http://codeforces.com/contest/43/problem/D (3) //NICE — Easy to see [implementation]

  • [ ] http://codeforces.com/contest/53/problem/C (2) //EASY [B/E Alternate]

  • [ ] http://codeforces.com/contest/877/problem/C (3) //NICE 3*Alternative

  • [ ] http://codeforces.com/contest/802/problem/H (6) //We can do "N+k" by adding a letter p+k*x+u+xx

  • [ ] http://codeforces.com/contest/12/problem/E (5) //g[i][j]=1+(i+j)%(N-1) [+/-]

  • [ ] http://codeforces.com/contest/22/problem/C (4) //Start and then clique without v (+ random)

  • [ ] http://codeforces.com/contest/26/problem/C (5) //make EvenEven: do by 22 fields

  • [ ] http://codeforces.com/contest/41/problem/E (4) //[NICE][CN/2,N/2]

  • [ ] http://codeforces.com/contest/78/problem/B (2) //NICE — last 3 and then rest in modulo

  • [ ] http://codeforces.com/contest/109/problem/D (5) //[NICE][BACK-POINTERS][SIMULATION][SORT]

dfs

  • [ ] http://www.spoj.com/problems/ADASEA/

  • [ ] https://www.urionlinejudge.com.br/judge/en/problems/view/2732 (3) //Easy flood

  • [ ] http://codeforces.com/contest/920/problem/E (5) //[NICE][DFS][SET] //Or clever random

  • [ ] http://codeforces.com/contest/915/problem/D (4) //[VERY NICE][CYCLES DETECTION (ORIENTED)]

  • [ ] http://www.spoj.com/problems/CTTC/ (3) //[EASY][GRAPH-RECONSTRUCTION]

  • [ ] 7951 — Islands (3) //[NICE]Flood-Fill

  • [ ] http://codeforces.com/contest/901/problem/D (7) //Observations / Tree reduction

  • [ ] http://codeforces.com/contest/902/problem/B (3) //No dfs needed

  • [ ] http://codeforces.com/gym/101630 {C}(4) //[NICE][SCC]

  • [ ] http://codeforces.com/gym/101620 {J}(4) //DFS + multiples of divisors

  • [ ] http://codeforces.com/contest/120/problem/F (3) //Width of tree

  • [ ] 7606 — Percolation (3) //Dfs on grid [EASY]

  • [ ] http://codeforces.com/contest/116/problem/C (2) //[DEPTH]

  • [ ] 8080 — Christmas Tree (3) //[SIMPLE][NICE]

  • [ ] 6584 — Escape (8) //[VERY VERY VERY NICE][COMPRESSION][MERGING] //Hard but I recommend this one!!

  • [ ] 6590 Digraphs (4) //[VERY NICE][CYCLES][DP][IDEA]

  • [ ] http://codeforces.com/contest/893/problem/C (3) //Minimum from each connected component

  • [ ] http://codeforces.com/contest/884/problem/C (3) //[EASY][PERMUTATIONS][SORTING]

  • [ ] http://codeforces.com/contest/883/problem/G (4) //Greedy picking

  • [ ] http://codeforces.com/contest/60/problem/B (3) //3D Flood-Fill [NICE][EASY]

  • [ ] http://codeforces.com/contest/60/problem/C (4) //[VERY NICE][BF]//Not many real possibilities

  • [ ] https://devskill.com/CodingProblems/ViewProblem/3

  • [ ] https://devskill.com/CodingProblems/ViewProblem/17

  • [ ] https://devskill.com/CodingProblems/ViewProblem/118 //Kind-of

  • [ ] 657 — The die is cast [UVA]

  • [ ] 12186 UVA (3)

  • [ ] http://codeforces.com/contest/734/problem/E (5)

  • [ ] http://codeforces.com/contest/727/problem/A (3)

  • [ ] http://codeforces.com/contest/723/problem/E (6)

  • [ ] http://codeforces.com/contest/709/problem/E (6)

  • [ ] http://codeforces.com/contest/710/problem/E (4)

  • [ ] http://codeforces.com/contest/758/problem/E (8)

  • [ ] 11323 UVA (5)

  • [ ] http://codeforces.com/contest/760/problem/B (3)

  • [ ] http://codeforces.com/contest/761/problem/E (6)

  • [ ] http://codeforces.com/contest/638/problem/B (3) //connect cons. letters

  • [ ] http://codeforces.com/contest/638/problem/C (4) //greedy idea — easy

  • [ ] http://codeforces.com/contest/638/problem/D (5) //spec-DAG articulatin

  • [ ] http://codeforces.com/contest/767/problem/C (4)

  • [ ] http://codeforces.com/contest/781/problem/C (5)

  • [ ] http://codeforces.com/contest/794/problem/D (5) //NICE! Right done dfs

  • [ ] http://codeforces.com/contest/802/problem/K (5) //Slightly DP-like (NICE) TREE

  • [ ] http://codeforces.com/contest/813/problem/C (3) //Simply 2 DFS: NICE + EASY

  • [ ] http://codeforces.com/contest/841/problem/D (4) //DFS while tracking "next"

  • [ ] http://codeforces.com/contest/845/problem/G (5) //Keep track of cycles

  • [ ] http://codeforces.com/contest/844/problem/E (5) //Post-Order → line, Connect i → N-2: star

  • [ ] http://www.spoj.com/problems/CAC/ (5) //VERY NICE! — Find all cycles in cactus

  • [ ] http://codeforces.com/contest/849/problem/C (3) //State search by gauss

  • [ ] http://codeforces.com/contest/846/problem/E (5) //NICE: DFS + some overflow logic

  • [ ] http://www.spoj.com/problems/KOZE/ (3) //NICE: Floods

  • [ ] http://www.spoj.com/problems/RIOI_2_3/ (4) //DFS /OR/ BFS /OR/ DSU [NICE][EASY][BF]

  • [ ] http://www.spoj.com/problems/MAKEMAZE/ (3) //EASY — Simple dfs on grid

  • [ ] http://codeforces.com/contest/861/problem/F (5) //VERY NICE: Modify dfs tree so it remains connected

  • [ ] http://www.spoj.com/problems/GHOSTS/ (3) //NICE — must remain dag after each QR

  • [ ] http://www.spoj.com/problems/AMR10J/ (5) //VERY NICE! — DFS+DP [DAG with cycles]

  • [ ] http://codeforces.com/contest/24/problem/A (2)//NICE [DFS-ON-CYCLE]

  • [ ] http://codeforces.com/contest/29/problem/C (3) //Find begining/end of line (graph)

  • [ ] http://codeforces.com/contest/29/problem/D (4) //Tree [implementation][simulation]

digits

dijkstra

  • [ ] http://www.spoj.com/problems/ADATRIP/

  • [ ] http://codeforces.com/gym/101666 D //[NICE]

  • [ ] http://codeforces.com/contest/144/problem/D (4) //[VERY NICE][IFS]

  • [ ] http://www.spoj.com/problems/ADRABR/ (3) //Classical dijkstra — bad statement

  • [ ] http://codeforces.com/contest/141/problem/D (5) //[NICE]Many Conditions

  • [ ] 6583 Subway (5) //[NICE]//Not exactly dijkstra by slightly similar [IMPLEMENTATION]

  • [ ] 3850 [LA]

  • [ ] Gym 100625D [2013 Benelux Algorithm Programming Contest (BAPC 13)]

  • [ ] UVA 12950

  • [ ] Gym 100753A [2015 German Collegiate Programming Contest (GCPC 15) + POI 10-T3]

  • [ ] UVA 13030

  • [ ] UVA 1027

  • [ ] UVA 11377

  • [ ] http://codeforces.com/problemset/problem/843/D

  • [ ] 11813 UVA

  • [ ] Gym 101242B [2016 ACM-ICPC World Finals] //+DP

  • [ ] Gym 100923B [2015 ACM National Contest Romania — Round 1]

  • [ ] UVA 11833

  • [ ] http://www.spoj.com/problems/EZDIJKST/en/

  • [ ] LightOJ 1019

  • [ ] UVA 13010 //+TS

  • [ ] 2819 [LA]

  • [ ] UVA 12144

  • [ ] http://codeforces.com/contest/716/problem/D 7

  • [ ] 12047 UVA 4

  • [ ] 11514 UVA 4

  • [ ] http://codeforces.com/contest/757/problem/F 7

  • [ ] 11338 UVA (4)

  • [ ] 11374 UVA (4)

  • [ ] 11097 UVA (4) //Divide to N*1000 nodes and go!

  • [ ] 13172 UVA (5) //6*DJ per query + permutations

  • [ ] 10816 UVA (4) //Easy Linear-Search by answer + DJ with path

  • [ ] http://codeforces.com/contest/827/problem/F 7 //Very nice — Even&Odd

  • [ ] http://www.spoj.com/problems/DELIVER/ (5) //Normalize coordinates + Optimalize

  • [ ] http://www.spoj.com/problems/CCHESS/ (4) //Dijkstra as knight

divide_conquer

divisors

dp

dsu

  • [ ] http://www.spoj.com/problems/ADABRANC/

  • [ ] http://codeforces.com/contest/915/problem/F (6) //[VERY NICE][SORTING]

  • [ ] http://codeforces.com/contest/141/problem/E (6) //[NICE][SPANNIG TREE]

  • [ ] 7903 — Pandaria (7) //[VERY NICE][DSU][SORTING][MERGE][DFS]

  • [ ] http://codeforces.com/contest/110/problem/E (4) //[NICE][COMBINATORICS][TREE]

  • [ ] http://codeforces.com/contest/90/problem/E (5) //[NICE][DSU-LIKE-LINKS][SIMULATION]

  • [ ] http://codeforces.com/contest/87/problem/D (5) //[VERY NICE][SORTING][COMPRES][DFS]

  • [ ] http://codeforces.com/contest/884/problem/E (5) //[VERY NICE][MEMORY SPARSE]

  • [ ] http://codeforces.com/contest/60/problem/D (6) //[NICE][Pythagorean Triples][Gen over max!]

  • [ ] UVA 10947

  • [ ] UVA 12363

  • [ ] LA 3833

  • [ ] http://codeforces.com/problemset/problem/742/D //+DP

  • [ ] UVA 10178

  • [ ] http://codeforces.com/contest/723/problem/F 7

  • [ ] 13153 UVA (5)

  • [ ] 13169 UVA (3)

  • [ ] 11987 UVA (3)

  • [ ] 11474 UVA (4)

  • [ ] http://www.spoj.com/problems/BTCODE_G/

  • [ ] http://codeforces.com/problemset/problem/691/D

  • [ ] Gym 101174K [2016-2017 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2016)]

  • [ ] UVA 10583

  • [ ] LightOJ 1003

  • [ ] http://codeforces.com/problemset/problem/731/C

  • [ ] UVA 793

  • [ ] UVA 11966

  • [ ] https://www.codechef.com/problems/COZIC

  • [ ] 3939 [LA]

  • [ ] UVA 11503

  • [ ] http://codeforces.com/problemset/problem/755/C

  • [ ] UVA 1395

  • [ ] http://codeforces.com/contest/687/problem/D 6

  • [ ] http://codeforces.com/contest/680/problem/E 7 //+precalculation/brute force

  • [ ] http://codeforces.com/contest/766/problem/D 5

  • [ ] http://www.spoj.com/problems/LEXSTR/ (3) //Nice na stringu

  • [ ] http://codeforces.com/contest/805/problem/C 3 //NICE (dijkstra like :P)

  • [ ] http://www.spoj.com/problems/IITKWPCI/ (3) //VERY NICE

  • [ ] http://www.spoj.com/problems/FRNDCIRC (3) //Classical DSU (NICE for practice)

  • [ ] http://www.spoj.com/problems/FOXLINGS/ (3) Easy — just renumbering

  • [ ] http://www.spoj.com/problems/NITTROAD/ (4) //Process from back

  • [ ] http://www.spoj.com/problems/SHAHBG/ (2) //DSU not needes (simulated by array)

  • [ ] http://codeforces.com/contest/598/problem/D (3) //Can be solved with DFS too

  • [ ] http://codeforces.com/contest/9/problem/E (4) //Making one big cycle

  • [ ] http://codeforces.com/contest/25/problem/D (4) //Could be done linear too

  • [ ] http://codeforces.com/contest/28/problem/B (4) //NICE [imho bad statement]

  • [ ] http://codeforces.com/contest/876/problem/D (4) //DSU adjacent + visited

  • [ ] http://codeforces.com/contest/875/problem/F (6) //NICE — Maximum cactus-forest [kruskal-like]

euler_function

euler_tour

  • [ ] http://codeforces.com/gym/101650 I //[NICE][GRAPHS]// Theory is useful

  • [ ] 13246 — Chained Words (4) //[NICE][LEXICOGRAPHICAL]

  • [ ] UVA 10735

  • [ ] http://codeforces.com/contest/789/problem/D //Adj EG + Self/everything

  • [ ] http://codeforces.com/contest/21/problem/D (5) //[NICE][EulerTour+DP]

  • [ ] http://codeforces.com/contest/36/problem/E (6) //VERY NICE [4odd is hardest]

factorization

fenwick

fft

flow

  • [ ] http://www.spoj.com/problems/FASTFLOW/en/ //Raw (no sauce)

  • [ ] http://codeforces.com/contest/78/problem/E (5) //NICE [Matching-like][+BFS]

  • [ ] 4322 — Destroying the bus stations (Live Archive)

  • [ ] 11380 — Down Went The Titanic (UVA) //Interesting grid problem

  • [ ] 6395 — Surely You Congest (LA) //VERY NICE [slightly advanced]

  • [ ] 7204 — Blood groups (LA)

  • [ ] http://codeforces.com/gym/100963 (Flame of Nucleus — F)

  • [ ] 11167 — Monkeys in the Emei Mountain //Also harder (imho)

  • [ ] http://codeforces.com/problemset/problem/653/D (+BS)

  • [ ] 13000 — VIP Treatment (+BS)

  • [ ] 1242 — Necklace

  • [ ] https://www.deadline24.pl/assets/problemsets/dl24.elim.2017.B.en.pdf (DEADLINE 24 problem — not sure if it can be submited :O)

  • [ ] 3487 — Duopoly (Near matching)

  • [ ] http://codeforces.com/problemset/problem/727/D

  • [ ] http://codeforces.com/problemset/problem/704/D [Also advanced]

  • [ ] 5418 — A Plug for UNIX (LA)

  • [ ] 4957 — Fake scoreboard (LA) //If I remember well, other solutions was also possible

  • [ ] 1155 — Power Transmission (LOJ) //(classical)

  • [ ] https://www.codechef.com/problems/ROBOTDAG //Ford-Fukherson

  • [ ] 10804 — Gopher Strategy (UVA)

  • [ ] 11506 — Angry Programmer (UVA) //Nodes division

  • [ ] 10511 — Councilling (UVA)

  • [ ] 563 — Crimewave

  • [ ] 1306 — The K-League (UVA)

  • [ ] 1345 — Jamie's Contact Groups

  • [ ] 10092 — The Problem with the Problem Setter

  • [ ] Problem B. Roller Coaster Scheduling (GCJ — 2017)

  • [ ] 259 — Software Allocation (UVA)

  • [ ] 5905 — Pool construction (LA) //Imho harder

  • [ ] 10480 — Sabotage

  • [ ] http://codeforces.com/contest/808/problem/F 6 //NICE — nontrivial (max matching with bigger flows)

  • [ ] http://codeforces.com/contest/847/problem/J 6 //Probably not flows — matching-like

flow-matching-like

  • [ ] http://www.spoj.com/problems/ADAHOSE/ [DUAL-GRAPH]

  • [ ] http://codeforces.com/contest/903/problem/G (6) //[VERY NICE][SEG-TREE][CUT]

  • [ ] 3837 [LA] //Stable Marriage

  • [ ] UVA 1175 //Stable Marriage

  • [ ] 11594 — All Pairs Maximum Flow (UVA)

  • [ ] http://www.spoj.com/problems/ADABLOOM/ //Maximum matching in general graph

  • [ ] 11439 — Maximizing the ICPC //Maximum matching in general graph

  • [ ] 1376 — Animal Run //Max flow on planar graph (Dual == shortest path over edges)

  • [ ] 10989 — Bomb, Divide and Conquer //Stoer-Wagner — global cut

floyd-warshall

  • [ ] 10724 UVA

  • [ ] UVA 117

  • [ ] http://codeforces.com/problemset/problem/21/D

  • [ ] UVA 1198

  • [ ] LightOJ 1086 //+DP

  • [ ] http://www.spoj.com/problems/INGRED/ //+DP

  • [ ] UVA 10048

  • [ ] UVA 125

  • [ ] Gym 101223C [2017 Facebook Hacker Cup, Round 1] //+DP

  • [ ] LightOJ 1221

  • [ ] UVA 423

  • [ ] UVA 12179 //+DP

  • [ ] UVA 1416

  • [ ] UVA 1233

  • [ ] UVA 10793

  • [ ] 10099 UVA

  • [ ] UVA 869

  • [ ] LightOJ 1174

  • [ ] http://www.spoj.com/problems/ARBITRAG/ //Other algos shall work too

  • [ ] 13211 UVA (5) //NICE — FW adding states

  • [ ] http://www.spoj.com/problems/ROHAAN/ (3) //Classical

  • [ ] http://codeforces.com/contest/25/problem/C (4) //Adding new edges .. need FW principal

  • [ ] http://codeforces.com/contest/33/problem/B (3) //NICE [dijkstra could work too]

friedvaldAlgorithm

game_theory

gauss

  • [ ] 12910 — Snakes and Ladders [UVA]

  • [ ] UVA 10828

  • [ ] http://codeforces.com/gym/100923/problem/C

  • [ ] 4963 [LA]

  • [ ] UVA 12849

  • [ ] Gym 100962A [2015-2016 Petrozavodsk Winter Training Camp, Moscow SU Trinity Contest][NICE]

  • [ ] UVA 10109 [NICE][HARD-WORK]

geometry

  • [ ] http://www.spoj.com/problems/ADAPICK/

  • [ ] http://www.spoj.com/problems/ADAKOHL/

  • [ ] http://codeforces.com/gym/101808/problem/E (5)

  • [ ] http://codeforces.com/gym/101808/problem/A (2)

  • [ ] http://codeforces.com/gym/101666 A

  • [ ] http://codeforces.com/gym/101726/problem/J (5) //[NICE][INTERSECTION][DS]

  • [ ] http://codeforces.com/gym/101650 F //Polygons + circles

  • [ ] http://codeforces.com/gym/101650 H //A few if's

  • [ ] http://codeforces.com/contest/908/problem/C (3)

  • [ ] http://codeforces.com/contest/140/problem/A (3) //Circles around bigger circle

  • [ ] http://codeforces.com/contest/136/problem/D (4) //+Brute-Force

  • [ ] http://codeforces.com/contest/127/problem/A (1) //Points distance

  • [ ] http://codeforces.com/gym/101597/problem/B (3) //Simply brute-force just the closest to points

  • [ ] http://codeforces.com/contest/70/problem/D (5) //Dynamic Convex Hull

  • [ ] https://icpc.kattis.com/problems/airport //Proposed by tautsjasiunsas

  • [ ] https://www.hackerrank.com/contests/world-codesprint-7/challenges/elastic-rope/problem

  • [ ] https://devskill.com/CodingProblems/ViewProblem/20 [EASY]

  • [ ] UVA 10321 //Polygon intersection

  • [ ] UVA 11265 //Polygon point +/-

  • [ ] UVA 13112 //Polygon

  • [ ] 10907 UVA [Area of polygon from a point]

  • [ ] 3378 — Swamp Things [LA] — Maximum points on line

  • [ ] UVA 11768 //Discrete points

  • [ ] 2542 [LA] //Arc size [formula]

  • [ ] UVA 1571 //As below [easier]

  • [ ] https://www.codechef.com/problems/ALLPOLY //[NICE] Point seeing polygon

  • [ ] http://www.spoj.com/problems/IITKWPCL/ //Point distance

  • [ ] UVA 11281 //circle~triangle

  • [ ] UVA 12921 //circle reconstruction

  • [ ] UVA 190 //circle from 3 points

  • [ ] UVA 12240 //pts>circle

  • [ ] UVA 438 //circle pt

  • [ ] LightOJ 1018 //Minimum # of lines through all pts [VERY NICE]

  • [ ] UVA 11008 //Similar as above

  • [ ] UVA 12830 //Biggest rectangle without points inside

  • [ ] UVA 11012 //Most distant points

  • [ ] UVA 1683 //Closest points

  • [ ] UVA 12389 //3D MH Closest Points

  • [ ] http://www.spoj.com/problems/AMR12C/ //Pt closest to all other points

  • [ ] http://www.spoj.com/problems/CLOPPAIR/ //Closest pair of points

  • [ ] UVA 10678 //Circles intersection

  • [ ] http://codeforces.com/problemset/problem/600/D //Circles intersection

  • [ ] LightOJ 1118 //Circles intersection

  • [ ] http://www.spoj.com/problems/CERC07C/en/ //Bounding circle

  • [ ] UVA-10005 //Bounding circle

  • [ ] 2407 [LA] //Bounding Sphere

  • [ ] LightOJ 1120 //Rectangle's Union

  • [ ] LightOJ 1130 //Circle x Rectangle intersection

  • [ ] UVA 11177 //Circle x Convex Polygon

  • [ ] http://codeforces.com/problemset/problem/610/D //Lines intersections (axes parallel)

  • [ ] 6263 [LA] //Pt in areas

  • [ ] LightOJ 1058 //# parallelograma

  • [ ] UVA 12931 //Common area of polygons

  • [ ] UVA 10301 //Intersecting circles

  • [ ] UVA 453 //Circles intersection

  • [ ] http://codeforces.com/problemset/problem/681/E //Circles intersection

  • [ ] UVA 920 //Lines intersecion (etc..)

  • [ ] UVA 12556

  • [ ] http://codeforces.com/problemset/problem/793/C //Intersection ans similar

  • [ ] UVA 11343 //Intersection of segments

  • [ ] UVA 866 //Intersection of segments

  • [ ] Gym 100190I [2011 ACM-ICPC East Central North America (ECNA 2011)] //Segment intersection

  • [ ] http://codeforces.com/gym/100917/problem/K

  • [ ] UVA 11686 //Segment intersection

  • [ ] LightOJ 1388

  • [ ] UVA 833 //Segment intersection

  • [ ] LightOJ 1196 //Points sides

  • [ ] UVA 10167 //Points sides

  • [ ] UVA 12818 //Arc & Point distance

  • [ ] http://www.spoj.com/problems/SICRANO/ //Point-line distance

  • [ ] http://codeforces.com/problemset/problem/614/C //Point-line distance

  • [ ] UVA 13117 //Point-line distance

  • [ ] UVA 12483 //Point-line distance

  • [ ] UVA 12173 //Point-line distance

  • [ ] UVA 10075 //Point distance on sphere

  • [ ] https://www.hackerrank.com/contests/booking-hackathon/challenges/nearby-attractions/problem //Pt sphr

  • [ ] UVA 535 //Point distance on sphere

  • [ ] UVA 10897 //Sphere tavelling

  • [ ] UVA 11817 //Sphere travelling

  • [ ] UVA 10316 //Sphere travelling

  • [ ] UVA 1469 //Fractions distance 3D

  • [ ] 11930

  • [ ] 12173 UVA 3

  • [ ] 12194 UVA 4

  • [ ] 11894 UVA 3

  • [ ] 11769 UVA 7

  • [ ] 11665 UVA 5

  • [ ] 11509 UVA 4

  • [ ] 11355 UVA 5

  • [ ] 11265 UVA 6 //Nice one | polygon — cut/pt-check/area

  • [ ] 11123 UVA 4 //Counting trapezoids

  • [ ] 11177 UVA 6 //BS+Polygon/Circle intersection

  • [ ] 11186 UVA 3

  • [ ] 11008 UVA 5 //with DP → #intersected triangles

  • [ ] 11012 UVA 5 //Nejvzdálenější body (Manhatton 3D)

  • [ ] 11072 UVA 4 //Points v poly gonu

  • [ ] http://codeforces.com/problemset/problem/682/E 6 (biggest triangle)

  • [ ] http://codeforces.com/contest/672/problem/C 4 //easy — just think it up

  • [ ] http://codeforces.com/contest/667/problem/A 2 //vzorecky

  • [ ] http://codeforces.com/contest/793/problem/C 5 //EASY but beware of epsilons (NICE)

  • [ ] http://codeforces.com/contest/794/problem/B 2 //Can be done with BS

  • [ ] http://codeforces.com/contest/814/problem/D 5 //+DP on trees (NICE — but low geom.)

  • [ ] 10750 UVA 3 //Closest points — try all pairs

  • [ ] http://codeforces.com/contest/820/problem/B 3 //Polygon angle find!

  • [ ] 13213 UVA 5 //VERY NICE — Voronoi diagram (low constraints so not actually needed)

  • [ ] 13215 UVA 3 //EASY — Sum areas and find side lengths

  • [ ] http://www.spoj.com/problems/IITKWPCC/ (5) //VERY VERY NICE — Nqrt(N)log(N)

  • [ ] http://www.spoj.com/problems/NNS/ (5) Closest points query [fake geometry] {__128}[NICE]

  • [ ] http://codeforces.com/contest/849/problem/B (3) //X-Product — side

  • [ ] http://www.spoj.com/problems/AMR12C/ (5) //Point closest to all other points (with speed)

  • [ ] http://www.spoj.com/problems/SICRANO/ (3) //Line-Point distance

  • [ ] http://www.spoj.com/problems/VCIRCLES/ (5) //Heavy geometrical ****

  • [ ] http://www.spoj.com/problems/CIRU/ (5) //Same as above [yet bigger constraints]

  • [ ] http://www.spoj.com/problems/THREETW1/ (4) //Fermat point search

  • [ ] http://www.spoj.com/problems/CLOPPAIR/ (4) //Closest pair of points

  • [ ] http://www.spoj.com/problems/MAXLN/ (2) //Some basic (4*r^2+.25)

  • [ ] http://www.spoj.com/problems/KOLICA/ (4) //VERY NICE [nasty iff party]

  • [ ] http://codeforces.com/contest/598/problem/C (4) //NICE ~ Precision! [ld]

  • [ ] http://codeforces.com/contest/18/problem/A (2) //EASY&FINE: Pythagoreas

  • [ ] http://codeforces.com/contest/40/problem/A (2) //[EASY][DISTANCE]

graph

  • [ ] http://codeforces.com/gym/101666 H //[VERY NICE][GEOMETRY][DSU][EULER][PLANAR]

  • [ ] 2827 [LA] //3Coloring

  • [ ] 2243 [LA] //3Coloring

  • [ ] 5603 [LA] //Coloring

  • [ ] UVA 1658 //Shortest paths

  • [ ] UVA 12821 //Shortest paths

  • [ ] http://codeforces.com/contest/27/problem/D (5)

  • [ ] 11387 (UVA) 4

  • [ ] http://www.spoj.com/problems/VFRIEND2/ (5) //Graph possible check

  • [ ] http://codeforces.com/contest/859/problem/E (4) //VERY NICE (2 cases: CYCLE [x2] / TREE [x(Size+1)]

  • [ ] http://codeforces.com/contest/847/problem/C (2) //Forest making Easy&Nice

  • [ ] http://codeforces.com/contest/863/problem/C (3) //Cycle in states

greedy

  • [ ] http://codeforces.com/gym/101666 (4) //[NICE][QUEUE][DFS][EVENTS]

  • [ ] http://codeforces.com/gym/101806/problem/T (5) //[NICE][SEGMENT TREE][SORTING]

  • [ ] http://codeforces.com/contest/916/problem/B (3) //[BITS] FIRST & LAST

  • [ ] http://codeforces.com/contest/913/problem/C (3) //+[DP]

  • [ ] http://codeforces.com/contest/146/problem/D (4) //[NICE][CONSTRUCTION]

  • [ ] http://codeforces.com/contest/146/problem/C (3) //[EASY][NICE][TWO-CASES]

  • [ ] http://codeforces.com/contest/139/problem/D (4) //Muchas cases

  • [ ] 7887 — Back to the Future (4) //[NICE][2*HEAP]

  • [ ] http://codeforces.com/contest/910/problem/A (2) //DP works too

  • [ ] http://codeforces.com/contest/125/problem/D (4) //Limited possibilities

  • [ ] http://codeforces.com/contest/902/problem/A (2) //Just keep last

  • [ ] http://codeforces.com/contest/898/problem/D (4) //[NICE][FENWICK/OR/PREFIX]

  • [ ] http://codeforces.com/contest/118/problem/C (4) //[NICE] — Try each digit (iterate in waves)

  • [ ] 7706 — Pokemons (2) //Sweep and keep maximum

  • [ ] http://codeforces.com/contest/893/problem/D (4) //[NICE][SWEEP][MAXIMUM] — pay max when have to

  • [ ] http://codeforces.com/contest/892/problem/B (2) //Sweep from back

  • [ ] http://codeforces.com/contest/102/problem/C (3) //sort by frequency

  • [ ] https://devskill.com/CodingProblems/ViewProblem/419 (2) //Sweep from back

  • [ ] http://codeforces.com/contest/890/problem/C (3) //frequence

  • [ ] http://codeforces.com/contest/890/problem/B (2) //[EASY][REVERSE]

  • [ ] http://codeforces.com/contest/888/problem/B (2) //Equalize U/D and L/R

  • [ ] http://codeforces.com/gym/101597/problem/J (4) //[NICE][SWEEP]

  • [ ] http://codeforces.com/contest/76/problem/B (4) //[NICE][MATCHING-LIKE][2PTRS]

  • [ ] http://codeforces.com/contest/73/problem/B (4) //[IMPLEMENTATION][SORTING]

  • [ ] http://codeforces.com/contest/883/problem/K (4) //Nice — Two sweeps

  • [ ] http://codeforces.com/contest/49/problem/D (3) //NICE — 1010101 OR 0101010 [haming]

  • [ ] http://codeforces.com/contest/58/problem/C (4) //NICE — group trees by slopes

  • [ ] http://codeforces.com/contest/729/problem/D 3

  • [ ] http://codeforces.com/contest/729/problem/E 4

  • [ ] http://codeforces.com/contest/725/problem/D 4

  • [ ] http://codeforces.com/contest/725/problem/F 9

  • [ ] http://codeforces.com/contest/732/problem/E 5

  • [ ] http://codeforces.com/contest/727/problem/F 6

  • [ ] http://codeforces.com/contest/724/problem/D 5

  • [ ] http://codeforces.com/contest/723/problem/C 4

  • [ ] http://codeforces.com/contest/719/problem/B 2

  • [ ] http://codeforces.com/contest/712/problem/C 3

  • [ ] 13152 UVA (4)

  • [ ] http://codeforces.com/contest/746/problem/E 5

  • [ ] http://codeforces.com/contest/746/problem/D 3

  • [ ] http://codeforces.com/contest/749/problem/C 3

  • [ ] 11737 UVA (3)

  • [ ] 11786 UVA (4)

  • [ ] 11630 UVA (5)

  • [ ] 11563 UVA (4)

  • [ ] 11491 UVA (4)

  • [ ] 11330 UVA (3)

  • [ ] 11089 UVA (2)

  • [ ] http://codeforces.com/contest/884/problem/D (4) //PQ or Sort

  • [ ] http://www.spoj.com/problems/SQRMINSUM/ 3 //solve-able in O(N+M)-arrayqueue

  • [ ] http://www.spoj.com/problems/MSCHED/ 3 //sweep from back

  • [ ] http://www.spoj.com/status/ns=18780683 4 //all perm + A<B<C works

  • [ ] http://www.spoj.com/problems/NINJA7/ (3) //sort by diff

  • [ ] http://www.spoj.com/problems/NINJA2/ (4) //try all possib. (26)

  • [ ] http://codeforces.com/contest/767/problem/E (6)

  • [ ] http://codeforces.com/contest/637/problem/B (3) //NICE pro prvaky

  • [ ] http://codeforces.com/contest/777/problem/B (3) // -||-

  • [ ] http://codeforces.com/contest/777/problem/D (3) //just go from end

  • [ ] http://codeforces.com/contest/779/problem/C (3) //NICE pro prváky

  • [ ] http://www.spoj.com/problems/SPCU/ (2) //Easy — zamysleni (max int = index)

  • [ ] http://www.spoj.com/problems/LOPOV/ (4) //sort + queue (or just queue) NICE

  • [ ] http://codeforces.com/contest/792/problem/E (5) //T%S<=T/S + check proper

  • [ ] http://codeforces.com/contest/807/problem/E (5) //NICE — put asice P2 / rest — greedy from small

  • [ ] http://codeforces.com/contest/799/problem/E (5) //Many queues — but NICE

  • [ ] http://codeforces.com/contest/808/problem/C (3) //EASY

  • [ ] http://codeforces.com/contest/802/problem/B (4) //Priority by "next"

  • [ ] 10850 UVA (4) //Queue a brute-force

  • [ ] http://codeforces.com/contest/813/problem/A (1) //Zahrivacka pro prvaky

  • [ ] 10716 UVA (4) //NICE — always find closest pair

  • [ ] http://codeforces.com/contest/816/problem/C (3) //NICE — greater<lesser side

  • [ ] http://codeforces.com/contest/820/problem/D (5) //VERY NICE — O(N) -~- 5 events per number

  • [ ] http://codeforces.com/contest/818/problem/B (2) //Zahrivacka pro prvaky

  • [ ] http://codeforces.com/contest/822/problem/C (4) //Almost classical Sort+Queue

  • [ ] http://codeforces.com/contest/825/problem/C (2) //Nice & Easy

  • [ ] http://codeforces.com/contest/825/problem/D (3) //Update by modulo

  • [ ] http://codeforces.com/contest/835/problem/B (2) // Zahhrivacka pro prvaky

  • [ ] http://codeforces.com/contest/839/problem/B (3) //Nasty iffs — yet nice excersize

  • [ ] http://www.spoj.com/problems/PCPC12I/ (4) //Swipe MINIMUM from left/right [10^6-A[i] trick]

  • [ ] http://www.spoj.com/problems/AMR12I/ (3) //NICE a) MAX_SEG>=K b) (SEG_SIZE-1)/K+1

  • [ ] http://www.spoj.com/problems/BUSYMAN/ (2) //NICE&EASY — Sort + keep minimum

  • [ ] http://codeforces.com/contest/861/problem/C (3) //2+ but not same

  • [ ] http://www.spoj.com/problems/WORKB/ (3) //Simple "min" formula for each neighbor

  • [ ] http://codeforces.com/contest/864/problem/D (4) //VERY NICE — Frequency + unused

  • [ ] http://www.spoj.com/problems/ROADTRIP/ (4) //VERY NICE — Keeping last lesser

  • [ ] http://codeforces.com/contest/597/problem/B (3) //NICE [Classical]

  • [ ] http://www.spoj.com/problems/SHLIGHTS/ (4)

  • [ ] http://www.spoj.com/problems/MLK/ (3) //VERY NICE — Sum all prefix sums

  • [ ] http://codeforces.com/contest/867/problem/C (4) //NICE [IMPLE][2POINTERS][MID+EPS]

  • [ ] http://codeforces.com/contest/867/problem/E (5) //NICE [EASY-IMPLE][HARD-CONS]

  • [ ] http://codeforces.com/contest/18/problem/D (4) //+Big Integer

  • [ ] http://codeforces.com/contest/276/problem/D (4) //NICE — Find first mismatch bit (then 111...111)

  • [ ] http://codeforces.com/contest/3/problem/B (4) //Divide 1/2 [sort][2pointers]

  • [ ] http://codeforces.com/contest/3/problem/D (4) //?==) ..if open < 0: set max A-B to (

  • [ ] http://codeforces.com/contest/26/problem/B (4) // +1 ( | -1 ): -1, erase .. erase sum in the end

  • [ ] http://codeforces.com/contest/33/problem/A (2) //EASY [long-statement]

  • [ ] http://codeforces.com/contest/44/problem/E (2) //Try mins then try maxs

  • [ ] http://codeforces.com/contest/45/problem/D (3) //Priority-queue+'sort'

hash

  • [ ] http://www.spoj.com/problems/ADACLEAN/

  • [ ] http://codeforces.com/gym/101808/problem/B (5) //[NICE][NUMBERS]

  • [ ] http://codeforces.com/gym/101741/problem/K (5) //[NICE][SQRT][PATTERN MATCHING]

  • [ ] 7979 — Red Rover (3) //[NICE] //Many other ways to solve

  • [ ] http://codeforces.com/contest/898/problem/F (5) //[VERY NICE]//Hash by 10

  • [ ] http://codeforces.com/contest/114/problem/D (4) //[NICE] //N^2Log(N) might/might-not be OK

  • [ ] https://www.urionlinejudge.com.br/judge/en/problems/view/1503 (7) //[NICE][BS][OPTI]

  • [ ] Gym 101466E [2017 ACM-ICPC, Universidad Nacional de Colombia Programming Contest][NICE]

  • [ ] 12012 UVA 4

  • [ ] http://codeforces.com/contest/727/problem/E 7

  • [ ] http://codeforces.com/contest/718/problem/D 8

  • [ ] 11855 UVA 4

  • [ ] http://codeforces.com/contest/752/problem/D 5

  • [ ] http://codeforces.com/contest/825/problem/F 5 //String + Periods

  • [ ] http://codeforces.com/contest/835/problem/D 4 //Palindromes

  • [ ] http://www.spoj.com/problems/CF25E/ (5) //VERY NICE [IMPLE>CONCEPT]

  • [ ] http://codeforces.com/contest/7/problem/D (4) //Palindromes

  • [ ] http://codeforces.com/contest/19/problem/C (4) //[NICE]: Not a string

hull

  • [ ] http://www.spoj.com/problems/GARDENHU/en/

  • [ ] 2453 — Wall [LA]

  • [ ] UVA 13213

  • [ ] UVA 11096

  • [ ] Gym 100792G [2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest]

  • [ ] https://www.codechef.com/problems/KTHCON

  • [ ] http://codeforces.com/problemset/problem/605/C

  • [ ] UVA 218

  • [ ] UVA 11072

  • [ ] 11168 UVA

  • [ ] UVA 12307

  • [ ] Gym 100963I [2007-2008 Summer Petrozavodsk Camp, Japanese Contest, 2007-08-29]

  • [ ] UVA 11243

  • [ ] UVA 10256

  • [ ] 109 SCUD Busters

  • [ ] UVA 13024 [NICE]

  • [ ] UVA 10002

  • [ ] Gym 100886H [2015-2016 Petrozavodsk Winter Training Camp, Saratov SU Contest]

  • [ ] UVA 1139

  • [ ] UVA 681

  • [ ] UVA 811

  • [ ] https://www.codechef.com/problems/MGCHGEOM

  • [ ] UVA 11769 //3D

chess

implementation

  • [ ] http://codeforces.com/gym/101889/my H

  • [ ] http://codeforces.com/contest/934/problem/A (2)

  • [ ] http://codeforces.com/contest/922/problem/A (2) //Iff-party

  • [ ] http://codeforces.com/contest/914/problem/A (1)

  • [ ] http://codeforces.com/contest/916/problem/A (2) //Time

  • [ ] http://codeforces.com/contest/915/problem/B (2) //Formula / Iff

  • [ ] http://codeforces.com/contest/915/problem/A (1)

  • [ ] http://codeforces.com/contest/913/problem/A (1)

  • [ ] http://codeforces.com/contest/912/problem/A (2) //Easy [corner-cases]

  • [ ] http://codeforces.com/contest/146/problem/A (1)

  • [ ] http://www.spoj.com/problems/ESYR/ (1) //Bad one :/

  • [ ] http://codeforces.com/contest/908/problem/A (1)

  • [ ] http://codeforces.com/contest/147/problem/A (2) //Parsing

  • [ ] http://codeforces.com/contest/139/problem/A (1)

  • [ ] http://codeforces.com/contest/137/problem/A (1)

  • [ ] 7886 — Assigning Teams (2) //[EASY][SORTING]

  • [ ] http://codeforces.com/contest/133/problem/A (1)

  • [ ] http://codeforces.com/contest/134/problem/A (1)

  • [ ] http://codeforces.com/contest/131/problem/A (1)

  • [ ] http://codeforces.com/contest/127/problem/B (1) [EASY]

  • [ ] http://codeforces.com/contest/899/problem/B (2) //Dates

  • [ ] http://codeforces.com/contest/898/problem/C (3) //No thinking — just implementation

  • [ ] 6157 How do spiders walk on water? (4) //boring problem

  • [ ] http://codeforces.com/contest/900/problem/A (1)

  • [ ] 7613 Relative atomic mass (1)

  • [ ] http://codeforces.com/contest/122/problem/A (1) //Find all lucky

  • [ ] http://codeforces.com/contest/120/problem/B (1) //Iteration

  • [ ] http://codeforces.com/contest/120/problem/A (1) //Iff/Logic

  • [ ] http://codeforces.com/contest/118/problem/B (2) //[PRINTING]

  • [ ] http://codeforces.com/contest/108/problem/A (1) //[EASY][PRINT][TIME]

  • [ ] http://codeforces.com/contest/106/problem/A (1) //Iff-party

  • [ ] http://codeforces.com/contest/890/problem/A (1) //if or perm

  • [ ] http://codeforces.com/contest/90/problem/B (2) //No idea — just cycles

  • [ ] http://codeforces.com/contest/75/problem/A (1) //conversion

  • [ ] http://codeforces.com/contest/884/problem/B (1) //Simple sum +N-1

  • [ ] http://codeforces.com/contest/48/problem/A (1) //Very easy [fe. perm]

  • [ ] http://codeforces.com/contest/51/my (2) //Lex-lowest-string (|s|=4)

  • [ ] http://codeforces.com/contest/54/problem/A (2) //Single sweep

  • [ ] http://codeforces.com/contest/719/problem/C 3

  • [ ] http://codeforces.com/contest/747/problem/E 4

  • [ ] http://codeforces.com/contest/754/problem/C 5

  • [ ] 11482 UVA (4)

  • [ ] 11291 UVA (3)

  • [ ] 11070 UVA (5) //evaluation of expression

  • [ ] 11074 UVA (2)

  • [ ] http://codeforces.com/contest/678/problem/B 2 //calendar days

  • [ ] http://codeforces.com/contest/643/problem/A 3 //easy — just simulate

  • [ ] http://codeforces.com/contest/770/problem/D 5 //easy — but pain — draw

  • [ ] http://codeforces.com/contest/789/problem/B 3 //simulate (mby twice)

  • [ ] 13171 UVA (1)

  • [ ] 10800 UVA (3)

  • [ ] http://codeforces.com/contest/828/problem/B 2 //EASY & NICE — just analysis

  • [ ] http://codeforces.com/contest/825/problem/B 2 //EASY & NICE — Piskvorky — pro prvaky

  • [ ] http://codeforces.com/contest/837/problem/B 2 //Just implementation

  • [ ] http://codeforces.com/contest/837/problem/C 2 //Some nasty iffs

  • [ ] http://codeforces.com/contest/845/problem/B 2 //Easy pro prvaky

  • [ ] http://codeforces.com/contest/845/problem/D 3 //Iffs — folow the rules

  • [ ] http://www.spoj.com/problems/UNIHW/ 4 //NICE (but many iffs)

  • [ ] http://codeforces.com/contest/5/problem/A (2) //Parsing

  • [ ] http://codeforces.com/contest/5/problem/B (3) //Output formating

  • [ ] http://codeforces.com/contest/6/problem/B (2) //Simply check by adjancecy vector + set

  • [ ] http://codeforces.com/contest/7/problem/A (1) //Oneinteresting if

  • [ ] http://codeforces.com/contest/8/problem/B (2) //Sample vectors + set/or/array

  • [ ] http://codeforces.com/contest/12/problem/A (1) //Find mirror by middle

  • [ ] http://codeforces.com/contest/16/problem/A (1) //Easy check of chars

  • [ ] http://codeforces.com/contest/21/problem/A (2) //Easy but nasty iff imple

  • [ ] http://codeforces.com/contest/31/problem/B (2) //Boring imple

  • [ ] http://codeforces.com/contest/34/problem/C (3) //Easy string parsing

  • [ ] http://codeforces.com/contest/41/problem/C (2) //String parsing

inclusion-exclusion

interactive

  • [ ] http://codeforces.com/contest/897/problem/D (4) //NICE! Back/Front

  • [ ] http://codeforces.com/contest/727/problem/C (2)

  • [ ] http://codeforces.com/contest/810/problem/D (4) //BS * 3 (same)

  • [ ] http://codeforces.com/contest/811/problem/D (4) //BFS — easy .. some ifs

  • [ ] http://codeforces.com/contest/835/problem/E (4) //NICE! Bitsets + Detect + XOR

  • [ ] http://codeforces.com/contest/844/problem/D (5) //NICE! Randomized algo

  • [ ] http://codeforces.com/contest/862/problem/D (4) //NICE! Find first + Binary Search

  • [ ] http://codeforces.com/contest/872/problem/D (4) //NICE! [no clue why it passed]

isomorphism

josephus

KMP

lca

lcs_subsequence

lct

lis

matching

  • [ ] http://www.spoj.com/problems/ADAPATH/

  • [ ] http://www.spoj.com/problems/ADACITY/

  • [ ] http://www.spoj.com/problems/ADAPLNTS/

  • [ ] http://codeforces.com/gym/101666 E //[NICE][GEOMETRY][BINARY SEARCH][PROBABILITY]

  • [ ] http://www.spoj.com/problems/MATCHING/ //Raw (no sauce)

  • [ ] http://codeforces.com/contest/116/problem/B (3) //Low cons. Can be done without algo

  • [ ] 6234 — Tile Cut (LA)

  • [ ] 10080 — Gopher II (UVA) //Easy — sympathic

  • [ ] 11419 — SAM I AM (UVA) //Grid-Matching

  • [ ] http://codeforces.com/gym/101485 (Elementary Math — E) //Very nice principal [not that hard]

  • [ ] 3673 — Black-White Grid (UVA) //Grid

  • [ ] 12927 — Points Cover (UVA)

  • [ ] 6851 — The Programmers (LA)

  • [ ] 6887 — Book Club //NICE

  • [ ] 6571 — It Can Be Arranged

  • [ ] 12530 — Game of Tiles

  • [ ] http://codeforces.com/gym/100820 (Airport — A) //Nice one

  • [ ] http://codeforces.com/gym/100753 (Bounty Hunterr II — B) //VERY NICE — I refered multiple times to this principal

  • [ ] http://codeforces.com/gym/101408 (Cat vs Dog — C)

  • [ ] 1171 — Knights in Chessboard (II) (LOJ) //Classical chess

  • [ ] 12644 — Vocabulary

  • [ ] http://codeforces.com/gym/101047/problem/H

  • [ ] http://codeforces.com/problemset/problem/659/E

  • [ ] 12972 — Cuban Challenge (UVA)

  • [ ] 1201 — Taxi Cab Scheme (UVA)

  • [ ] 12963 — Astragalus Nitidiflorus

  • [ ] 6525 — Attacking rooks (LA)

  • [ ] 3415 — Guardian of Decency (LA)

  • [ ] 12159 — Gun Fight (UVA)

  • [ ] https://www.codechef.com/problems/CHEFYODA //Imho matching is not the crucial part here

  • [ ] 12831 — Bob the Builder

  • [ ] http://codeforces.com/problemset/problem/831/D

  • [ ] 11262 — Weird Fence

  • [ ] 12549 — Sentry Robots

  • [ ] 11138 — Nuts and Bolts

  • [ ] http://codeforces.com/contest/727/problem/D 4

  • [ ] 11985 UVA (5)

  • [ ] http://www.spoj.com/problems/AMR12A/ (5) //VERY NICE goophers + bonus

  • [ ] http://www.spoj.com/problems/NITT4/ (4) //VERY NICE [Chessboard matching]

  • [ ] http://www.spoj.com/problems/SCPC11H/ (4)//NICE — Match those which fits inside

matrix

  • [ ] 12045 UVA (4)

matrix_exponentiation

mcmf

  • [ ] http://www.spoj.com/problems/ADAGROW/

  • [ ] http://www.spoj.com/problems/ADAFEAR/

  • [ ] 13288 — Cordon Bleu (6) //[NICE][MATCHING]

  • [ ] http://codeforces.com/gym/100800 (Aqueduct Construction — A)

  • [ ] 10806 — Dijkstra, Dijkstra.

  • [ ] 12944 — Earthquake Disaster

  • [ ] 12891 — Risk of Trading

  • [ ] https://www.codechef.com/problems/HOGON

  • [ ] http://codeforces.com/contest/863/problem/F (5) //VERY NICE

  • [ ] 11613 UVA (6)

  • [ ] http://codeforces.com/contest/802/problem/C (8) //Nice but hard to see + negative

  • [ ] http://codeforces.com/contest/802/problem/N (5) //Easy but faster MCMF needed

  • [ ] http://codeforces.com/contest/818/problem/G (6) //NICE + MUCH Faster MCMF

  • [ ] http://www.spoj.com/problems/BNMT/ (7) //VERY NICE (some optimalisations needed + weird data set)

  • [ ] http://codeforces.com/contest/884/problem/F (6) //Alphabetical buckets

median

meet_in_middle

MO

next

np-hard

number_rectangle

  • [ ] UVA 10667 //Largest rectangle

  • [ ] UVA 10074 //Largest rectangle

  • [ ] UVA 836 //Largest rectangle

  • [ ] UVA 1330 //Largest rectangle

  • [ ] 12192 UVA 5

  • [ ] http://codeforces.com/contest/729/problem/B 2

  • [ ] http://codeforces.com/contest/710/problem/C 4

  • [ ] 11871 UVA 6

  • [ ] 11617 UVA (3)

  • [ ] 11573 UVA (4)

  • [ ] 11499 UVA (5)

  • [ ] 11230 UVA (4)

  • [ ] http://www.spoj.com/problems/JOCHEF/ (5) //NICE: Lagers rectange 0/1 O(N*M)

number_theory

observation

  • [ ] http://www.spoj.com/problems/ADABANKET/ //Observation (but Stoer-Wagner works too)

  • [ ] http://codeforces.com/contest/922/problem/C (3) //Note that K is always very low

  • [ ] http://codeforces.com/contest/912/problem/B (2) //Bits/XOR

  • [ ] http://codeforces.com/contest/911/problem/D (3) //[VERY NICE]

  • [ ] http://codeforces.com/contest/902/problem/E (5) //[VERY NICE] //LCT works too

  • [ ] 7589 Rearranging a Sequence (3) //Print from back and then real

  • [ ] http://codeforces.com/gym/101630 {A}(6) //[NICE][STL]

  • [ ] http://codeforces.com/contest/122/problem/B (1) //just 4 or 7

  • [ ] http://codeforces.com/contest/116/problem/E (6) //[NICE][COMBINATORICS][FIND ANY]

  • [ ] http://codeforces.com/contest/892/problem/D (4) //NICE [SORTING]

  • [ ] http://codeforces.com/contest/897/problem/E (5) //[NICE][SET] //2 will beat all

  • [ ] 7730 To begin or not to begin (3) //Parity

  • [ ] http://codeforces.com/contest/122/problem/D (4) //[NICE] Sweep /OR/ cycle

  • [ ] http://codeforces.com/contest/128/problem/D (6) //Normalize + Sweeps

oeis

offline

palindromes

patter-matching

  • [ ] 11019 UVA (5)

permutations

  • [ ] http://codeforces.com/contest/137/problem/B (1) //Frequency + size

  • [ ] http://codeforces.com/contest/136/problem/A (1) //Permutation cycles

  • [ ] http://codeforces.com/contest/844/problem/C 3 //NICE Permutations in array

  • [ ] http://codeforces.com/contest/48/problem/D (3) //NICE [frequency array]

  • [ ] http://codeforces.com/contest/56/problem/B (2) //Restore from 1 reverse [EASY]

  • [ ] http://codeforces.com/contest/122/problem/D (5) //NICE [BRUTE-FORCE]//ONLY BACK MATTERS

persistent_segment_tree

  • [ ] http://codeforces.com/contest/893/problem/F (6) //[VERY NICE][EULER TOUR]

  • [ ] http://codeforces.com/contest/813/problem/E (6) //Easy but hard data structure

preprocess

prime-count

prime-testing

probability

  • [ ] http://codeforces.com/gym/101726/problem/B (4) //[NICE][DP][BRUTE-FORCE]

  • [ ] https://www.devskill.com/CodingProblems/ViewProblem/470 (3) //Brute Force

  • [ ] 8262 — Knockout Tournament (4) [LA] //[NICE][SIMULATION] //Might not be working on LA (but on CF y)

  • [ ] http://codeforces.com/contest/912/problem/D (4) //[VERY NICE][EXPECT][DIJKSTRA]

  • [ ] http://codeforces.com/contest/908/problem/D (5) //[DP][MATH][INVERSION]

  • [ ] 7821 — Elections (4) //[EASY][DP]

  • [ ] http://codeforces.com/gym/101620 {G}(5) //[VERY NICE][DIJKSTRA][EXPECTED VALUE]

  • [ ] http://codeforces.com/contest/110/problem/D (4) //[NICE][COMBINATORICS]

  • [ ] http://codeforces.com/contest/108/problem/D (4) //[NICE][SIMPLE][COMBINATORICS]

  • [ ] 7619 — Guessing the Dice Roll (5) //[NICE][AHO][MATRIX EXPO]

  • [ ] 7998 — Election (3) //Math works too [probability][DP]

  • [ ] LightOJ 1104 //Birthday Paradox

  • [ ] Gym 101064K [2016 USP Try-outs] //Birthday Paradox

  • [ ] 11762 UVA (5)

  • [ ] 11427 UVA (5)

  • [ ] 11348 UVA (2)

  • [ ] http://codeforces.com/contest/768/problem/D (4) //With DP

  • [ ] http://www.spoj.com/problems/IITWPC4J/ (4) //with DP

  • [ ] 10828 UVA (5) //Nice problem but bad statemend: Expected value of visits MC

  • [ ] 10777 UVA (4) //NICE — yet solvable with DP

  • [ ] http://codeforces.com/contest/839/problem/C (3) //NICE & Easy => Tree

  • [ ] http://www.spoj.com/problems/ZCR/ (3) //Easy (+DP)

  • [ ] http://www.spoj.com/problems/IITKWPCN/ (2) //Easy — Odd/Eve (black balls)

  • [ ] http://codeforces.com/contest/846/problem/F (5) // Expected number of unique elements

  • [ ] http://www.spoj.com/problems/BTCODE_H/ (4) //DP (but main GROW is idea)

  • [ ] http://codeforces.com/contest/867/problem/D (5) //VERY NICE [DP]

  • [ ] http://codeforces.com/contest/24/problem/D (5) //VERY NICE [DP]+[TIME]

  • [ ] http://codeforces.com/contest/28/problem/C (4) //VERY NICE [DP]

recursion

  • [ ] 8255 — Dunglish LA //Finding all possibilities

  • [ ] http://codeforces.com/contest/915/problem/C (4) //[NICE][DP-works-too][GREEDY]

  • [ ] http://codeforces.com/contest/134/problem/B (4) //Number Theory

  • [ ] http://codeforces.com/contest/897/problem/C (4) //+Slightly [DP]

  • [ ] 6585 — Draughts (4) //[NICE][BACKTRACK][DFS]

  • [ ] http://codeforces.com/contest/68/problem/D (5) //[NICE] Keep max and kill branches

  • [ ] UVA 536 //Tree from dfs

  • [ ] UVA 12347 //BST from preorder

  • [ ] http://www.spoj.com/problems/GOC11A/ 4

  • [ ] 13170 UVA (7) //heavy implementation — but NICE!

  • [ ] 10854 UVA (3) //if/else

  • [ ] http://codeforces.com/contest/31/problem/D (4) //[NICE] Brute-force by recursion

  • [ ] http://codeforces.com/contest/36/problem/B (2) //[NICE][SIMPLE]

RMQ

rope

scc

segment_tree

sequences

  • [ ] 11885 UVA 7 //Previous problem requested for statement

  • [ ] 11522 UVA 3 //Trick — low numbers only :P

sieve

simulation

  • [ ] http://codeforces.com/gym/101650 A //[VERY NICE][TREAP][PROBABILITY]

  • [ ] http://codeforces.com/gym/101650 K //[NICE] //Perhaps weak TC

  • [ ] https://abc084.contest.atcoder.jp/tasks/abc084_c (3) //Brute-Force

  • [ ] http://codeforces.com/contest/908/problem/B (2) //[EASY][NICE]

  • [ ] http://codeforces.com/contest/141/problem/B (3) //[NICE][IF-PARTY]

  • [ ] 7921 — Anticlockwise Motion (4) //Simulate in sqrt

  • [ ] 7691 — Falling Apples (3)

  • [ ] 7977 — The Key to Cryptography (2)

  • [ ] http://codeforces.com/contest/129/problem/B (2) //Graph

  • [ ] http://codeforces.com/contest/903/problem/B (2) //[NICE]

  • [ ] http://codeforces.com/contest/120/problem/C (1)

  • [ ] http://codeforces.com/contest/118/problem/A (1)

  • [ ] 8012 — Voting Fraud (1)

  • [ ] http://codeforces.com/contest/897/problem/A (1) //BF — do as they say

  • [ ] 7985 — Bumper-to-Bumper Traffic (4) //FINE — We have whole time-lapse

  • [ ] 7988 Flow Shop (3) //Do as they say. Trivial but not bad.

  • [ ] 7703 — Reading Digits (2) //Simple simulate what they ask for

  • [ ] http://codeforces.com/contest/893/problem/A (1) //Easy but nice

  • [ ] http://codeforces.com/contest/102/problem/B (2) //Do as they write — log-convergence

  • [ ] http://codeforces.com/contest/92/problem/A (1) //Way too easy

  • [ ] http://codeforces.com/contest/88/problem/C (3) //[NUMBER THEORY]

  • [ ] http://codeforces.com/contest/84/problem/D (4) //Priority queue by min*size

  • [ ] http://codeforces.com/contest/79/problem/A (1) //Simulate rules

  • [ ] http://codeforces.com/contest/879/problem/A (1) //Iterate day-by-day

  • [ ] http://codeforces.com/contest/879/problem/B (3) //Either at most N^2 or the biggest element [NICE]

  • [ ] http://codeforces.com/contest/879/problem/D (4) //[NICE][Array elimination]

  • [ ] http://codeforces.com/contest/46/problem/A (2) //[EASY][MODULO]

  • [ ] http://codeforces.com/contest/46/problem/B (3) //[EASY][SEARCH-EACH-QUERY]

  • [ ] http://codeforces.com/contest/55/problem/A (2) //Simple (long) simulation

  • [ ] http://codeforces.com/contest/60/problem/A (1) //Moving LR bounds

  • [ ] 12187 UVA (2)

  • [ ] http://codeforces.com/contest/724/problem/C 5

  • [ ] http://codeforces.com/contest/746/problem/C 3

  • [ ] 11093 UVA (2)

  • [ ] http://codeforces.com/contest/768/problem/C (4)

  • [ ] http://www.spoj.com/problems/WRONG/ (5) //VERY NICE — precalculate from back, then go from front

  • [ ] http://codeforces.com/contest/864/problem/C (4) //Not nice — just iffs

  • [ ] http://www.spoj.com/problems/WAGE/ (3) //Simple Game Of Life Modification

  • [ ] http://codeforces.com/contest/6/problem/C (2) //Simple simulate from both sides

  • [ ] http://codeforces.com/contest/9/problem/B (2) //Simulate what is given (+ doubles)

  • [ ] http://codeforces.com/contest/11/problem/B (3) //sqrt(X) [diff must be even]

  • [ ] http://codeforces.com/contest/30/problem/A (2) //Simply simulate process [-1000→ 1000]

sorting

  • [ ] http://www.spoj.com/problems/ADATOMAT/

  • [ ] http://www.spoj.com/problems/ADAUSORT/

  • [ ] http://www.spoj.com/problems/ADACUT/

  • [ ] http://www.spoj.com/problems/ADAHLIA/

  • [ ] http://codeforces.com/gym/101726/problem/E (3) //[STRUCTURES][IMPLEMENTATION]

  • [ ] 13282 Cakey McCakeFace (3) //Brute Force

  • [ ] 8260 Installing Apps (4) //[NICE] //Sorting + some DP

  • [ ] http://codeforces.com/contest/922/problem/D (3) //[NICE][GREEDY][EASY]

  • [ ] http://codeforces.com/contest/920/problem/C (3) //[EASY] Sortable by parts

  • [ ] http://codeforces.com/contest/913/problem/D (4) //[NICE][BS][2P][FW]

  • [ ] http://codeforces.com/contest/149/problem/A (2) //Sorting|Greedy

  • [ ] http://www.spoj.com/problems/SEUG/ (2) //Bad statement

  • [ ] http://codeforces.com/contest/141/problem/A (2) //Or frequency

  • [ ] http://codeforces.com/contest/137/problem/E (4) //[NICE][PREFIX SUM MATCHING]

  • [ ] http://codeforces.com/contest/137/problem/C (4) //[NICE][FENWICK WORKS TOO]

  • [ ] http://codeforces.com/contest/136/problem/C (3) //Last to 1(2) |OR| first to INF

  • [ ] 7601 — Football (3) //Greedy

  • [ ] 7673 — What a Simple Research (2) //[EASY][IMPLE]

  • [ ] http://codeforces.com/contest/108/problem/B (2) //Easy & Adjacent

  • [ ] 8025 — Stacking Cups (2) //Sorting+input

  • [ ] http://codeforces.com/contest/892/problem/A (2) //[EASY][SUM]

  • [ ] https://www.urionlinejudge.com.br/judge/en/problems/view/2290 (3) //Sort+check [fast]

  • [ ] http://codeforces.com/contest/81/problem/C (3) //MATH[Lesser=greater][comparator]

  • [ ] http://codeforces.com/contest/53/problem/D (3) //Bubble sort

  • [ ] http://codeforces.com/contest/58/problem/D (4) //[BUCKET][GREEDY][STRING]

  • [ ] UVA 10810 //INV

  • [ ] UVA 11858 //INV

  • [ ] http://codeforces.com/problemset/problem/645/B //INV

  • [ ] UVA 10327 //INV

  • [ ] http://www.spoj.com/problems/BUBBLESORT/ //INV

  • [ ] UVA 11495 //INV [GAME]

  • [ ] http://www.spoj.com/problems/CODESPTB/ //INV

  • [ ] UVA 13212 //INV

  • [ ] http://codeforces.com/problemset/problem/749/E //INV

  • [ ] 12189 UVA (3)

  • [ ] 12196 UVA (4)

  • [ ] http://codeforces.com/contest/731/problem/D 7

  • [ ] 11925 UVA (4)

  • [ ] 11979 UVA (3)

  • [ ] http://codeforces.com/contest/747/problem/D (4)

  • [ ] 11890 UVA (4)

  • [ ] http://www.spoj.com/problems/KAOS/ (4) //INV — GOOD problem!!!!

  • [ ] http://www.spoj.com/problems/KSMALL/ (5) //fast sort /or/ quick-select

  • [ ] http://www.spoj.com/problems/RKS/ (3) //use map

  • [ ] http://www.spoj.com/problems/SPCJ/ (4) //reverse + go from back

  • [ ] http://codeforces.com/contest/785/problem/B (2) //last-first + vice versa

  • [ ] http://codeforces.com/contest/798/problem/D (4) //Take 1st then take best B of every pair (sort by A)

  • [ ] http://codeforces.com/contest/810/problem/B (2)

  • [ ] http://codeforces.com/contest/810/problem/C (3) //+Math

  • [ ] http://codeforces.com/contest/814/problem/A (1) //Pro prváky — but nice observation

  • [ ] http://codeforces.com/contest/817/problem/B (3) //Frequency of TOP 3

  • [ ] 10769 UVA (3) //Sadly N^4 passes

  • [ ] 13208 UVA (4) //Sort + Prefix Sum

  • [ ] 13212 UVA (3) //Number of inversions

  • [ ] http://codeforces.com/contest/831/problem/C (3) //NICE ~ Check all "add" against first

  • [ ] http://codeforces.com/contest/831/problem/D (4) //Can be solved with BS+Max-Match

  • [ ] http://codeforces.com/contest/841/problem/C (3) //NICE — match greatest to lowest

  • [ ] http://codeforces.com/contest/845/problem/C (2) //EASY — pro prvaky

  • [ ] http://www.spoj.com/problems/HSHW/ (4) //Test every big/low pair + big/big low/low on +/-

  • [ ] http://www.spoj.com/problems/CODESPTB/ (3) //Count inversions [BASIC]

  • [ ] http://codeforces.com/contest/863/problem/B (2) //Sort and omit 2

  • [ ] http://www.spoj.com/problems/AMR10G/ (2) //Easy yet NICE

  • [ ] http://codeforces.com/contest/12/problem/C (2) //Very simple

  • [ ] http://codeforces.com/contest/16/problem/B (1) //[EASY]

  • [ ] http://codeforces.com/contest/22/problem/D (3) //Sort by begin + sweep

  • [ ] http://codeforces.com/contest/23/problem/C (3) //Take them by pairs + add last

  • [ ] http://codeforces.com/contest/24/problem/B (3) //Simple follow the rules

  • [ ] http://codeforces.com/contest/27/problem/B (3) //Compare number of victories

  • [ ] http://codeforces.com/contest/27/problem/C (4) //[NICE] Find next bigger/lesser (sort)

spanning_tree

  • [ ] http://codeforces.com/contest/908/problem/F (5) //[VERY NICE] //Not exactly MST but similar[GREEDY]

  • [ ] http://codeforces.com/contest/125/problem/E (5) //[BS]

  • [ ] http://codeforces.com/contest/76/problem/A (4) //[VERY NICE] Sort by A and KEEP spanning + one edge

  • [ ] LA 6622 — Absurdistan Roads (4) //Plus one edge

  • [ ] UVA 12176

  • [ ] UVA 10600

  • [ ] UVA 10724

  • [ ] https://www.hackerrank.com/contests/june-world-codesprint/challenges/johnland

  • [ ] UVA 11710

  • [ ] Gym 101252C [2014-2015 CT S02E05: Codeforces Trainings Season 2 Episode 5 — 2009-2010 ACM-ICPC]

  • [ ] Gym 101047I [2015 USP Try-outs][HARD]

  • [ ] UVA 11183 [Directed]

  • [ ] LightOJ 1101

  • [ ] https://www.codechef.com/problems/CHEFELEC

  • [ ] UVA 10307

  • [ ] http://codeforces.com/problemset/problem/598/D

  • [ ] http://codeforces.com/problemset/problem/32/C

  • [ ] http://codeforces.com/problemset/problem/744/A

  • [ ] https://devskill.com/CodingProblems/ViewProblem/344

  • [ ] 908 — Re-connecting Computer Sites [UVA]

  • [ ] 1208 — Oreon [UVA]

  • [ ] 1235 — Anti Brute Force Lock [UVA]

  • [ ] 10034 — Freckles [UVA]

  • [ ] 11228 — Transportation system [UVA]

  • [ ] 11631 — Dark roads [UVA]

  • [ ] 11733 — Airports [UVA]

  • [ ] 11747 — Heavy Cycle Edges [UVA]

  • [ ] BLINNET SPOJ (3)

  • [ ] 11183 UVA (4) //Directed [need to know algo!]

  • [ ] http://www.spoj.com/problems/ULM09/ (3) //Sum-Kruskal

  • [ ] http://www.spoj.com/problems/IITKWPCG/ (4) //VERY NICE [log instead of price]

  • [ ] http://codeforces.com/contest/17/problem/B (3) //Spanning tree [no dsu]

spfa

  • [ ] LightOJ 1074

  • [ ] UVA 1171

  • [ ] UVA 11478

  • [ ] UVA 12768

  • [ ] 11478 UVA (5)

sqrt

  • [ ] http://codeforces.com/gym/101889 D //[NICE][STL]

  • [ ] http://codeforces.com/contest/916/problem/D (6) //[NICE][BS][BINARY-LIFTING]

  • [ ] 12003 UVA 7

  • [ ] 11990 UVA (5)

  • [ ] http://www.spoj.com/problems/GIVEAWAY/ (7) //SQRT + BS > [or Seg+Trie]

  • [ ] http://codeforces.com/contest/786/problem/C (5) //Nsqrn (bg) + sqrSegs (end)

  • [ ] http://codeforces.com/contest/840/problem/D (5) //NICE — Either frequent OR brute-force

  • [ ] http://codeforces.com/contest/13/problem/E //VERY NICE [SQRT-BLOCK UPDATE/JUMP]

  • [ ] http://codeforces.com/contest/85/problem/D (4) //NICE [ST shall work too]

stl

strings

suffix_array

ternary_search

  • [ ] LightOJ 1146

  • [ ] Gym 101482G [2014-2015 Northwestern European Regional Contest (NWERC 2014)]

  • [ ] Gym 101309D [2010-2011 ACM-ICPC Northeastern European Regional Contest (NEERC 10)]

  • [ ] UVA 13010 //+Dijkstra

  • [ ] 2015-2016 CTU Open Contest: Chasing the Cheetah

  • [ ] 12197 UVA (4)

  • [ ] http://www.spoj.com/problems/KOPC12A/ (4) //TS (sadly brute-force works too N^2)

topo

  • [ ] UVA 11686

  • [ ] LightOJ 1034

  • [ ] UVA 10305

  • [ ] 124 — Following Orders [UVA]

  • [ ] 200 — Rare Order [UVA]

  • [ ] 872 — Ordering [UVA]

  • [ ] 11060 — Beverages [UVA]

  • [ ] http://codeforces.com/contest/765/problem/E 5

  • [ ] http://codeforces.com/contest/770/problem/C 4 //reduce + toposort

  • [ ] http://codeforces.com/contest/825/problem/E 4 //Toposort from biggest/backward

  • [ ] http://www.spoj.com/problems/CODESPTI/ (6) //VERY NICE — Hard/Weak children

  • [ ] http://codeforces.com/contest/47/problem/B (2) //[EASY][Toposort on 3 elements]

  • [ ] http://codeforces.com/contest/909/problem/E (4) //[NICE][BFS][RECURSION]

treap

tree

  • [ ] http://www.spoj.com/problems/ADATOMEL/

  • [ ] http://codeforces.com/contest/913/problem/B (2) //Simple check

  • [ ] http://codeforces.com/contest/894/problem/D (5) //[NICE][MERGING][BINARY]

  • [ ] http://codeforces.com/contest/746/problem/G 5

  • [ ] http://codeforces.com/contest/750/problem/F 9

  • [ ] http://www.spoj.com/problems/RTREE/ 3 //longest path tree — query

  • [ ] 13175 UVA (2) //something like preorder build

  • [ ] http://codeforces.com/contest/796/problem/C (3) //Just counting — inc by at most 2

  • [ ] http://codeforces.com/contest/797/problem/D (4) //VERY NICE — sort + D&C all

  • [ ] http://codeforces.com/contest/805/problem/E (4) //NICE — Treewidth coloring (greedy)

  • [ ] http://codeforces.com/contest/828/problem/D (3) //Star construction

  • [ ] http://www.spoj.com/problems/TREEDEGREE/ (3) //Degree from euler tree

  • [ ] http://www.spoj.com/problems/UCV2013J/ (3) //Find what is leaf in Binary Tree

  • [ ] http://www.spoj.com/problems/GCPC11J/ (3) //Finding ceter

  • [ ] http://codeforces.com/contest/34/problem/D (3) //Simple reconstruction + DFS

tree-dp

trie_bit

trie_string

TSP

  • [ ] https://www.urionlinejudge.com.br/judge/en/problems/view/2810 (5) //[NICE][DOUBLE]

  • [ ] Gym 100818E [2015-2016 ACM-ICPC Southeastern European Regional Programming Contest (SEERC 2015)]

  • [ ] 3725 [LA]

  • [ ] UVA 10496

  • [ ] Gym 101020H [2015 Syrian Private Universities Collegiate Programming Contest] N!

  • [ ] LightOJ 1057

  • [ ] UVA 11643 //[NICE][BFS]

  • [ ] 3305 [LA] //On plane

  • [ ] 10937 UVA (4) //find '!' / BFS / TSP — NICE!

  • [ ] 10944 UVA (4)

  • [ ] 10818 UVA (5) //Easy — but not-easy implementation: ++Dijkstra [LEX!]

  • [ ] http://www.spoj.com/problems/A_W_S_N/ (4) //BFS + TSP (path) — NICE

two-pointers

wavelet_tree

Zfunction

2SAT

  • [ ] 11930 UVA (4)

  • [ ] http://codeforces.com/contest/776/problem/D (5)

← Metadata

12
Stars
7
Forks
Watchers

Owner

verified publisher icon crazymerlyn

Metadata

A list of interesting competitive programming problems

Back