前言
今天作者来给大家整理一下数论的模板,喜欢的可以点赞收藏
ex_gcd \texttt{ex\_gcd} ex_gcd
#include<bits/stdc++.h>
using namespace std;
void ex_gcd(int a,int b,int &x,int &y){//求a*x+b*y=gcd(a,b)的整数解
if(!b){
x=1;
y=0;
return;
}
ex_gcd(b,a%b,y,x);
y-=(a/b)*x;
}
int main(){
int a,b,x,y;
cin>>a>>b;
ex_gcd(a,b,x,y);
cout<<x<<' '<<y;
return 0;
}
逆元
I. \texttt{I.} I.费马小定理求逆元
#include<bits/stdc++.h>
using namespace std;
int power(int a,int b,int p){
int ans=1;
while(b){
if(b&1)ans=ans*a%p;
a=a*a%p;b>>=1;
}
return ans;
}
int inv(int x,int p){
return power(x,p-2,p);
}
int main(){
int x,p;
cin>>x>>p;
cout<<inv(x,p);
return 0;
}
II. \texttt{II.} II.线性求逆元求逆元
#include<bits/stdc++.h>
using namespace std;
const int N=3e6+7;
int n,p;
long long inv[N];
int main(){
cin>>n>>p;
inv[1]=1;
for(int i=2;i<=n;i++)
inv[i]=(p-p/i)*inv[p%i]%p;
for(int i=1;i<=n;i++){
cout<<inv[i]<<" ";
}
return 0;
}
III. \texttt{III.} III.扩展欧几里德求逆元
#include<bits/stdc++.h>
using namespace std;
void ex_gcd(int a,int b,int &x,int &y){//求a*x+b*y=gcd(a,b)的整数解
if(!b){
x=1;
y=0;
return;
}
ex_gcd(b,a%b,y,x);
y-=(a/b)*x;
}
int get_inv(int a,int p){
int x,y;
ex_gcd(a,p,x,y);
x=(x%p+p)%p;//求最小的逆元
return x;
}
int main(){
int a,p;
cin>>a>>p;
cout<<get_inv(a,p);;
return 0;
}
中国剩余定理
《中国剩余定理( CRT \texttt{CRT} CRT 与 EXCRT \texttt{EXCRT} EXCRT )》
I.CRT \texttt{I.CRT} I.CRT
例题:P1495
代码:
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=20;
ll a[N],m[N];
ll n;
ll x,y;
void exgcd(ll a,ll b,ll &x,ll &y){
if(!b)x=1,y=0;
else exgcd(b,a%b,y,x),y-=(a/b)*x;
}
ll china(){
ll lcm=1,ans=0;
for(ll i=1;i<=n;i++)lcm*=m[i];
for(ll i=1;i<=n;i++){
ll Mi=lcm/m[i];
exgcd(Mi,m[i],x,y);
x=(x%m[i]+m[i])%m[i];
ans=ans+x*Mi%lcm*a[i]%lcm;
ans=ans%lcm;
}
return (ans+lcm)%lcm;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>m[i]>>a[i];
}
cout<<china();
return 0;
}
II.EXCRT \texttt{II.EXCRT} II.EXCRT
例题:P4777
代码:
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n;
ll gcd(ll a,ll b){
ll r=a%b;
while(r){
a=b;
b=r;
r=a%b;
}
return b;
}
void ex_gcd(ll a,ll b,ll &x,ll &y){
if(!b) x=1,y=0;
else ex_gcd(b,a%b,y,x),y-=(a/b)*x;
}
ll power(ll a,ll b,ll p){
ll ans=0;
while(b){
if(b&1)ans=(ans+a)%p;
a=(a+a)%p;
b>>=1;
}
return ans;
}
int main(){
ll m2,a2,m,ans;
cin>>n;
bool as=0;
scanf("%lld%lld",&m,&ans);
for (int i=2;i<=n;i++){
scanf("%lld%lld",&m2,&a2);
a2=(a2-ans%m2+m2)%m2;
ll d=gcd(m2,m),x,y;
if(a2%d)as=1;
ex_gcd(m,m2,x,y);
x=power(x,a2/d,m2);
ans+=x*m;
m*=m2/d;
ans=(ans%m+m)%m;
}
if(as)printf("-1\n");
else printf("%lld\n",ans);
return 0;
}
欧拉函数
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+6;
int n,cnt;
int v[N],prime[N],phi[N];
void euler(int n){
phi[1]=1;
for(int i=2;i<=n;i++){
if(!v[i]){
v[i]=i;
prime[++cnt]=i;
phi[i]=i-1;
}
for(int j=1;j<=cnt;j++){
if(prime[j]>v[i]||prime[j]>n/i)break;
v[i*prime[j]]=prime[j];
if(i%prime[j]==0)
{
phi[prime[j]*i]=phi[i]*prime[j];
break;
}
else phi[prime[j]*i]=phi[i]*(prime[j]-1);
}
}
return;
}
int main(){
cin>>n;
euler(n);
for(int i=1;i<=n;i++)
cout<<phi[i]<<' ';
return 0;
}
线性筛
#include<bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int cnt,n;
int v[N];
int prime[N];
void primes(int n){
for(int i=2;i<=n;i++){
if(v[i]){
continue;
}
prime[++cnt]=i;
for(int j=1;j<=n/i;j++){
v[i*j]=1;
}
}
}
int main(){
cin>>n;
primes(n);
for(int i=1;i<=cnt;i++)
cout<<prime[i]<<' ';
return 0;
}