乘法逆元，组合数

前置知识：快速幂

乘法逆元

        相关知识：

                费马小定理---在取模意义下：1/ a == (mod p<p为质数>);

代码 

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const int N = 2e6 + 9;
const ll p = 998244353;
ll qmi(ll a, ll b) //快速幂
{
	ll res = 1;
	while (b)
	{
		if (b & 1) res = res * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return res;
}
ll inv(ll x) //乘法逆元
{ 
	return qmi(x, p - 2);
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		ll a, b, c, q;
		cin >> a >> b >> c >> q;
		while (q--)
		{
			ll x;
			cin >> x;
			cout << (((a * x % p) + b) % p * inv(c * x % p)) % p << '\n';
		}
	}
	return 0;
}

---

 组合数

        

 

代码 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const int N = 1e7 + 9;
const ll p = 1e9 + 7;

ll fac[N];

ll qmi(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1) res = res * a % p;
        a = a * a % p; b >>= 1;
    }
    return res;
}

ll inv(ll x) {return qmi(x, p - 2); }

void init(int n)
{
    fac[0] = 1;
    for(int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;
}

ll C(int n, int m)
{
    if(n < 0 || m < 0 || n < m) return 0;
    return fac[n] * inv(fac[n - m] * fac[m] % p) % p;
}


void solve()
{
    int n, m; cin >> n >> m;
    cout << C(n, m) << '\n';
}


int main()
{
    ios::sync_with_stdio(0), cin.tie(0),cout.tie(0);
    init(1e7);
    int _; cin >> _;
    while(_--) solve();
    return 0;
}