Scribd
Upload
18 views2 pages

Competative Programming Routine 2

The document outlines a comprehensive competitive programming curriculum spanning multiple weeks, covering topics from basic programming concepts to advanced algorithms and data structures. It includes specific weeks dedicated to graph theory, dynamic programming, and various advanced techniques such as segment trees and game theory. The curriculum is structured to progressively build skills and knowledge in competitive programming, with contests and discussions integrated throughout.

Uploaded by

Zulvanich
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views2 pages

Competative Programming Routine 2

The document outlines a comprehensive competitive programming curriculum spanning multiple weeks, covering topics from basic programming concepts to advanced algorithms and data structures. It includes specific weeks dedicated to graph theory, dynamic programming, and various advanced techniques such as segment trees and game theory. The curriculum is structured to progressively build skills and knowledge in competitive programming, with contests and discussions integrated throughout.

Uploaded by

Zulvanich
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Introduction to competitive programming.

Benefits, Future plan,


Week 1 How to start competitive programming, Whats the diffrence between
normal programming? Etc
Data Type, Input Output, if Condition, loop, break continue, and or
Week 2
xor
Week 3 1D array, 2D array, String, Introduction With Codeforces

Week 4 Function, GCD LCM, Prime Number

Binary Search, Cumulative Sum Technique


Week 5

Week 6 Last Week before Mid: Advice, Problem solving,Contest

Week 7 Introduction With C++: cin, cout, bits/stdc++, sort, swap

Week 8 Number Theory Begins: Sieve, Number of divisors, sum of divisors

Week 9 Euler Totient function, Bigmod, trailling zeros

Week 10 Lightoj Contest+Problem Solving

Introduction with STL: vector, queue, stack, deque, lower bound


Week 11
upper bound, itterator
Week 12 pair, Priority Queue, Set, Map, Ordered set(Not Much)

------------ ----------- -----------------------------------------------------------------------

Week 1 Recap all about 1st section

Week 2 Beginning of Graph Theory: How to save graph

Week 3 BFS+DFS

Week 4 Contest + Discussion of BFS DFS

Dijkstra, Bicoloring, Topological


Week 5
Sort, DSU
Floyd Warshall, Bellman Ford,
Week 6
Minimum Spanning Tree
Week 7 Discussion on Graph+Contest

Week 8 Hard Part Begins: Recursion, Greedy, Task Scheduling

Week 9 Dynamic Programming: Coin Change and its varience

Week 10 DP Continues
Week 11 DP contest + Discussion

Week 12 Segment Tree (Sum,Min)

Week 13 Segment Tree Lazy + Last 2 month Plan

Week 14 IUTPC

---------------- ------------- ------------------------------------------------------------------------

Week 1 Square Root Decomposition + MO algorithm

Week 2 Hashing + KMP + Trie

Ordered Set + Combi Tricks + Catalan Number + Stars and bars +


Week 3
Matrix Expo
Week 4 Again Segment Tree + lazy + BIT

Week 5 LCA

Week 6 Bitmask Dp + other dp techniques

Week 7 Convex Hull + Picks Theorem + Other Geometry Topic

------------ ----------- ----------------------------------------------------------------------


Week 8 Fast Fourier Transform + Walshhadamard

Week 9 Flow + BPM

Week 10 Game Theory

Week 11 Aho Corasick + Suffix Array

Week 12 Heavy Light Trick + Meet In the Middle

Week 13 DSU on tree +Spars Table

Week 14 Digit Dp + SOS DP

Topic Left : Burnside Lema, Palindromic Tree, Rotating Callipars, 2


SAT, Ternary Search, Mo on tree, Mo with update, Centoied
Decomposition, Milar Robin and so many more ................................

You might also like