### Dream_Coder10's blog

By Dream_Coder10, history, 4 weeks ago, Suppose there are two number n & k where 1 <= k <= n <= 1e9 . Now I have to calculate n/k (modulo 1e9 + 7)

==========================================================================================================================

My approach:

I used fermats little theorem to calculate moduler multiplecative inverse & then i printed n*(moduler multiplecitive inv.); But in this approach many test cases like "n=11,k=3" or "n=10 ,k=4" are not working properly & giving me wrong answer..

problem: ( https://paste.ubuntu.com/p/vgTZcHQ8Rv/ ) what I have to modify in this code ( https://paste.ubuntu.com/p/T2h9CsjpXx/ )? Comments (7)
•  » » » Change the while loop in the binary exponentiation function to:  while(n) { if(n%2) res=(res*a)%m; a=(a*a)%m, n/=2; } and your code will work as expected.BTW Melonade is wrong.
 » 4 weeks ago, # | ← Rev. 2 →   You understood problem wrong. Right formulaanswer = $(\frac{n}{k})^k$BTW, your power-function is completely fine.