# dinocodes2005/cp-codes architecture

> Architecture diagram of the GitHub repository dinocodes2005/cp-codes, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-06). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/dinocodes2005/cp-codes
- Repository: https://github.com/dinocodes2005/cp-codes

## Overview

This repository is a collection of independent Java competitive-programming solutions, not a unified application. The usual user workflow is to run one solution, provide that problem’s input, and read its output; sampled files show standalone entry points and locally implemented algorithms, with no shared runtime pipeline. The graph preserves the major contest collections and CSES problem domains, plus the four indexed core modules. No inter-module edges are shown: the index reports no cross-file references, and the empty README provides no further workflow evidence.

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_contests["Contest solutions"]
  node_atcoder["AtCoder problems"]
  node_codeforces["Codeforces problems"]
  node_codechef["CodeChef problems"]
  node_tle["TLE 1400 problems"]
end

subgraph group_cses["CSES solutions"]
  node_cses_bitwise["Bitwise problems"]
  node_xor_subarray["Maximum XOR subarray"]
  node_xor_subset["Maximum XOR subset"]
  node_cses_dp["Dynamic programming"]
  node_cses_geometry["Geometry problems"]
  node_cses_graph["Graph problems"]
  node_flight_routes["K shortest routes<br/>[FlightRoutes.java]"]
  node_flight_check["Route connectivity check"]
  node_shortest_routes["Single-source routes"]
  node_all_pairs_routes["All-pairs routes"]
  node_cses_math["Math problems"]
  node_divisor_analysis["Divisor analysis"]
  node_cses_ranges["Range queries"]
  node_cses_tree["Tree problems"]
end

subgraph group_practice["Practice solutions"]
  node_codechef_template["CodeChef template<br/>[Codechef.java]"]
  node_test_codes["Algorithm experiments"]
end

subgraph group_helpers["Standalone helpers"]
  node_snippet["Conversion snippet<br/>[convert.py]"]
  node_input_generator["Input generator<br/>[input_gen.py]"]
  node_input_runner["Input runner<br/>[ran_inp.py]"]
end

click node_atcoder "https://github.com/dinocodes2005/cp-codes/tree/main/AtCoder"
click node_codeforces "https://github.com/dinocodes2005/cp-codes/tree/main/Codeforces"
click node_codechef "https://github.com/dinocodes2005/cp-codes/tree/main/Codechef"
click node_tle "https://github.com/dinocodes2005/cp-codes/tree/main/TLE_1400"
click node_cses_bitwise "https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Bitwise"
click node_xor_subarray "https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Bitwise/MaximumXorSubarray.java"
click node_xor_subset "https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Bitwise/MaximumXorSubset.java"
click node_cses_dp "https://github.com/dinocodes2005/cp-codes/tree/main/CSES/DP"
click node_cses_geometry "https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Geometry"
click node_cses_graph "https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Graph"
click node_flight_routes "https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/FlightRoutes.java"
click node_flight_check "https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/FlightRoutesCheck.java"
click node_shortest_routes "https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/ShortestRoutesI.java"
click node_all_pairs_routes "https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/ShortestRoutesII.java"
click node_cses_math "https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Math"
click node_divisor_analysis "https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Math/DivisorAnalysis.java"
click node_cses_ranges "https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Range%20Queries"
click node_cses_tree "https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Tree"
click node_codechef_template "https://github.com/dinocodes2005/cp-codes/blob/main/Codechef.java"
click node_test_codes "https://github.com/dinocodes2005/cp-codes/tree/main/TestCodes"
click node_snippet "https://github.com/dinocodes2005/cp-codes/blob/main/Snippets/convert.py"
click node_input_generator "https://github.com/dinocodes2005/cp-codes/blob/main/input_gen.py"
click node_input_runner "https://github.com/dinocodes2005/cp-codes/blob/main/ran_inp.py"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_atcoder,node_codeforces,node_codechef,node_tle toneBlue
class node_cses_bitwise,node_xor_subarray,node_xor_subset,node_cses_dp,node_cses_geometry,node_cses_graph,node_flight_routes,node_flight_check,node_shortest_routes,node_all_pairs_routes,node_cses_math,node_divisor_analysis,node_cses_ranges,node_cses_tree toneAmber
class node_codechef_template,node_test_codes toneMint
class node_snippet,node_input_generator,node_input_runner toneRose
```

## Components

### Contest solutions

- [AtCoder problems](https://github.com/dinocodes2005/cp-codes/tree/main/AtCoder): `AtCoder`
- [Codeforces problems](https://github.com/dinocodes2005/cp-codes/tree/main/Codeforces): `Codeforces`
- [CodeChef problems](https://github.com/dinocodes2005/cp-codes/tree/main/Codechef): `Codechef`
- [TLE 1400 problems](https://github.com/dinocodes2005/cp-codes/tree/main/TLE_1400): `TLE_1400`

### CSES solutions

- [Bitwise problems](https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Bitwise): `CSES/Bitwise`
- [Maximum XOR subarray](https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Bitwise/MaximumXorSubarray.java): `CSES/Bitwise/MaximumXorSubarray.java`
- [Maximum XOR subset](https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Bitwise/MaximumXorSubset.java): `CSES/Bitwise/MaximumXorSubset.java`
- [Dynamic programming](https://github.com/dinocodes2005/cp-codes/tree/main/CSES/DP): `CSES/DP`
- [Geometry problems](https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Geometry): `CSES/Geometry`
- [Graph problems](https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Graph): `CSES/Graph`
- [K shortest routes](https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/FlightRoutes.java): `CSES/Graph/FlightRoutes.java`
- [Route connectivity check](https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/FlightRoutesCheck.java): `CSES/Graph/FlightRoutesCheck.java`
- [Single-source routes](https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/ShortestRoutesI.java): `CSES/Graph/ShortestRoutesI.java`
- [All-pairs routes](https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Graph/ShortestRoutesII.java): `CSES/Graph/ShortestRoutesII.java`
- [Math problems](https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Math): `CSES/Math`
- [Divisor analysis](https://github.com/dinocodes2005/cp-codes/blob/main/CSES/Math/DivisorAnalysis.java): `CSES/Math/DivisorAnalysis.java`
- [Range queries](https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Range%20Queries): `CSES/Range Queries`
- [Tree problems](https://github.com/dinocodes2005/cp-codes/tree/main/CSES/Tree): `CSES/Tree`

### Practice solutions

- [CodeChef template](https://github.com/dinocodes2005/cp-codes/blob/main/Codechef.java): `Codechef.java`
- [Algorithm experiments](https://github.com/dinocodes2005/cp-codes/tree/main/TestCodes): `TestCodes`

### Standalone helpers

- [Conversion snippet](https://github.com/dinocodes2005/cp-codes/blob/main/Snippets/convert.py): `Snippets/convert.py`
- [Input generator](https://github.com/dinocodes2005/cp-codes/blob/main/input_gen.py): `input_gen.py`
- [Input runner](https://github.com/dinocodes2005/cp-codes/blob/main/ran_inp.py): `ran_inp.py`
