Fast Modulo Using Bit - Githubissues

matthewsamuel95 / ACM-ICPC-Algorithms

Algorithms used in Competitive Programming

2.07k stars 1.26k forks source link

Closed Shivamj075 closed 5 years ago

Shivamj075 commented 5 years ago

In this, we use bitmasking for computation of fast modulo in O(log N) complexity.

matthewsamuel95 commented 5 years ago

add to table of contents