Hi all,↵
↵
We [Computer Science](https://www.cse.iitm.ac.in) Department at IIT Madras are hosting the contest [comp.exe](https://www.exebit.in/events/comp.exe) on Codechef[(link)](https://www.codechef.com/COME2018) as part of our department fest Exebit.The contest will take place on [11th April,2018 at 21:00 IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=comp.exe&iso=20180411T21&p1=553&ah=2).<br> The problemsetters and testers for the contest are me([user:teja349,2018-04-11]) and [user:Megabidoof,2018-04-11]. Thanks to [user:Toodifferent,2018-04-11] for helping us in preparation of the contest.↵
<br>↵
I personally feel problemset is around Div2 level.There will be 8 problems with ACM type scoring.The contest is team contest (teams of 2).Duration is **120** minutes. ↵
↵
There are prizes worth 6K (only for Indian participants).↵
↵
Registrations for prizes: Register [here]( https://www.exebit.in/events/comp.exe)↵
before the contest starts to be eligible for prizes.↵
Hope you enjoy the contest!!!Good luck and have fun.↵
↵
Lets discuss problems after contest (if any).↵
↵
UPD: Contest starts in less than 1hr.All the best!!!↵
↵
Thanks for the participation!! ↵
<br> We are sorry that for the question GCD Queries segment tree solutions and sparse solutions could pass. Though we had a solution with complexity of O((q+n)*log(MAX_element)).We leave it for you to try it.
↵
We [Computer Science](https://www.cse.iitm.ac.in) Department at IIT Madras are hosting the contest [comp.exe](https://www.exebit.in/events/comp.exe) on Codechef[(link)](https://www.codechef.com/COME2018) as part of our department fest Exebit.The contest will take place on [11th April,2018 at 21:00 IST](https://www.timeanddate.com/worldclock/fixedtime.html?msg=comp.exe&iso=20180411T21&p1=553&ah=2).<br> The problemsetters and testers for the contest are me([user:teja349,2018-04-11]) and [user:Megabidoof,2018-04-11]. Thanks to [user:Toodifferent,2018-04-11] for helping us in preparation of the contest.↵
<br>↵
I personally feel problemset is around Div2 level.There will be 8 problems with ACM type scoring.The contest is team contest (teams of 2).Duration is **120** minutes. ↵
↵
There are prizes worth 6K (only for Indian participants).↵
↵
Registrations for prizes: Register [here]( https://www.exebit.in/events/comp.exe)↵
before the contest starts to be eligible for prizes.↵
Hope you enjoy the contest!!!Good luck and have fun.↵
↵
Lets discuss problems after contest (if any).↵
↵
UPD: Contest starts in less than 1hr.All the best!!!↵
↵
Thanks for the participation!! ↵
<br> We are sorry that for the question GCD Queries segment tree solutions and sparse solutions could pass. Though we had a solution with complexity of O((q+n)*log(MAX_element)).We leave it for you to try it.
