Yazılar

Seçim n elementdən k elementin seçilməsidir, burada verilmiş n elementdən k elementi seçilir. Bu halda, elementlərin sıralanması fərqli olan dəstlər (lakin tərkibi fərqli olmayan) eyni hesab olunur. Seçimlərin bu xüsusiyyətinə görə onlar yerləşdirmələrdən fərqlənirlər.

38
0

Congratulations to all participants who have been selected to represent Ukraine at different European and International Olympiads.

16
2

Thanks for participating in Weekend Practice yesterday. We hope you had fun solving the problems. Problems are already available for upsolving along with editorials: The Chess Board, Pets and Friends, The Legend Was Invented, but Not the Name, Chasing Chmyaaax and The Root of Evil.

11
0

19 May, saat 16:00 UTC, Eolymp Weekend Practice seriyasının ikinci yarışması keçiriləcək. Ətraflı məlumatı müsabiqə saytında əldə edin.

26
5

Thanks for participating in Weekend Practice yesterday. We hope you had fun solving the problems, even though we've started the event with an outage. We apologize for the outage and will make sure the next round will go much smoother.

20
0

Gələn bazar günü, martın 24-də, saat 16:00 UTC, Eolymp Weekend Practice #1 seriyasının ilk yarışması keçiriləcəkdir.

51
12

Today we'll take a look at how Eolymp tests submissions: what happens after you submit a solution,how it is executed, how the results are verified and what outcomes there are. Hope this article will help you betterunderstand how the system works and make it easier to work with it.

12
0

Hello everybody! My name is Sergey Kolodyazhnyy and I am one of the co-founders of the Eolymp. Today I would like to share with you the story of how my computer science teacher Zhukovsky Serhiy (@zss) and I created one of the largest Ukrainian sites for studying computer science. Of course, over the years, many caring people have helped the site. This post mentions only a few of them, but I am very grateful to everyone who contributed.

14
5

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

13
0

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

22
1