Hello 2015 is a Div.1 + Div.2 contest that will be held in gym soon. As I said, there will be 2 divisions and in each divisions, users of that division can participate ( ( - ∞, 1699] and [1700, 9999]). So, anybody who participates in the wrong division will be out of competition (manually).
Duration is 3 hours and there will be 6 problems in each division. Last 4 problems of Div.2 will be same as first 4 problems of Div.1 . Problems are written by me (PrinceOfPersia) and tester's M.Mahdi.
The problems will be sorted according to the estimated order of difficulty according to my opinion but I strongly recommend you to read all of the problems.(sentence from matrix :D).
Problems are more Olympiad style than ACM. I hope you enjoy them.
It takes a while to prepare all problems. So, this contest is not in the gym contests list yet.
Oh, I almost forgot this : the main character of all problems will be my friend, De Prezer :)
UPD: Problems are designed for single participant (as mathlover said), so teams will participate out of competition too.
UPD2: It's in the gym contests list now.
UPD3: For making the contest more interesting, the winner of each division, gets a kiss ;)
UPD4: Round was delayed by 10 minutes for some technical reasons.
UPD5: Contest is over.
Congratulation to all winers specially sankear who solved all Div.1 problems.
Div.1 winners :
Div.2 winners :
See you in next rounds, good luck and have fun.
UPD6: Well, recently I'm a little busy and I'll just post some keywords and tags but maybe I'll write an editorial some time.
Div.2 A : Binary search, B : Partial sum
Div.1 A : Binary search, B : Dijkstra, C : DP,Two pointers,queue, D : 2-sat, E: Hash, Segment tree, F : Divide and Conquer.
UPD7: You can find the editorial here.