Skip to content

Latest commit

 

History

History
53 lines (44 loc) · 3.06 KB

File metadata and controls

53 lines (44 loc) · 3.06 KB

Level 0

Duration: 20 rokba days.

Target: be able to solve CF-div2 A(B)

Content

  • Introduction to Programming
  • Data types and arithmetic & bitwise operations
  • Conditions and logical operations
  • Loops
  • Arrays and Strings
  • Function - Built-In Functions
  • Recursion
  • Complexity Analysis
  • Constructive Algorithms + Greedy
  • STLs I (Vector, Pairs, Deque, Queue, Stack)
  • STLs II (Set, Map, Priority queue)

Timeline

To use this plan:

  • For coaches: each point of the content takes a week (1 session for teaching + 1 session for upsolving the sheat)
  • For trainees: try to master each point in at most (3-5) days (learning + finishing the sheet)

Sheets

Materials

Topic Videos Blogs Templates
Introduction to Programming Errichto Intro to Competitive Programming
Data types Data Types Data Types
Conditions Conditions If Condition
Arrays Working With Arrays Arrays
Strings Strings W3School Strings
Functions Intro to Functions W3School Functions
Recursion Buckys Recursion W3School Recursion
Complexity Analysis Time Complexity and Big O Notation Usaco Time Complexity
STLs Adel Nesem in Arabic , In English Intro to Data Structures , Sets and Maps

Notes