acm板子自用

爱吃土豆的鸡蛋

已于 2023-05-05 22:16:50 修改

阅读量164

点赞数

文章标签： c++ 图论算法

于 2023-05-05 21:43:40 首次发布

本文链接：https://blog.csdn.net/m0_65929214/article/details/130515916

版权

数学

线性筛法筛质数

const int N= 1000010;

int primes[N], cnt;
bool st[N];

void get_primes(int n)
{
   
    for (int i = 2; i <= n; i ++ )
    {
   
        if (!st[i]) primes[cnt ++ ] = i;
        for (int j = 0; primes[j] <= n / i; j ++ )
        {
   
            st[primes[j] * i] = true;
            if (i % primes[j] == 0) break;
        }
    }
}

int main()
{
   
    int n;
    cin >> n; get_primes(n);

    cout << cnt << endl;
    return 0;
}

乘法逆元

#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 100010, mod = 1e9 + 7;
int fact[N], infact[N];
int qmi(int a, int k, int p)
{
   
    int res = 1;
    while (k)
    {
   
        if (k & 1) res = (LL)res * a % p;
        a = (LL)a * a % p;
        k >>= 1;
    }
    return res;
}
int main()
{
   
    fact[0] = infact[0] = 1;
    for (int i = 1; i < N; i ++ )
    {
   
        fact[i] = (LL)fact[i - 1] * i % mod;
        infact[i] = (LL)infact[i - 1] * qmi(i, mod - 2, mod) % mod;
    }


    int n;scanf("%d", &n);
    while (n -- )
    {
   
        int a, b;scanf("%d%d", &a, &b);
        printf("%d\n", (LL)fact[a] * i