C++快速模指數計算與prefix sum解Leetcode 2438 Range Product Queries of Powers

C++快速模指數計算與prefix sum解Leetcode 2438  Range Product Queries of Powers

先用fast modular exp解Leetcode 2438. Range Product Queries of Powers，這不會殺雞用牛刀?

-----

First, use fast modular exp to solve Leetcode 2438. Range Product Queries of Powers. This will not be an overkill?

[codes on Leetcode]https://leetcode.com/problems/range-product-queries-of-powers/solutions/7066112/fast-modular-exp-prefix-sum-dp-precompute-beats-100/