线性求逆元

线性求n个数的逆元

不用p/i是为了防止出现负数

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) s[i] = s[i - 1] * a[i] % p;
sv[n] = qpow(s[n], p - 2);
for (int i = n; i >= 1; --i) sv[i - 1] = sv[i] * a[i] % p;
for (int i = 1; i <= n; ++i) inv[i] = sv[i] * s[i - 1] % p;

模板题

乘法逆元
数组注意开大到1e6就可以了

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
map<ll, ll> m;
ll inv[10000010];
int main() {
    ll n, p;
    cin >> n >> p;

    inv[1] = 1;
    printf("%lld\n", inv[1]);
    for (int i = 2; i <= n; i++) {
        inv[i] = (ll)(p - p / i) * inv[p % i] % p;
        printf("%lld\n", inv[i]);
    }

    return 0;
}

模板提2

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;	
map<ll,ll>m;
ll inv[5000010],a[5000100],sv[5000100],s[5000100];
ll quick(ll a, ll b, ll p) 
{
    ll ans=1;
    a=a%p;
    while(b)
	{
		if(b&1)ans=(ans*a)%p;
		a=(a*a)%p;
		b>>=1;
	}
//	cout<<"ans=="<<ans<<endl;
    return ans % p;
}
int main()
{

	ll n,p=1e9+7,ans=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	scanf("%lld",&a[i]);
	s[0]=1;
	for(int i=1;i<=n;i++)
	s[i]=s[i-1]*a[i]%p;
	sv[n]=quick(s[n],p-2,p);
//	printf("%lld      ", sv[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]=sv[i]*s[i-1]%p;
		inv[i] = sv[i] * s[i - 1] % p, ans = (1 * ans * 998244353 + 1 * inv[i]) % p;
	}
	cout<<ans;
	return 0;
 } 

同余方程

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;	
map<ll,ll>m;
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 = x;
        x = y;
        y = t - a/b*y;
}

int main()
{

	int a,b,x,y;
	scanf("%d%d",&a,&b);
	exgcd(a,b,x,y);
	if(x<0)x+=b;
	else if(x>b)x-=b;
	cout<<x<<endl;
	return 0;
 }