西瓜不甜的博客

http://poj.org/problem?id=1995(A1^B1+A2^B2+ … +AH^BH)mod M.快速幂简单应用。#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <queue>#include <algorithm>using namespace std;in

http://poj.org/problem?id=3641满足 ①p不是素数 ②存在a > 1使得a^p = a (mod p) 的p是伪素数。现给出p和a，判断p是否是伪素数。快速幂应用。#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <queue>#include <a

http://codeforces.com/problemset/problem/678/DG(n)=A*G(n-1)+b G(0)=x给定A,b,n,x,求G(n)。快速幂应用。#include <bits/stdc++.h>using namespace std;long long n,x,a,b;long long mod=1e9+7;int main(){ cin >> a >>