Akash and GCD 2

C X Y: Compute the value of \\(F(A[X] ) + F(A[X + 1]) + F(A[X + 2]) + .... + F( A[Y] )\n\\) (mod \\( 10^9 + 7\\) )
U X Y: Update the element of array \\(A[X] = Y\\)

★★★★★

95 votes

Approved, Data Structures, Euler's totient function, Fenwick Tree, Math, Medium, Number Theory, Segment Trees

Editorial

The Editorial is locked. In order to qualify for points, you need to solve the problem without unlocking the editorial.

Are you sure you want to unlock the tab?

Unlock it