关于快速幂

快速幂

$$\begin{gathered} 由于cpp中cmath库pow函数是double型,double转int精度丢失会有错误,因此采用此算法, \\ 时间复杂度O(\log n) \end{gathered}$$

#define ll long long
ll power(ll a, ll n)
{
    ll ans = 1, t = a;
    for (; n; n >>= 1, t *= t)
    	if(n & 1) ans *= t;
    return ans;
}

快速幂取模(二进制)

$首先证明：(a\ast b)modc=\left[(amodc)\ast (bmodc)\right]modc$
$$\begin{gathered} Suppose:amodc=d,bmodc=e \\ thena=mc+d,b=nc+e \\ So(a\ast b)modc=(mc+d)\ast (nc+e)modc=(d\cdot e)modc \end{gathered}$$
$结合:$
$$\begin{gathered} a{}^{b}modc=((a^2{)}^{\frac{b}{2}})modcb\in 2k,k\in N \\ {a}^{b}modc=((a^2{)}^{\frac{b}{2}}\times a)modcb\in 2k-1,k\in N \end{gathered}$$

#define ll long long
ll mod(ll x, ll n, ll m)
{
    ll ans = 1;
    for (x %= m; n; n >>= 1, x = x * x % m)
    	if (n & 1) ans = (ans % m) * (x % m) % m;
    return ans;
}

十进制快速幂

#include <cstdio>
#include <cstring>
#define ll long long
const int N = 1e4 + 5;
ll a, mod, ans = 1;
char num[N];
 
void reverse(char *s)
{
	char tmp;
	int n = strlen(s);
	for(int i = 0; i < n / 2; ++i){
		tmp = s[i];
		s[i] = s[n - 1 - i];
		s[n - 1 - i] = tmp;
	}
}
 
ll mpow(ll a, ll n, ll mod) {
	ll res;
	for (res = 1; n; n >>= 1, a = a * a % mod)
	  if (n & 1)
	  res = res * a % mod;
	return res;
}

int main ()
{
	scanf("%lld%s%lld", &a, num, &mod);
	ll base = a;
	int len = strlen(num);
	reverse(num);
	for (int i = 0; i < len; ++i) {
		ans = ans * mpow(base, num[i] - '0', mod) % mod;
		base = mpow(base, 10, mod) % mod;
	}
	printf ("%lld\n", ans);
	return 0;
}

指数循环节降幂

$对于ans=2^{n}modm,1\le n\le 10^{100000},1\le m\le 10^6$
$可利用降幂公式:a^{b}modc=a^{bmod\phi (c)+\phi (c)}modc(b\ge \phi (c))$

#include <cstdio>
#define ll long long
const int Mod = 1e9 + 7;
const int MAX_N = 1e5 + 5;

ll phi(ll x)
{
	ll ans = x;
	for (int i = 2; i * i <= x; ++i) {
		if(x % i == 0) {
			ans -= ans / i;
			while (x % i == 0) x /= i;
		}
	}
	if(x > 1) ans -= ans / x;
	return ans;
}

ll qpow(ll a, ll n, ll mod)
{
	ll ans = 1;
	for(; n; n >>= 1, a = a * a % mod)
		if(n & 1) ans = ans * a % mod;
	return ans;
}

int main()
{
	char a[MAX_N];
	scanf("%s", a);
	ll eu = phi(mod), tmp = 0;
	for(int i = 0; a[i]; ++i) {
		tmp = (tmp * 10 + a[i] - '0') % eu;
	}
	tmp += eu;
	printf("%lld\n", qpow(2, tmp, Mod));
	return 0;
}

矩阵快速幂

