本题就是直接用50. Pow(x, n)实现快速幂的代码。基本思想是：pow(x,k) = pow(x, k/2) ^2 * (k%2==1? x:1);
1922.Count-Good-Numbers
Directory actions
More options
Directory actions
More options
1922.Count-Good-Numbers
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||