CODE@BURGAS is a prestigious student programming competition organized by Burgas Free University (BFU) in partnership with the Municipality of Burgas. It brings together talented young programmers to solve algorithmic challenges in a competitive environment. The event typically features multiple difficulty groups (A, B, C, etc.) tailored to different age groups and skill levels, fostering the development of computer science education in the region and beyond.
This repository is a comprehensive archive of competitive programming solutions covering the entire history of the competition, from its inception in 2019 to the present day (2025).
It contains 100% completed solutions for:
- All Years: 2019, 2020, 2021, 2022, 2023, 2024, 2025.
- All Groups: A, B, C, D, E (depending on the year).
- All Problems: Every single task given during these contests has been solved and archived here.
I have actively participated in the "Group A" (highest difficulty) category of the competition with the following results:
Winner of the CODE@BURGAS 2025 competition in the most advanced category.
Runner-up in the CODE@BURGAS 2024 competition.
.webp){kind=link}
.webp){kind=link}
The project is organized hierarchically by year, group, and problem.
/
├── 2019/
│ ├── Group A/
│ │ ├── A. Number Systems/
│ │ │ ├── Condition/ <-- Problem statement
│ │ │ └── Solution/ <-- C++ solution source code
│ │ └── ...
│ └── ...
├── 2025/
└── ...
This project uses CMake to manage builds, allowing you to compile and run any individual solution easily.
- A C++ compiler (GCC, Clang, or MSVC)
- CMake (version 3.10 or higher)
- Open the repository root folder in CLion.
- Wait for the CMake project to load.
- Select any specific problem target (e.g.,
2025_Group_A_A__The_Prince_And_The_Palindromes...) from the run configurations dropdown. - Run or Debug the solution directly.
mkdir build && cd build
cmake ..
cmake --build . --target <target_name>
./<target_name>This project is licensed under the MIT License - see the LICENSE file for details.
Created and maintained by Kadir Yazadzhi.