因为基础数论每一部分的内容比较少所以就都放一起了
欧拉筛法
void euler(ll range){
for(ll i = 2;i < range;i ++){
if(!vis[i]) prime[cnt ++] = i;
for(int j = 0;j < cnt;j ++){
if(i * prime[j] >= range) break;
vis[i * prime[j]] = 1;
if(i % prime[j] == 0) break;
}
}
}
欧几里得算法
int gcd(int a,int b){
if(b == 0) return a;
return gcd(b,a % b);
}
扩展欧几里得算法
推导如下:
a * 1 + b * 0 = gcd(a,b)
这是最后的一组解
b * x1 + (a % b) * y1 = gcd
(1)
a % b = a - (a / b) * b
(2)
将(2)代入(1)得
b * x1 + [ a - ( a / b ) * b ] * y1 = gcd
整理得:
a * y1 + b * ( x1 - ( a / b ) * y1 ) = gcd
则我们发现:
上一层的x = y1
上一层的y = x1 - a / b * y1
然后就可以写代码了呀
int exgcd(int a,int b,int& x,int& y){
if(b == 0){
x = 1;
y = 0;
return a;
}
int r = exgcd(b,a % b,x,y);
int t = y;
y = x - (a / b) * y;
x = t;
return r;
}
质因数分解
朴素写法
vector<int> breakdown(int n){
vector<int> res;
for(int i = 2;i * i <= n;i ++){
if(n % i == 0){
while(n % i == 0){
n /= i;
res.push_back(i);
}
}
}
if(n != 1) res.push_back(n);
return res;
}
乘法逆元
扩展欧几里得算法求单个逆元:
计算a 在 %b 意义下的乘法逆元
最终x为结果逆元
int exgcd(int a,int b,int& x,int& y){
if(b == 0){
x = 1;
y = 0;
return a;
}
int r = exgcd(b,a % b,x,y);
int t = y;
y = x - (a / b) * y;
x = t;
return r;
}
快速幂求单个逆元:
int qpow(long long a,int b){
int ans = 1;
a = ( a % p + p ) % p;
for(;b; b >>= 1){
if(b & 1) ans = (a * ans) % p;
a = (a * a) % p;
}
return ans;
}
线性求1~n的逆元:
inv[1] = 1;
for(int i = 2;i <= n;i ++){
inv[i] = (long long)( p - p / i ) * inv[p % i] % p;
}
线性求任意n个数的逆元
s[0] = 1;
for(int i = 1;i <= n;i ++){
scanf("%d",&a[i]);
s[i] = s[i - 1] * a[i] % p;//求前n项积
}
sv[n] = qpow(s[n],p - 2);//前n项积的逆元
//求每一项逆元
for(int i = n;i >= 1;i --) sv[i - 1] = sv[i] * a[i] % p;
for(int i = 1;i <= n;i ++) inv[i] = s[i - 1] * sv[i] % p;
好题(错排+组合数)
中国剩余定理
具体推导可以看这个博客
nt CRT(int a[],int m[],int n){
int M = 1;
int ans = 0;
for(int i = 1;i <= n;i ++)
M *= m[i];
for(int i = 1;i <= n;i ++){
int Mi = M / m[i];
int x,y;
exgcd(Mi,m[i],x,y);
ans = (ans + Mi * x * a[i]) % M;
}
if(ans < 0) ans += M;
return ans;
}
例题: POJ-Biorhythms
AC代码:
#include<cstdio>
//int qpow(int a,int b,int p){
// int ans = 1;
// a = (a % p + p) % p;
// for(; b; b >>= 1){
// if(b & 1) ans = ans * a % p;
// a = a * a % p;
// }
// return ans;
//}
void exgcd(int a,int b,int& x,int& y){
if(b == 0){
x = 1;
y = 0;
return;
}
exgcd(b, a % b, x, y);
int t = y;
y = x - (a / b) * y;
x = t;
}
int CRT(int a[],int m[],int n){
int M = 1;
int ans = 0;
for(int i = 1;i <= n;i ++)
M *= m[i];
for(int i = 1;i <= n;i ++){
int Mi = M / m[i];
int x,y;
exgcd(Mi,m[i],x,y);
ans = (ans + Mi * x * a[i]) % M;
}
if(ans < 0) ans += M;
return ans;
}
int main(){
int p,e,i,d,kase = 1;
int a[4] = {0},m[4] = {0};
m[1] = 23,m[2] = 28,m[3] = 33;
while(~scanf("%d%d%d%d",&p,&e,&i,&d) && p >= 0){
a[1] = p,a[2] = e,a[3] = i;
int ans = CRT(a,m,3);
if(ans <= d) ans += 21252;
printf("Case %d: the next triple peak occurs in %d days.\n", kase++, ans-d);
}
return 0;
}