Hello Coders!
The July edition of 101 Hack is here. 5 interesting challenges in 2 hours. The contest commences on on 26th July 2014 at 13:00 UTC, You can sign up for the contest here.
The problem statements will be available in English, Russian and Chinese.
Top 10 on leaderboard get cool HackerRank T Shirts
Books for individual challenge-leaderboard toppers
Problem Setters
Gerald
Problem Tester
Bidhan
Please try all problems, Editorials will be available at the end of contest.
GL&HF
What's is sorting order on HackerRank (in particular on 101 Hack)?
You mean, sorting order of problems?
No, I mean sorting order of participants in the leaderboard (Well, first thing is surely points, and then something else (or random?))
For same score tie breaking is done on Sum(time_of_submit)
Like cumulative sum
so challenge 1 got AC at 130th second, Challenge 2 got AC at 400th second. Total penalty is 530 seconds.
So, basicly as in ACM but without penalty time?
Yes ). WA/TLE has no penalty
Thanks a lot.
Is the same holds for standing for each challange?
here there's label "1 hour ago" when hover me and "44 minutes ago" for person before me. But he is above me somehow.
Ignore that, that thing is showing random time.
https://www.dropbox.com/s/g0fi5g9iggle6cs/Screenshot%202014-07-27%2005.24.52.png
This is the real picture 5th column is time in minutes.
That's fine. But it would be great to see that time on leaderboard page.
You are right we must add that. Next 101 will have it :)
It would be cool to have the sum of penalties in Leaderboard of contest too if possible.
It's always confusing not to have the data which is used to sort the table.
Thanks in advance.
If I just read the statement, will my rating change?
Any idea for Xor and sum?
Let's solve it bit by bit. It's easy to see that on bits with number BIG = 314159 + max(a.len(), b.len()) +-1 and greater the xor'ands are always 0.
So for each bit we should calculate how many times it's 1. a[bit] is fixed and (b << i)[bit] are b[i], b[i — 1], b[i-314159]. With prefix sums you may understand how many times the last one is 1. So multiply it or (314159 + 1- it) by 2^bit (precalculated for all bits up to BIG)
Sorry, but what is default stack limit for C++ solutions? Or where can I found information about it?
8MB is stack limit.