Competitive Programming

Sport programming competitions are incredibly popular: in 2019, the International Collegiate Programming Contest (ICPC) saw the participation of 527,097 participants from 3,233 educational institutions representing 110 countries. Each year, the number of tournaments grows as the relevance of the IT sphere increases: competitions help participants improve their professional level, teaching them to solve challenging tasks from various development directions.

In the "Sport Algorithmic Programming" course, you will get acquainted with tasks from various tournaments, including the finals of the ICPC World Programming Championship, and program solutions in Visual Studio using C++ and C#.

Who is this course for?

• For IT students: to get acquainted with approaches to solving Olympiad programming tasks in C++/C#.
• For those looking to start their journey in IT.
• For those already working in IT: middle-level programmers looking to increase their value as a specialist and expand their tech stack.

What will I learn?

• Analyze task conditions
• Evaluate the labor intensity of the solution
• Solve algorithmic tasks of various types

Why our course?

• The course is structured: watch in order or skip directly to the challenging tasks.
• Engaging presentation of material: lectures are accompanied by an animated assistant.
• Reinforce theory in practice: at vital checkpoints, we provide practical tasks to better assimilate the material.
• Return to any topic at any time: access to lectures, presentations, tasks, solutions remains forever.

Remote

Module 1. Task Analysis (Formula, Dates, Brute-force Search)

Module 2. Task Analysis (Monte Carlo Methods, Greedy Algorithm, Data Structures)

Module 3. Task Analysis (Dynamic Programming, Graphs, Geometry)

Module 4. Task Analysis (1/4 and 1/2 Final ICPC)

Module 5. Task Analysis from ICPC Finals

Upon completion of this course, you will know:

• features of sports programming competitions;
• types of algorithmic tasks;
• specifics of working with popular checking systems.

Upon completion of this course, you will possess:

• dynamic programming skills;
• binary search task-solving skills;
• basic graph algorithm-building skills;
• Monte Carlo method task-solving skills.

Upon completion of this course, you will be able to:

• analyze the condition and determine the type of algorithmic tasks;
• evaluate the labor intensity of the obtained solution.

- способность использовать методы математического и алгоритмического моделирования при решении теоретических и прикладных задач (ПК-5)

- способность использовать методы математического и алгоритмического моделирования при анализе управленческих задач в научно-технической сфере, в экономике, бизнесе и гуманитарных областях знаний (ПК-7)