ahmedbadr97 / ANU-ICPC-Training

Books and resources

• Competitive Programmer’s Handbook
• AN INTRODUCTION TO THE USA COMPUTING OLYMPIAD
• cheatsheets

c++ tutorial

tutorialsPoint

• C++ Variable Scope

• C++ Operators

• C++ Functions

• C++ Arrays

• C++ Strings

• C++ Pointers

  • What are Pointers?
  • Using Pointers in C++
  • Null Pointers
  • Pointer Arithmetic
  • Pointers vs Arrays
  • Array of Pointers
  • Pointer to Pointer
  • Passing Pointers to Functions
  • Return Pointer from Functions

• C++ References

  • References as Parameter
  • Reference as Return Value

• C++ Basic Input/Output

  • The Standard Output Stream (cout)
  • The Standard Input Stream (cin)

• C++ Data Structures

  • defining structures /Accessing Structure Members
  • Structures as Function Arguments
  • Pointers to Structures
  • The typedef Keyword

thenewboston Official Buckys C++ Programming Tutorials Playlist (Youtube playlist)

El-azhar

level 1

• Level 1
• weeks problems

week1

Part 1

• Intro to C++ , input , output , Data types , operators
• Conditions and loops C++
  • boolean expressions if(x)
  • for loop and all it's forms change the initialization statement , after loop statement , while , do while
  • nested loops
• Arrays,Strings in C++
  • show the uninitialized array , all initialization ways , global array
  • sort arrays using sort function
  • Note: they used the .begin and . end without explaining the iterators

Part 2

• how to create codeforces account and submit a problem

week2

Part 1

• vectors , strings (concatenate strings , substrings , s.length , getline), sort array using sort function
• reading from file , overflow and typecasting

Part 2

• Approaching Problem Statement
• On papers Not on PC

week3

• revision (ignore )
• Complexity analysis , algorithms correctness and performance , execution time and needed memory
• problem solving topics names
• more on time complexity use more than one algorithm to solve a problem and compare check prime loop to sqrt and to n
• Data preprocessing
  • frequency array
  • Prefix (Cumulative) Sum
• fast input code only

week4

• partial sum (prefix sum) Range Update Queries ,
• more problems on complexity analysis and preprocessing

week5

• string class member functions

week6

• functions in c++ , pass by reference , passing arrays
• built in functions (explanation not good)
  • sort , upper-bound , lower-bond , binary_search , fill , is_sorted , max_element , next_permutation ,
• Note binary search need to be explained before this week

week7

• revision on prefix sum
• 2d prefix sum
• struct and pair , array of pairs , array of structs
• compare function using it in sorting

week8

• number theory (prime numbers (Sieve of Eratosthenes) , divisibility rules , modular arithmetic , lcm , gcd )
• (Sieve of Eratosthenes) , (Prime Factorization) , divisibility (count of divisors)
• mod operations

week9

• data structures (Stack , queue , Dequeue)
  • queue example uses the idea of priority queue loop on the queue if the value == highest priority pop it out
• containers , iterators

week10

• data structures (set , map , PQ)
  • set bst explanation
    -pq explanation not good
• containers , iterators
• extras (dr mostafa saad)
  • bst
  • heap
  • hash table
  • avl trees

week 11

• binary search (answer) , ternary search , linear search

Week 12

• Two Pointers Technique
• sliding window Technique

level 2

• Level 2

Assiut

Link

Usaco

• Usaco guid

coach Academy syllabus

level 1

---

• Introduction
• Conditions
• Loops
• Arrays
• Strings
• Functions
• Recursion
• Complexity analysis (Intro)
• STLs
• The Standard Template Library is a software library
  • It provides four components called algorithms,
    • sort , upper-bound , lower-bond , binary_search , fill , is_sorted , max_element , next_permutation ..etc
  • containers
    • Queue , Priority Queue , Stack , set , multiset , map
  • functions, and iterators

level 2

---

• STLs
• Complete Search (Backtracking)
  • iterative
  • recursive
• Greedy
• Static Range Queries (prefix sum)
• Binary Search & 2-Pointers
• Modular Arithmetic
• Binary Exponentiation
• Mod inverse using Fermat's little theorem
• Primes & Factors, GCD & LCM
• Sieve of Eratosthenes & Basics of Counting
• Dynamic memory (Pointers)
• What's an algorithms?
• Sorting Algorithms
  • quicksort
  • merge sort
  • selection sort
  • count sort
  • bubble sort
  • radix sort

dr mostafa saad