acwing-a^b

题目

https://www.acwing.com/problem/content/description/91/

思路

• 重要公式：
  $$\begin{gathered} (a+b)\%p=[(a\%p)+(b\%p)]\%p \\ (a\ast b)\%p=[(a\%p)\ast (b\%p)]\%p \end{gathered}$$

• 证明
  $$\begin{gathered} a^b\%p \\ 把b表示成2进制数，b=2^{x_1}+2^{x_2}+\dots \dots ; \\ {a}^b=a^{2^{x_1}}\ast a^{2^{x_2}}\ast \dots \dots ; \\ {a}^b\%p=(a^{2^{x_1}}\ast a^{2^{x_2}}\ast \dots \dots )\%p=[(a^{2^{x_1}}\%p)\ast (a^{2^{x_2}}\%p)\ast \dots \dots ]\%p; \end{gathered}$$

• 快速幂模板

  //a^b
  int res = 1;
  while(b)
  {
      if(b&1) res = res*a;
      a = a*a;
      b >>= 1;
  }
  

AC代码

#include <iostream>

using namespace std;

int main(){
    int a,b, p;
    cin >> a >> b >> p;
    int res = 1%p;
    while (b){
        
        if (b & 1) res = (long long)res * a % p;
        b >>=1;
        a = (long long)a * a %p;//这里取模由上述公式证明可得
    }
    cout <<res ;
    return 0;
    
}