Análise e resolução de problemas da maratona de programação das edições de 2023, 2024 e 2025

Abstract

The development of computational thinking and the ability to design correct and efficient solutions are fundamental competencies for students and professionals in the field of computing. In this context, programming contests, such as the SBC Programming Marathon, play a crucial role in strengthening these skills. This work aims to contribute to training for such competitions through a detailed analysis of four medium and high difficulty problems drawn from recent editions of the SBC Programming Marathon. The methodology adopted consists of the introduction of theoretical concepts, the descrip tion of the problems and their solutions, the implementation of the approaches in C++, the analysis of time and space complexity, and the discussion of limitations and possi ble alternatives. The correctness of the solutions was validated through submissions on the Codeforces platform. The selected problems involve greedy algorithms, com plete search, modular arithmetic, graphs, and binary search. The result is a supporting study resource that connects theory and practice, assisting students in preparing for programming contests.