Есть ли какая-то информация про футболки от Яндекс.контеста? Слышал, что даже некоторым людям разослали трек-номера на почту — к сожалению, я не среди этих людей.
lperovskaya , ваш комментарий здесь был бы особо ценен и приятен :)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
7 | adamant | 154 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
Есть ли какая-то информация про футболки от Яндекс.контеста? Слышал, что даже некоторым людям разослали трек-номера на почту — к сожалению, я не среди этих людей.
lperovskaya , ваш комментарий здесь был бы особо ценен и приятен :)
I'm quite sure some of you have ever participated in a HackerRank contest. And after going to "Compete" page and seeing "ProjectEuler+" as an active contest for about several months or even years you could have wondered "How can it be for so long"?
ProjectEuler is a well-known website with no need for advertising. So, instead of describing countless beautiful features of it, I'd better tell some of its disadvantages for me as a competitive programmer. You see, in my humble opinion, there is no honor in boasting "Oh, my program runs in just two minutes on my modern laptop" when it's possible to write the same program which runs in several milliseconds.
That's why ProjectEuler+ exists. At first glance, you see the exact same statement, but then... multitest? And constraints ten or even thousand times bigger than they were in original problem? And time limit is just a couple of seconds? Well, such rules seem to be more familiar to us.
I wanted to write this blog a month later when we have 200 problems translated from the original PE but recently a problem was created that stays unsolved for a week — the first time we have such problem. So, I invite everyone to participate in ProjectEuler+ and dilute our leaderboard a bit.
Also, I want to ask tourist on behalf of the creator of the 194th problem and the tester of the problem (which is me) to try solving it (and finally give the opportunity for us to finally submit our 100% correct solution which we are not allowed to do until the first accept).
Oh, and by the way, the link: https://www.hackerrank.com/contests/projecteuler/
Hi!
Ad Infinitum is back with 18th Edition, a contest restricted to mathematics domain, held on HackerRank.
Register at https://www.hackerrank.com/infinitum18
The contest commences on 9th June 15:30 UTC. You are allowed to enter the contest anytime, for tie breaking the timer will start when you view the first challenge, which allows you to start late at your convenience, but once started try to finish as fast as possible to be on top of the leaderboard :)
It's a 2 days contest with 7 problems from easy to hard Scoring Distribution: 10 20 30 40 55 80 100
Top 10 on leaderboard gets Cool HackerRank T shirt.
Detailed editorials will be available by the end of contest :) I suggest you to try all challenges and at the end of contest understand the solutions.
GL&HF
Hi!
Ad Infinitum is back with 17th Edition, a contest restricted to mathematics domain, held on HackerRank.
Register at https://www.hackerrank.com/infinitum17
The contest commences on 30th December 15:30 UTC. You are allowed to enter the contest anytime, for tie breaking the timer will start when you view the first challenge, which allows you to start late at your convenience, but once started try to finish as fast as possible to be on top of the leaderboard :)
It's a 3 days contest with 8 problems from easy to hard Scoring Distribution: 20 30 30 40 50 70 80 100
Top 10 on leaderboard gets Cool HackerRank T shirt.
Detailed editorials will be available by the end of contest :) I suggest you to try all challenges and at the end of contest understand the solutions.
GL&HF
Hi!
Ad Infinitum is back with 16th Edition, a contest restricted to mathematics domain, held on HackerRank.
Register at https://www.hackerrank.com/infinitum16
The contest commences on 2nd September 16:00 UTC. You are allowed to enter the contest anytime, for tie breaking the timer will start when you view the first challenge, which allows you to start late at your convenience, but once started try to finish as fast as possible to be on top of the leaderboard :)
It's a 2 days contest with 5 problems from easy to hard Scoring Distribution: 20 30 50 75 100
Top 10 on leaderboard gets Cool HackerRank T shirt.
This time a new edition is available: https://www.hackerrank.com/contests/infinitum16-firsttimer. Those who want to learn or just find problems from regular Ad Infinitum hard could participate in this unrated edition of Ad Infinitum and solve 5 easy educational problems from mathematical domain.
Detailed editorials will be available by the end of contest :) I suggest you to try all challenges and at the end of contest understand the solutions.
GL&HF
<Copy-paste from shashank21j>
Hi!
Ad Infinitum is back with 14th Edition, a contest restricted to mathematics domain, held on HackerRank.
Register at https://www.hackerrank.com/infinitum14
The contest commences on 15th January 15:30 UTC. You are allowed to enter the contest anytime, for tie breaking the timer will start when you view the first challenge, which allows you to start late at your convenience, but once started try to finish as fast as possible to be on top of the leaderboard :)
It's a 2 days contest with 8 problems (3 Easy(Tutorial), 3 Medium, 2 Hard)
Scoring Distribution: 20 25 30 40 60 80 100 140
Top 10 on leaderboard gets Cool HackerRank T shirt,
Detailed editorials will be available by the end of contest :) I suggest you to try all challenges and at the end of contest understand the solutions.
GL&HF
</Copy-paste from shashank21j>
Hope you find problems interesting, especially the last one :)
Вчера на сайте e-olimp.com закончилась Открытая Дистанционная Олимпиада 2012-2013 им. В.Л.Дидковского. Среди задач (преимущественно простых) попадались и сложные.
К примеру, задача, упомянутая мной две недели назад — Задача I. Мне удивительно то, что её решило народу гораздо больше, чем следующую за ней — на мой взгляд, гораздо более простую.
В связи с этим вопрос(ы) сообществу, особенно решившим эту задачу на контесте. Как можно решить эту задачу с более-менее доказанной сложностью, заходящей в таймлимит? Как люди, решившие её, её решали? Изменилось ли что-нибудь в решении бы, если бы строки состояли не полностью из цифр, а из произвольных символов?
Название |
---|