We are excited to announce Educational Round #2 during October 6 - 12. This round is based on the problems from the archieve. This is not a rated contest but it is a good opportunity to practice tasks of varying difficulty.

The project "Average Weight of a School Student" was undertaken by Mamed and Samed.

We are excited to announce first Education round starting on Monday , 21th. This round is based on the problems from the archieve. This is not a rated contest but it is a good opportunity to practice tasks of varying difficulty.

Even in ancient times, the Egyptians knew that a triangle with sides $3$, $4$, and $5$ is a right triangle, with its right angle being the largest one. Determine whether other triangles also have this property.

Trees are one of the key data structures in algorithms and appear in a wide range of problems.

The Two Pointers technique is a strategy commonly used in computer science and programming for solving problems involving arrays or sequences. It involves using two pointers that traverse the array or sequence from different positions, often moving in opposite directions or at different speeds. This technique is particularly useful for solving problems related to searching, optimization, or manipulation of arrays efficiently.

The objective of this lesson is to introduce students to the concept of recursion, understanding its fundamentals, and mastering its implementation in programming. By the end of this lesson, students should be able to:

A combination of $n$ elements taken $k$ at a time is a set of $k$ elements chosen from the given $n$ elements. In this context, sets that differ only in the order of the elements (but not in their composition) are considered identical. It is precisely this property of combinations that distinguishes them from permutations.

Пусть есть страна $G$, в которой есть множество городов (обозначим это множество как $V$), и множество дорог, соединяющих пары городов (обозначим их как $E$). Не факт, что каждая пара городов соединена дорогой. Иногда, чтобы добраться из одного города в другой, следует посетить несколько транзитных городов. У дорог есть длина. В стране $G$ есть город-столица $s$. Необходимо найти кратчайшие пути из столицы до всех остальных городов.

Дерево Фенвіка – це структура даних на масиві довжини $n$, яка дозволяє виконувати наступні операції: