Algorithmic Problem Solver & Judge Tests
Private Repository - University Automated System (STOS PG) C| C++| STOS PG| Automated JudgeCollection of algorithmic and mathematical solutions rigorously verified against automated testing systems (STOS PG). Each solution had to successfully pass strict evaluation metrics covering correct output data, execution time constraints, and memory consumption limits.
Automated Verification & Triple Criteria
The project comprises 5 specialized algorithmic tasks. To pass the evaluation on the university's STOS automated judge, every task had to successfully clear 10 distinct test cases (2 tests per problem: initial checks with simple numbers/edge-cases, followed by high-load stress tests with large datasets). Every single test demanded optimization across three strict pillars: Correct Output, Execution Time, and Memory Usage.
Solved Algorithmic Problems
- Banany_Symmetric_Tree_Checker: Tree structure analysis verifying node symmetry and balance constraints under strict time limits.
- Klika_Collatz_Longest_Decreasing_Subsequence: Mathematical sequence analysis involving Collatz trajectories and optimization of subsequence searches.
- Przekatne_Polyhedron_Problem: Geometric calculations determining structural diagonals and spatial relationships within polyhedrons.
- Sekta_Josephus_Problem_Bin: Efficient binary-based simulation and calculation of the classic Josephus elimination problem.
- Tarzan_Tsp_Bitmask: Solving the Traveling Salesperson Problem variant using dynamic programming with bitmasking for optimal path computation.
Testing Suite Structure
- 5 tasks × 2 tests = 10 total cases
- Simple numbers & logic check
- Large numbers & scaling stress
- Result, Time & Memory
- STOS PG automated judge pipeline
Core Focus Areas
Time Complexity| Memory Management| Dynamic Programming| Bitmasking| Automated Testing