TLE in RECREP-RECursion challenge

general
, ,
1

Can anyone please tell why my code is giving TLE for the problem-

my solution - http://www.codechef.com/viewsolution/6004574

My code complexity is O(T*(n+logn))

2

Same case for me . Watch this http://www.codechef.com/viewsolution/6003932 . This submission has 0.21 sec running time .

3

Same here, My all submissions here except the last one.

4

use scanf same was the case with me
i got accepted after using scanf http://www.codechef.com/RCSN2015/status/RECREP?sort_by=All&sorting_order=asc&language=All&status=All&handle=ramanbansal&Submit=GO