Competitive-Programming icon indicating copy to clipboard operation
Competitive-Programming copied to clipboard

Published 20 hours ago • verified publisher icon rishabhgarg25699

Computing a raised to b mod c in logn time?

Open yashagarwal1999 opened this issue 5 years ago • 2 comments

There is a fast algorithm to compute (a^b)%c in O(log N) time rather than O(b). Can I work on this issue?

yashagarwal1999 avatar Dec 12 '19 12:12 yashagarwal1999

Can I work on this?

yashagarwal1999 avatar Dec 12 '19 15:12 yashagarwal1999

@yashagarwal1999 Assigned

rishabhgarg25699 avatar Dec 12 '19 15:12 rishabhgarg25699