1 year, 5 months ago
The small report on how we solved ICFP Contest 2015. We participated in this competition for the first time, however the result turned out quite quite good. It is possible to look for us in the table of intermediate results under the name of "WILD BASHKORT MAGES". Final results are expected within several next weeks when organizers test all solutions on complete set of tests.
This year as a task it was offered to write a reshalka (or as it is more convenient to AI, a lump) for a hexagonal tetris. In total as in a normal tetris — we stack figures, we clean the filled lines, receiving for it points. The solution has to work for the different sizes of a game field and the stacked figures of any configuration. Commands of actions with figures (movements and turns) are coded by normal characters, as a result a solution is the line of commands. For the special confidential strings in line solution called by power words additional bonus points are given. On a plot — these lines were named davary, and organizers collected it to delay awakening to Ktulkh.
1 year, 5 months ago
Сегодня завершился финал Яндекс.Алгоритма — ежегодного чемпионата по спортивному программированию, который организует Яндекс. В 2015 году состязание проходило полностью в онлайне — на платформе Яндекс.Контест. Заявки на участие подали программисты из 73 стран. Больше всего участников — из России, Украины, Беларуси, Казахстана, Индии, США, Японии и Китая, но вообще география чемпионата крайне обширна — Бразилия, Индонезия, Перу, Доминиканская Республика, Мозамбик, Сенегал, Каймановы острова. 8,9% зарегистрировавшихся — девушки. Примерно половина всех участников — студенты. Всего мы получили заявки от 3722 человек, из которых до финала дошли 28.
А победителем Яндекс.Алгоритма-2015 стал Геннадий Короткевич. Он по привычке показал лучший результат, решив в финальном раунде пять из шести задач и получив при этом 80 минут штрафного времени. Геннадий занимал первое место в чемпионате Яндекса и в 2013, и в 2014 годах.
Второе место занял Пётр Митричев, а третье — Евгений Капун. Они решили по четыре задачи, при этом Пётр набрал 31 штрафную минуту, а Евгений — 79 минут. Результаты всех финалистов можно посмотреть на сайте Яндекс.Алгоритма.
Задачи для Яндекс.Алгоритма составляет международная команда, в которую входят как сотрудники Яндекса, так и приглашённые эксперты — в том числе победители и финалисты состязаний ACM ICPC и Topcoder Open. И мы по традиции подготовили для вас разборы всех заданий. Решить все из них никому не удалось. Больше всего участников справились с задачей B, а вот задания A и D решило всего по одному человеку.
1 year, 5 months ago
Last week in Seattle there took place the biggest student's action Microsoft — the international final of the competition Imagine Cup and the international summit of partner students. More than 30 best teams from around the world fought for the right to become the best in the categories.
The team from Russia has won against the second year in a row category of games: this time the students from St. Petersburg who have presented the psychodelic game OVIVOon competition became prize-winners. And the team from Brazil with the project of the system allowing to automate creations of pattern of clothes including for physically disabled people became the main thing super - the finalist.
Us there were 7 people. We had 20 modules on the haskel, private repository on gitkhaba, 6 branches in this repository, ImplicitParams, MagicHash and UndecidableInstances in code and one highmem note on Amazona, and also hangouts for communication, unit tests, simply tests, google docs for notes and a lot of articles about SMT-solvery. Not that we everything would use it, but on ICFPC you look for any nonsense on the Internet and it is difficult to stop. The only thing that caused in me fear — it is SMT-solvery. There is nothing more helpless, irresponsible and spoiled, than the person reading articles during contest. But I knew that sooner or later we will sit down and on this rubbish. (Dmitry Astapov)
It is devoted to habrovchana which sometimes want to have a rest from industrial koding and to find something like that madly [abruptly] go as a hobby. Annual ICFP Contest will begin less than in week!
On August 1, 2015 in the city of Omsk the Russia's first tournament on leanpoker as which organizer Ivan Nemytchenko has acted has taken place. Tournament on leanpoker has taken place in IT Loft to the address Omsk, Uchebnaya St. 83. Leanpoker — it not simple competition of players in Unlimited Texas Holdem. This competition of programmers who had to write poker bot which purpose was to change bots rivals. Feature of tournament also is also that there is no basic difference in in what programming language the team writes. Therefore and programming languages in tournament it has been provided a little, it is slightly less, than number of teams.
There is such piece? Testing Dojo. It competitions where participants look for bugs in applications. Who will find more? that has also won. Usually compete teams. If bugs have to be looked for manually, only testers participate. If autotests go into battle, developers are connected.
In 2GIS Testing Dojo became good tradition for a long time: let's see off it the third year in a row. During this time we have much understood how better to do. Under cat we will share experience: suddenly and you want to make the Testing Dojo.
1 year, 6 months ago
Thanks to all who participated in our competition on programming! We have summed up its results and have awarded winners.
The task consisted in improving implementation of the doubly-connected list from Node.js source codes. This code fast and effective, but it has been written under specific application? storage of lists of inactive timers. Therefore directly the idleNext and idlePrev fields are added to the stored objects there. Participants of competition were faced by task to make code universal (so that one element could belong at the same time to several independent lists) without performance penalty.
On Sunday June 14 has passed selection round of RCC 2015. For rank of the finalist of RCC 2015 604 programmers who have passed qualification in the previous three rounds have battled. At least one correct solution was sent by 324 participants. And now heroes of round! Pyotr Mitrichev has taken the first place of standings, the first having solved problems of B (Splitting into teams) and F (Illumination of scene) for 20:32 and 1:31:41 AM. Gennady Korotkevich goes the second — he the first in 2 minutes and 30 seconds has solved A problem (Game with lines) and before all has coped with problem of D (The Cartesian trees) for 14:16. Makoto Soejima from Japan — the third, apparently before solution it translated conditions of tasks through online translator. Mikhail Pyadyorkin the first has solved problem C (Card) in 51 minutes and 4 seconds. Egor Kulikov the first has solved problem of E (Avenue) in 1 hour 5 minutes and 49 seconds. Following the results of selection round the final was reached by 50 participants. On September 19 in the Final the strongest programmer of year will be defined! All participants of selection round will receive online certificates, and 200 the best of them will receive RCC 2015 t-shirts.
1 year, 7 months agoThe author is Dmitriyeva Lyudmila
On June 2-3 to Skolkovo there took place the Forum "Startup Village-2015" where the companies having the innovation projects participated and persons interested to tell about them. At the Forum there were both Russian, and foreign companies.
On Sunday May 31 has passed the final 3rd qualification round of RCC 2015. The first in 1 minute and 49 seconds Grigory Reznikov (grikukan) has solved A problem (Purchase of the bicycle), he before all has coped with problems of B (Digital roots) and C (Two snails)? 7:26 and 18:39 respectively. Adam Bardashevich (subscriber) before all has solved problem D (Game machines) in 14 minutes and 20 seconds.
Oleg Merkuryev (Merkurev) became the first at solution of the last problem of E (Internetoprovod)? 1 hour and 1 minute. Following the results of the 3rd round the first place in standings was taken by Evstropov Gleb (GlebsHP) from Moscow.
It is a little facts: in round 3762 programmers have battled, from them at least one correct solution have sent 664. In total for round 3536 solutions have been sent. 202 best participants have been qualified (the 200th place 3 participants have divided). 3 participants have been disqualified by jury. 604 participants who have passed qualification in three rounds will battle on June 14 for rank of the finalist. All participants of selection round will receive online certificates, and 200 the best of them will receive RCC 2015 t-shirts.