数论
数论是一个比较大的话题,慢慢更
素数
母函数
gcd
//欧几里得,又叫做最大公约数
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int gcd(int big, int small)
{
if (small > big) swap(big, small);
int temp;
while (small != 0){ // 辗转相除法
if (small > big) swap(big, small);
temp = big % small;
big = small;
small = temp;
}
return(big);
}
逆元
//逆元
gcd(a,b)=a*x+b*y;
gcd(b,a%b,)
ll extgcd(ll a,ll b,ll &x,ll &y)
{
if(b==0){
x=1,y=0;
return a;
}
ll d=extgcd(b,a%b,x,y);
ll t=x;
x=y;
y=t-a/b*y;
return d;
}
ll inv(ll a,ll mod)
{
ll x,y;
extgcd(a,mod,x,y);
return (mod+x%mod)%mod;
}
快速幂
ll fast_pow(ll a,ll b,ll mod)
{
ll ans=1;
while(b){
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans;
}
//快速幂
卡塔兰数
ll Catelan[N];
//用逆元求解
ll extgcd(ll a, ll b, ll& x, ll& y)
{
ll d = a;
if(b != 0){
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
}else {
x = 1;
y = 0;
}
return d;
}
void pre()
{
int i;
ll x, y;
Catelan[0] = 1, Catelan[1] = 1;
for(i = 2; i < N-5; i++)
{
Catelan[i] = Catelan[i-1]*(4*i-2) % mod;
extgcd(i+1, mod, x, y);
Catelan[i] = (Catelan[i]*((x+mod)%mod)) % mod;
}
}
矩阵快速幂求逆元
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 100
#define LL long long
#define MOD 10000
using namespace std;
struct Matrix
{
LL a[MAXN][MAXN];
int r, c;//行数 列数
};
Matrix ori, res;//初始矩阵 和 结果矩阵
void init()//初始化矩阵
{
memset(res.a, 0, sizeof(res.a));
res.r = 2; res.c = 2;
for(int i = 1; i <= 2; i++)//构造单位矩阵
res.a[i][i] = 1;
ori.r = 2; ori.c = 2;
ori.a[1][1] = ori.a[1][2] = ori.a[2][1] = 1;
ori.a[2][2] = 0;
}
Matrix multi(Matrix x, Matrix y)
{
Matrix z;
memset(z.a, 0, sizeof(z.a));
z.r = x.r, z.c = y.c;//新矩阵行数等于x矩阵的行数 列数等于y矩阵的列数
for(int i = 1; i <= x.r; i++)//x矩阵的行数
{
for(int k = 1; k <= x.c; k++)//矩阵x的列数等于矩阵y的行数 即x.c = y.r
{
if(x.a[i][k] == 0) continue;//优化
for(int j = 1; j<= y.c; j++)//y矩阵的列数
z.a[i][j] = (z.a[i][j] + (x.a[i][k] * y.a[k][j]) % MOD) % MOD;
}
}
return z;
}
void Matrix_mod(int n)
{
while(n)//N次幂
{
if(n & 1)
res = multi(ori, res);
ori = multi(ori, ori);
n >>= 1;
}
printf("%lld\n", res.a[1][2] % MOD);
}
int main()
{
int N;
while(scanf("%d", &N), N!=-1)
{
init();//初始化单位矩阵
Matrix_mod(N);//矩阵快速幂
}
return 0;
}
斯特灵近似
ll steling(ll n)
{
return ll(log10(sqrt(4*acos(0.0)*n))+n*log10(n/exp(1.0)))+1;
}