Hello, Codeforces community!
Link: https://www.hackerearth.com/january-clash-17/problems/
I want to invite all of you to participate in January Clash at HackerEarth. The contest has been running for 9 hours already, so we apologize for this late post. But, there's still a lot of time left: 15 hours to go. Let's see if we're going to see a change of the top-scorers on the leaderboard. The contest duration is 24 hours, so there should be some comfortable time for every timezone. :)
There are six tasks in the problemset. Five of them are standard algorithmic problems with partial solutions allowed — you get points for every test that your solution passed. And the final task is an approximate problem — your score for this task depends on how good your solution is comparing to current best solution.
Yury_Bandarchuk is the author of this problemset. He's done a great job preparing the problem-set. And I hope you guys will enjoy the questions prepared. niyaznigmatul worked on this contest as the tester and editorialist — he is responsible for taking care of the problems. And not surprisingly, he has done a commendable job for testing the problem-set. I hope you guys will not be disappointed.
Good luck!
What was the expected solution for Benny and Sum. My solution involved splitting the queries into 2, with x<MAGIC in one case and x>MAGIC in one case. For the larger case, I used a persistent segment tree. I could only manage 54 points.
my
solution got TLE as well. For that i used the fact that 
for 
has about 
distinct values.
It was the same question as mod queries. Your solution I guess would pass in the mod queries question.I tried implementing a similar solution but bigger constraints resulted TLE.
By the way, if someone wants to set February / March / April Clash contests, they can drop me a message. If you can set a part of the contest, that would work as well.