Hi,

I would like to know the time constraints about this problem. I have an algorithm which takes

`O(20*N) time. `

where N is ((10power6) + 3).
Subtask-3 is getting TLE. Does the solution needs more improvement then that? I’m really exhausted optimizing it. I may have reached the atomic state of optimization.

Please let me know the Time constraints in O() notation. @admin: In case, any verification of code needed please see this submission. http://www.codechef.com/viewsolution/6692845

Thanks.