Riyuzak251097's blog

By Riyuzak251097, history, 13 months ago, In English,

Hi everyone. I am facing difficulty in understanding the editorial for the third question asked in Hackerearth October easy challenge 2018. It would be very helpful if someone tells me how to approach this problem and suggest where problems similar to this can be found

Link for the Question

Read more »

 
 
 
 
  • Vote: I like it
  • +6
  • Vote: I do not like it

By Riyuzak251097, history, 14 months ago, In English,

Hi everyone, i am trying to implement the solution for 1029D which was asked in last div3 contest. I am failing at test case number 17. Can someone tell me what mistake i am making and rectify my code?this is my solution It would be really helpful if one can also guide me how to find similar questions of this type.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Riyuzak251097, history, 16 months ago, In English,

Given an array of n integers (1<=n<=300000, 0<=arr[i]<=100000) and q queries (1<=q<=300000) where each query contains 2 integers l and r (1<=l<=r<=n), tell the gcd of all the elements in range l to r (both inclusive).

I am just not getting an idea on how to link query(l) and query(r) in fenwick tree(BIT)

Read more »

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

By Riyuzak251097, history, 17 months ago, In English,

hi everyone, i have been lately solving lots of problems on codeforces and frequently giving contests. I found that i am able to solve A and B problems regularly in a contest and also solved the a2oj ladder. In case of C problems i am facing big difficulty as in most of them i am not able to think like the way of the solution, i am regularly practicing on a20j in div2 c category but still i am not able to think and have to see the solution. This is becoming kind of a habit with around 1 getting solved out of 5. Just wanted to know am i following the right path?

Read more »

 
 
 
 
  • Vote: I like it
  • -14
  • Vote: I do not like it