@gamabunta Please look into this!
my logic is same as the editorial,but it gives TLE.
http://www.codechef.com/viewsolution/3914314
please can someone guide me where i might be wrong
please check submision id 4099624,itās giving wrong answerā¦ http://www.codechef.com/viewsolution/4099624 please say why itās wrong? On which test case itās wrong ???
I have used precalculation technique . For ex. let 1 2 3 4 5 be array .
Then through precomputation i have made another array . 1 2 6 24 120 . After that in order to cal any query it is :- arra[m]/arr[l-1] where l is lower rage and m is upper ā¦ Is my approach wrongā¦ getting WA many times Could someone help me out. Solution is :- http://www.codechef.com/viewsolution/6845308
Please help me out. Tried every optimization I could think of!
What is wrong with this code?
I am getting WA.
Will the segment tree approach work?
I tried but its giving WA.
can anyone help me with the following code. why is it not working i canāt seeā¦please.
https://www.codechef.com/viewsolution/15878086
I got AC only when I converted the exponentiation function from a recursive method to an iterative one. What could be the reason for this?
can anybody whatās wrong in my logic.I am getting wrong answer