ANALYSIS AND PROGRAMMING IN C++ LANGUAGE OF THE OLYMPIC PROBLEMS USING THE GRID OF ERATOSTHENES

Abstract

The article illustrates the solution of Olympiad problems in programming according to a certain scheme, which has several stages. Namely: analysis of the condition of the problem, drawing up a plan for solving the problem, building a mathematical model and solution scheme, implementing the algorithm, testing and debugging, submitting the solution. For analysis, programming and demonstration, problems of varying complexity were selected for the use of prime number search algorithms, i.e. the Sieve of Eratosthenes. For the first task, all the described stages were completed and analyzed, for the second – all stages, except for the last one, because for this task it is not possible to send the task for evaluation. The third task is analyzed and programmed without stages. But especially the last stage is demonstrated, because the evaluation result is displayed differently than in problem 1. The result of the work shows the correct approach to solving Olympic programming problems. The execution of the last stage, the submission of the solution, was done using the evaluation tool available on the platform https://www.eolymp.com/uk/problems.