CP Notes

CP Resources

Overview

This repository contains structured Competitive Programming notes and optimized C++ solutions. It is designed for systematic learning, fast revision, and interview preparation, with a strong emphasis on algorithmic fundamentals and problem-solving efficiency.

All implementations follow competitive programming constraints and best practices.

---

Current Coverage

CP Sheets

• CP-31 (800 Rated Sheet) A curated set of 800-rated Codeforces problems for building strong problem-solving fundamentals.

Core Topics

• Number Theory

  • Prime numbers and sieves
  • GCD and divisors
  • Prime-related problem variants
  • Competitive programming problems based on number theory

• Graphs

  • BFS and DFS based traversal
  • Grid-based graph problems
  • CSES practice problems

Platforms

• Codeforces
• CSES

---

Tech Stack

• Programming Language: C++
• Paradigm: Competitive Programming
• Code Focus: Optimized, readable, reusable implementations

---

Repository Structure

CP-Notes/
│
├── CP-31 800 sheet/
│   ├── A_Ambitious_Kid.cpp
│   ├── A_Array_Coloring.cpp
│   ├── A_Binary_Array_Game.cpp
│   ├── A_Buttons.cpp
│   ├── A_Cover_in_Water.cpp
│   ├── A_Desorting.cpp
│   ├── A_Don_t_Try_to_Count.cpp
│   ├── A_Doremy_s_Paint_3.cpp
│   ├── A_Everybody_Likes_Good_Arrays.cpp
│   ├── A_Extremely_Round.cpp
│   ├── A_Forbidden_Integer.cpp
│   ├── A_Game_with_Integers.cpp
│   ├── A_Goals_of_Victory.cpp
│   ├── A_Grasshopper_on_a_line.cpp
│   ├── A_Halloumi_Boxes.cpp
│   ├── A_How_Much_Does_Daytona_Cost.cpp
│   ├── A_Jagged_Swaps.cpp
│   ├── A_Line_Trip.cpp
│   ├── A_Make_it_Beautiful.cpp
│   ├── A_Serval_and_Mocha_s_Array.cpp
│   ├── A_Twin_Permutations.cpp
│   ├── A_Unit_Array.cpp
│   ├── A_United_We_Stand.cpp
│   ├── A_We_Need_the_Zero.cpp
│   ├── B_Sequence_Game.cpp
│   └── C_Prepend_and_Append.cpp
│
├── CP-31 900 sheet/
│   ├── A_Forked.cpp
│   └── B_Chemistry.cpp
│
├── Graphs/
│   └── CSES Problems/
│       ├── Labyrinth.cpp
│       └── counting rooms.cpp
│
├── Number-Theory/
│   ├── sieveofEratosthenes.cpp
│   ├── countPrimes.cpp
│   ├── NthPrime.cpp
│   ├── AlmostPrimes.cpp
│   ├── B_T_primes.cpp
│   ├── gcdCalculate.cpp
│   ├── commonGreatestDivisor.cpp
│   ├── countingDivisors.cpp
│   ├── DivisorSummation.cpp
│   ├── A_Little_Elephant_and_Problem.cpp
│   ├── c.cpp
│   └── Notes/
│
├── CP-Topics.md
├── CSES Handbook.pdf
└── README.md

---

Objectives

• Build strong algorithmic and problem-solving fundamentals
• Maintain topic-wise organized Competitive Programming notes
• Improve speed, accuracy, and consistency in contests
• Create a long-term revision resource for interviews and practice

---

Roadmap

• Number Theory
• CP-31 800 Sheet (In Progress)
• Graph Algorithms
• Dynamic Programming
• Bit Manipulation
• Arrays and Strings
• Recursion and Backtracking

---

Coding Practices

• One problem per file
• Efficient use of STL
• Time and space optimized solutions
• Clean and consistent naming conventions
• Solutions written with contest constraints in mind

---

How to Use This Repository

• Topic-wise revision before contests
• Reference implementations for common algorithms
• Interview preparation and concept refresh
• Long-term tracking of learning progress

---

Contribution

This repository is maintained primarily for personal learning and practice. Suggestions, optimizations, and improvements are welcome.

---

References

• Competitive Programming Resources (linked above)
• CSES Problem Set Handbook

---

⭐ Support

If this repository adds value to your learning, consider giving it a ⭐ to show your support.