Please look at my two submissions.

204540477 204540870

My question is why I am getting TLE in my second submission?

The only difference between these submissions is given in the picture.

As far as I know, the complexity of the upper bound doesn't depend on the value.

Please Help.

Thanks in advance.

Can anyone please explain why my second solution is getting tle ?

I just used push_front() instead of push_back() here.

First Solution — 188254737

Second Solution — 188254960

Problem — 1527E - Partition Game

Thanks in advance.

How my friends submission 80262789 for this problem 913A - Modular Exponentiation is accepted? Here 1 ≤ n ≤ 10^8 and he used pow() function for the value of 2^n.

My friend's submission 120906590 is showing AC but I think it should be wrong answer for test cases like

1005 1005

If I'm not wrong please add some more cases.

In this submission 104338791 of mine there is an array named sufmn.But later I declared a vector also named sufmn and it caused no problem.Can anyone please explain this?