LeetCode 2438. Range Product Queries of Powers

solution.py

class Solution:
    def productQueries(self, n: int, queries):
        bn = bin(n)[2:][::-1]
        powers = []
        for i, v in enumerate(bn):
            if v == '1':
                powers.append(i)
        ans = []
        for l, r in queries:
            t = 0
            for i in range(l, r + 1):
                t += powers[i]
            ans.append(2 ** t % (10 ** 9 + 7))
        return ans