How sadatislam9696/competitive-programming works
This repository is a collection of standalone competitive-programming solutions, demonstrations, and reusable algorithm snippets—not one integrated application. The usual workflow is to provide input to an individual program and read its answer; there is no shared runtime coordinating the files. The graph samples representative problem areas and algorithm techniques visible in the tree. Source excerpts are limited, and the README is empty, so connections between separate programs are not inferred.
Main entry points: CSES CSES problems · Codechef CodeChef problems · Graph - problem Graph problems · 2154C - C1. No Cost Too Great (Easy Version).cpp Number theory
Components 18
Judge solutions
- CSES problems
CSES - CodeChef problems
Codechef - Graph problems
Graph - problem - Number theory
Number Theory/2154C - C1. No Cost Too Great (Easy Version).cpp - Reachability counts
Litoj/Best Picnic Ever.cpp - String periods
String/Number_of_divisor_of_string.cpp - Route connectivity
CSES/1682 - Flight Routes Check.cpp
Algorithm studies
- Dynamic programming
Dp - problem - Rod cutting
Dp - problem/Rod cutting.cpp - Shortest paths
Topic Base Code - Bellman-Ford
Topic Base Code/Bellman Ford Algorithm.cpp - Algorithm examples
GeeksforGeeks
Reusable snippets
- General template
ALL template.cpp - Double hashing
my-sublime-snipet/hasing_double.cpp - Segment trees
my-sublime-snipet/segment_tree.cpp - Number tools
my-sublime-snipet/prime_factorization_using_spf.cpp
Other components
- Contestant
- Program output
Connections 24
- Contestant → CSES problems: provides input
- CSES problems → Program output: prints answer
- Contestant → CodeChef problems: provides input
- CodeChef problems → Program output: prints answer
- Contestant → Graph problems: provides input
- Graph problems → Program output: prints answer
- Contestant → Number theory: provides input
- Number theory → Program output: prints answer
- Contestant → Reachability counts: provides input
- Reachability counts → Program output: prints answer
- Contestant → String periods: provides input
- String periods → Program output: prints answer
- Contestant → Rod cutting: provides input
- Rod cutting → Program output: prints answer
- Contestant → Bellman-Ford: provides input
- Bellman-Ford → Program output: prints distances
- Contestant → Route connectivity: provides input
- Route connectivity → Program output: prints verdict
- Contestant → Dynamic programming: provides input
- Dynamic programming → Program output: prints answer
- Contestant → Shortest paths: provides input
- Shortest paths → Program output: prints distances
- Contestant → Algorithm examples: provides input
- Algorithm examples → Program output: prints result