Attention Hackers! The dates have been set for Facebook Hacker Cup 2013.
Jan 7 — Jan 27 — Registration
Jan 25 — Jan 27 — Online Qualification Round
Feb 2 — Online Elimination Round 1
Feb 9 — Online Elimination Round 2
Feb 16 — Online Elimination Round 3
March 22 -23 — Onsite Finals at Facebook
For more details visit official page.
UPD : Registration is now open for the 2013 Facebook Hacker Cup! If you registered for a previous year, you're automatically registered for this year, but you should check to make sure all of your information is up-to-date. The qualification round begins on January 25th. Good luck!
I wonder if it's possible to submit the output and solution this year.
Take me to the Facebook)
Damn, I hoped this would be contest in who can hack Facebook the best in some manner. :D
Registration is opened.
I wonder if there's a possibility to add problems from past years to CF.Gym for training purpose before the upcoming contest. It's hard enough to find problems itself even to read them so it would be nice if we have an opportunity to read them conveniently. Moreover, maybe somebody saved tests. There was totally 15 problems (1st, 2nd rounds in 2011, 1st, 2nd, 3rd rounds in 2012) worth to solve. I don't count qual problems and problems from onsite finals because obviously there's no opportunity to get tests for them. So, who has problems and tests?
MAybe the problems wrote Anton_Lunyov or dzhulgakov
i have registered for the contest but i am not getting the link for contest arena please some post the link
You'll get the link before the start of the contest
am I allowed to see the problems in hole time between 25 and 27 and submit my solutions whenever I want (between 25 and 27) or there is a timer start when I open the problems when the timer ends I am no longer allowed to submit solution (like USACO)??
You can submit problem only once. You can submit it anytime during competition.
for example if I see the problems in 25 can I download the input file and upload the output in 27?
Yes you can. The only thing is that you have 6 or 8 minutes(dont remember the rigth number) after downloading the input to submit the output
Thank you.
UPD : Ok, misunderstandings.
Good luck.
квалификация уже идет? где можно прочитать задачи
насколько я понимаю... The Qualification Round
то есть нет, еще не идет.
Can anyone explain me how calculate 'penalty' here?
Penalty in Qualification round doesn't matter.
I did not understand,On score board people is sorted by penalty,and it is not matter?,more formally I am interested what I need to advance in the qualification round?
You need to solve one problem.
OK, let's T[i] be the time for solving i-th problem. T[i]=0 if the problem isn't solved. Then S=T[1]+T[2]+T[3]+...+T[n] is your penalty time. People are sorted but it doesn't matter in qual and 1st round. It does matter in 2nd and 3rd rounds.
Anybody got the statement of the last problem? Could you explain one of the samples please?
Reread the statement, it helped me.
Thank you, so much help from the community as I can see. I appreciate this.
I had to reread it too. The first time I read it I didn't notice the part of the statement that is bold and in asterisks :)
Here it is:
John knows the following: for each index i, where k <= i < n, m[i] is the minimum non-negative integer which is *not* contained in the previous *k* values of m.
Does it mean that all values of array beginning with k-th position are equal?
Oh, I got it! Not first but previous k values. Thank you very much!
Is there any age restriction for the participating in online rounds?
Это победа :)
Вы уверены, что там один Петр участвует?
Кстати, не в тему, но табличка просто ужасна. Почему нельзя добавить механизм "друзей"? Я хочу смотреть результаты человека, даже если я не дружу с ним в Фейсбуке. Почему нельзя добавить нормальные ссылки на страницы? По имени сложно определить человека — так я могу хоть щелкнуть на его страницу и посмотреть фамилию. И вообще, эти объявления красным цветом вверху страницы тоже не сказать, чтоб уж очень заметные. Я как раз попался на том, что у меня была установлена та прога, в которой говорится в одном из оповещений, и когда я скачал инпут, у меня скачал файл формата sdx и я немножко испугался. В общем, за 2 года ничего не изменилось в лучшую сторону, кроме приза для первого места, но это улучшение только для таргетов всяких — обычные люди не видят улучшений!
Я точно знаю, какой именно это Петр ;) Инсайдерская информация
Проблема в privacy. Они не хотят, чтобы можно было попасть на страницу человека. С другой стороны, можно было бы хотя бы друзей показывать, кто есть кто, да
Так друзей они показывают.
Да, перепутал
Не кипятись раньше времени :) Вдруг в этот раз они предварительные результаты скажут сразу и ничего не напутают с рассылкой)
Если очень захотеть, то на страницу человека перейти всё-таки можно:
Нужно скопировать ссылку на изображение с его фотографией и взять из ссылки второе справа число — это и будет id человека на фейсбуке.
И потом в ссылку вида www.facebook.com/profile.php?id=10000 вместо 10000 записать нужный id
Осталось только написать скрипт...
А как такие скрипты пишутся? Я бы написал, если бы Вы вкратце сказали, в каком направлении двигаться.
Вроде работает :) http://paste.ubuntu.com/1584924/ Только чтобы перейти по ссылке нужно кликнуть на фото.
UPD: А, нет. Работает только для первой страницы.
Лучше берите селектор по <div class="scoreboard_row"
и в нем первый image
Еще не понятно как находить id тех, у кого нет фото.
lol,i forgot to put ':' after "Case #x",and couldn't find it in 6 min,now i can do nothing to change it,maybe it will be better if contestants can submit solutions during whole 72 hours...
You can try to solve another two problems without this stupid mistake :)
sure :)
I forgot the "#" character on "Case #x:" for 2 questions. It was actually worse, because it doesn't complain about output format, and I ended up doing it twice. I'm probably getting Wrong Answer for this :S
Why not more flexible validation, like on codeforces or topcoder: just output the numbers, one by line or separated by spaces... If we want to see what test case correspond at what input, we can easily debug ourselves using flag and number of test case, but I don't see any reason to use this format for validation...
In Google Code Jam the system checks that the first line of the submission starts with "Case #1: " and that the number of such "Case #X:" is consistent with the input file — http://code.google.com/codejam/faq.html#how_we_judge.
This helps to prevent submitting source code as output or output to a different problem accidentally.
Facebook just copied the format blindly without implementing the reasons behind it.
I forgot to output the '#' in 'Case #1:' and my solution passed!!
Ахах.. фб лежит :)
Есть у кого-то на http://www.facebook.com/hackercup/problems.php?round=189890111155691 ошибка сервера?
Learn a lesson from Hacker Cup, READ THE RULES CAREFULLY! I supposed that I can download another test data like GCJ, which lead my submitting without enough testing, and finally lose points. Crying...
Oh, I was a second from win! I was filling really pity that happened so. I've understood that there is one chance to submit a problem and decided to do better testing. And found that for the worst case it could compute in 7 minutes. I've decided to implement multithreaded implementation. And in rush did not mind that processor loaded and refused from multithreaded solution(I thought it was slow. But the real reason was that processes of previous testing that I've stopped before were hanging). Then I've decided that the test wouldn't be so hard and started a submit. I've ran solution and it start slowly displaying results and than I understood system was swapping! I've started to kill those previously ran solutions and it started to output result quite fast. It was about a minute when 15 tests left, but it managed to calculate them all. The counter was just 0:00 when I was pressing a submit button and it blocked. I was filling very pity because after this I found that real time to compute was a minute and a 50 seconds. Just another one lesson for me and now for all who is reading this.
just saw the news that winner is none other than what we guess, its Petr :) Congrats Petr !!!