Yes, This will work. I was just looking around gcd but was not able to figure out this particular expression. Thanks for the help :)

Yes, It should be. I corrected it now. Thanks

Auto comment: topic has been updated by abbi_18 (previous revision, new revision, compare).

Thanks for commenting, Rishi. Although that would be correct; I am looking for a solution which will be work in O(1) or at least in O (log n).

yes, I know that. What I propose there should be is that a link is provided to go to the problem in practice section. It's just a lot of work sometimes searching for the same Qs in every sub-section like beginner, easy, medium, hard etc, that's why it's actually easier to just modify the URL.

I agree with you on the URL point. There should be a link at every questions page about the location of it in practice section.

Regarding the test case on which you are getting WA, unfortunately, that feature is not present in codechef yet.

It's open to submit now.

Tip — whenever you want to submit a solution to a qs after the contest, just remove the name of the contest from the link and you will reach the practice section.

Eg : Link of qs during contest : https://www.codechef.com/SNCKQL17/problems/SNAKEEAT.

Link of same qs after contest : https://www.codechef.com/problems/SNAKEEAT

As I mentioned above, only the name of the contest has been removed.

Thanks for replying, although your explanation does provide an intuition to why this is happening but can you also provide a proof as to why it is actually happening?

Hello Thriller, Is there a way to check the rating of all the developers of a particular institute. I tried to find it but was unable to do so.

Congratulations everyone on the 4th century of contests here on Codeforces :) :)

In today qs 1.

say the input is 
12
1 -2 -1 -1 2 2 0 1 -1 1 0 -2

my answer was - 

10
1 1
2 2
3 3
4 4
5 5
6 6
7 8
9 9
10 10
11 12

the answer given was -
10
1 1
2 2
3 3
4 4
5 5
6 7
8 8
9 9
10 11
12 12

I know, the answer are different but the sum of any of my subarrays is not 0. I got WA in 7th case system testing. I have mentioned a part of input for 7th test case, can anybody please help, what is the problem.

PS : I am sorry to post here, I have no idea, what else to do!

Yes, I already said that in one of my above comments.

Excuse me, why would you say that?

Yes i just saw an answer solved by binary search. I was actually using simple iteration to check how many elemants were equal to the given query because of which i was getting TLE.

No , i tried to solve it by binry search and I got TLE.