itsmahadi007/cp-list

Competitive Programming Problem List

Learn to Loop:

10976-Fractions Again?!

441-Lotto

105-The Skyline Problem (Hint: Use array index)

Parallelepiped (Can you do it with one loop?)

Fancy Technique With Loop:

11742-Social Constraints

12455 - Bars

Math:

Xenia and Ringroad (Know how mod works with negative values first!)

Lunch in Grid City (A Nasty Graph problem?)

Alternating Sum (Geometric Sequence)

Game Problems:

Easy:

Game With Sticks (At most 10 lines)

Godsend (At most 10 lines, Number Theory)

A Multiplication Game (Find Patterns/Just Simulate?)

Just Simulate:

Traffic Lights

Brush Up STL:

Anargam (Watch out for the sorting technique!)

Pseudo-Random Numbers (Map it through)

Hardwood Species (Map it through)

Add All (Priority Queue)

A mid-summer night's dream. (A bit hard for non math savvy)

Printer Queue (Queue simulation)

Containers (Stack simulation)

ARRAYSUB (multiset / set)

Recursion Saves Thinking Time:

CD (Also solvabe with fancy techniques)

8 Queens Chess Problem (A famous problem :p)

UVa 297 - Quadtrees (Some DFS?)

Number Theory:

Multipliers (Number Theory With Modular Arithmatic on exponentiation)

Graph:

Maze (BFS, DFS, FloodFill)

Connected Components? (DFS with binary search!)

King's Path (BFS/DFS ?)

Numbering Paths UVa-125 (Cycle detection and path counting, BFS/DFS)

Kilani and the Game (Multi-Source BFS)

Tree:

Tree with Maximum Cost (Subtree Sum is needed)

Destruction of a Tree (Tree Properties + Even Odd Edges)

Tree Construction (Binary Heap Property)

Tree Requests (Cumulative Frequencey + Binary Search + DFS/BFS)

Tree-String Problem (KMP basics + dfs)

Jamie and Tree (Interesting problem of a changing root of tree)

DRTREE

Miscellaneous:

Ice Skating (Union Disjoint, DFS.. Vertex Cover)

Segment Tree:

Do all LightOJ problems from Segment Tree Category

Do GSS1, GSS3, GSS5, GSS4, GSS2 from SPOJ

GCD 2010

Destiny (Persistant Segment Tree)

Ant Colony (Persistant Segment Tree + Basic Segment Tree)

Simple Editor (Nice offline problem)

BRCKTS (Bracket Sequencing)

Sereja and Brackets

Lucky Queries

KQUERYO (Segment tree as Merge Sort Tree)

On Changing Tree (Segment Tree + DFS Traversal on tree)

New Year Tree (Segment Tree + DFS Traversal on tree)

MKTHNUM (Persistant Segment Tree + Binary Search)

COT (Persistant Segment Tree)

TTM (Persistant Segment Tree)

DZY Loves Fibonacci Numbers (Segment Tree with some Fibonacci Tweaks)

Fenwick Tree / Binary Indexed Tree (BIT):

All problems from LightOJ Binary Indexed Tree category

KQUERY (BIT + offline)

KQUERY2 (BIT + Square Root Decomposition)

Trie(Prefix Tree):

Do all LightOj problems from Trie

SUBXOR (Normal Trie with reverse bit gready approach)

A Lot of Games (Trie + DP + Game Theory)

DP:

Divisibility by Eight (Basic Digit DP)

Color the Fence (Try DP with almost Same State Occurance + Path Printing)

UVa 166 - Making Change (Coin Change)

Yet Another Problem On a Subsequence (DP + Counting)

Subarray LCM

MO's Algo:

One Occurrence (Need to use fast comparison technique & each insertion deletion must be done in O(1), we can spend some time in query.. (HINT : Apply Sqrt Decomposition))

Disjoint Set Union:

Anansi's Cobweb (Offline DSU)

Gears (Weighted DSU for bipartite matching)

Dream Team (Maximum GCD finding and Tree Building using DSU)

Maximum Distance (Finding if an edge lies between two node's path)

Ice Skating

Multiple Algorithm Problems:

Longest Common Prefix (Hash + Segment Tree + Offline(Reverse Calculation))

Sherlock and Unique Substrings (Suffix Array + Segment Tree + Offline)

Sherlock and Queries on the Graph (LCA + DFS Timing for child node finding)

All Pair Shortest Path

Roads in Berland (Floyd Warshall)