Hello Guys,

I just wanted to remind everyone of you to have his registration completed for each of those coming contests :

• Facebook Hacker Cup : Qualification Round 9th Jan. 2016

• The deadline24.pl : Qualifying Round 28th Feb. 2016

• Google HashCode : Online Qualification Round 11th February 2016

MikeMirzayanov Could you please change the time of the contests during Ramadan Month? just because this time is the time which we are supposed to pray & eat so it will not be easy for us to compete in the contests, this is not for me only but for all the Muslim Contestants in arabian countries.

RAMADAN KAREEEEM Everyone :)

this problem on hackerrank https://www.hackerrank.com/contests/w15/challenges/haunted-house

require me to check on the existence of each N varies from 1 to 3x10^5 in the giver intervals [start,end] whether equal to or more than N+1 the intervals are also 1<= i <= 3x10^5 & the time limit for the problem is 1s i have done a sol of O(n^2) making a loop that iterates over all interval & counts the existence of each N so i can get the maximum N with the condition N exists for at least N+1 times !

would anyone here help me plz !

thanks in advance

they have did the real unpredictable thing which is solving all the problems in the 5 hours

what do you think they have more than any other team that made them this brilliant ?

I'm a newbie at algorithms, but I'm capable of writing codes in C++ & Java. Do I have a chance to win the ACM ICPC 2016 title? Do I have the time to study and practice the knowledge needed?