$$\begin{gathered} \left(\begin{array}{cccc}{a}_{11}& a_{12}& \cdots & a_{1n}\\ a_{21}& a_{22}& \cdots & a_{2n}\\ ⋮& ⋮& \ddots & ⋮\\ a_{n1}& a_{n2}& \cdots & a_{nn}\end{array}\right)\ast \left(\begin{array}{cccc}{b}_{11}& b_{12}& \cdots & b_{1n}\\ b_{21}& b_{22}& \cdots & b_{2n}\\ ⋮& ⋮& \ddots & ⋮\\ b_{n1}& b_{n2}& \cdots & b_{nn}\end{array}\right)=\left(\begin{array}{cccc}{c}_{11}& c_{12}& \cdots & c_{1n}\\ c_{21}& c_{22}& \cdots & c_{2n}\\ ⋮& ⋮& \ddots & ⋮\\ c_{n1}& c_{n2}& \cdots & c_{nn}\end{array}\right) \\ {c}_{ij}=\sum _{k=1}^n{a}_{ik}\ast b_{kj} \end{gathered}$$
则可得递推式：$$\begin{gathered} (1)f_n=a{f}_{n-1}+b{f}_{n-2}+c \\ \left(\begin{array}{ccc}a& b& 1\\ 1& 0& 0\\ 0& 0& 1\end{array}\right)\ast \left(\begin{array}{c}{f}_{n-1}\\ f_{n-2}\\ c\end{array}\right)=\left(\begin{array}{c}{f}_n\\ f_{n-1}\\ c\end{array}\right) \end{gathered}$$$$\begin{gathered} (2)f_n=c^n-f_{n-1} \\ \left(\begin{array}{cc}-1& c\\ 0& c\end{array}\right)\ast \left(\begin{array}{c}{f}_{n-1}\\ c^{n-1}\end{array}\right)=\left(\begin{array}{c}{f}_n\\ c^n\end{array}\right) \end{gathered}$$

typedef vector<int> vec;
typedef vector<vec> mat;
#define ll long long
const int M = 10000;

mat mul(mat &a, mat &b)
{
  mat c(a.size(), vec(b[0].size()));
  for(int i = 0; i < a.size(); ++i) {
      for(int k = 0; k < b.size(); ++k) {
          for(int j = 0; j < b[0].size(); ++j) {
              c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % M;
          }
      }
  }
  return c;
}

mat pow(mat a, int n)
{
  mat b(a.size(), vec(a.size()));
  for(int i = 0; i < a.size(); ++i) {
      b[i][i] = 0;
  }
  while(n) {
      if(n & 1) b = mul(b, a);
      a = mul(a, a);
      n >>= 1;
  }
  return b;
}

POJ3070

#include <iostream>
#include <cstring>
using namespace std;
#define ll long long
#define N 4

struct mat
{
     ll m[N][N];
}t, tmp;

mat mul(mat a, mat b)
{
     mat res;
     memset(res.m, 0, sizeof(res.m));
     for (int i = 0; i < 2; ++i) {
         for (int j = 0; j < 2; ++j) {
             for (int k = 0; k < 2; ++k) {
                 res.m[i][j] = (res.m[i][j] + a.m[i][k] * b.m[k][j]) % 10000;
             }
         }
     }
     return res;
}

mat matpow(mat x, ll n)
{
     mat ans;
     memset(ans.m, 0, sizeof(ans.m));
     for (int i = 0; i < 2; ++i) ans.m[i][i] = 1;
     for (; n; n >>= 1, x = mul(x, x))
     	if(n & 1)  ans = mul(ans, x);
     return ans;
}

int main()
{
     ios::sync_with_stdio(false);
     cin.tie(0);
     ll n;
     while (cin >> n && n + 1){
         t.m[0][0] = 1;
         t.m[0][1] = 1;
         t.m[1][0] = 1;
         t.m[1][1] = 0;
         tmp = matpow(t, n);
         cout << tmp.m[0][1] << '\n';
     }
     return 0;
}

POJ3734

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MOD = 10007;

struct mat
{
    int m[5][5];
    friend mat operator * (mat a, mat b) {
        mat c;
        memset(c.m, 0, sizeof(c.m));
        for(int i = 0; i < 3; ++i) {
            for(int j = 0; j < 3; ++j) {
                for(int k = 0; k < 3; ++k) {
                    c.m[i][j] = (c.m[i][j] + a.m[i][k] * b.m[k][j]) % MOD;
                }
            }
        }
        return c;
    }
};

int solve(int t)
{
    mat res, a;
    a.m[0][0] = 2, a.m[0][1] = 1, a.m[0][2] = 0;
    a.m[1][0] = 2, a.m[1][1] = 2, a.m[1][2] = 2;
    a.m[2][0] = 0, a.m[2][1] = 1, a.m[2][2] = 2;
    res = a;
    while (t) {
        if(t & 1) res = res * a;
        a = a * a;
        t >>= 1;
    }
    return res.m[0][0];
}

int main()
{
    int t, n;
    scanf("%d", &t);
    while (t--) {
        scanf("%d", &n);
        printf("%d\n", solve(n - 1));
    }
	return 0;
}