竞赛头文件板子（数学）

击剑的剑没有剑柄

已于 2022-01-21 10:41:00 修改

阅读量139

点赞数 1

分类专栏：算法文章标签： c++ c语言

于 2022-01-18 17:50:10 首次发布

本文链接：https://blog.youkuaiyun.com/qq_52060151/article/details/122565096

版权

算法专栏收录该内容

15 篇文章

订阅专栏

竞赛头文件板子（数学）

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#define INF 0x3f3f3f3f
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<long,long> PLL;
typedef map<string,int> MSI;

const int N = 1e6 + 10;
const int mod = 1e9 + 7;

int read()
{
    char s = getchar();
    int sum = 0 , k = 1;
    
    while(s < '0' && s > '9'){ if(s == '-') k = -1; s = getchar(); }
    while(s >= '0' && s <= '9'){ sum = sum * 10 + (s - '0'); s  = getchar(); }
    
    return sum * k;
}

int add(int a , int b)
{
    int s = a + b;
    while(s < 0) s += mod;
    while(s >= mod) s = s - mod;
    
    return s;
}

int mul(int a , int b)
{
    return 1ll * a * b % mod;
}

int binpow(int a , int b)
{
    int c = 1;
    
    while(b){
        if(b & 1) c = mul(c , a);
        a = mul(a , a);
        b >>= 1;
    }
    return c;
}

int inv(int x)
{
    return binpow(x , mod - 2);
}

int divide(int a , int b)
{
    return mul(a , inv(b));
}

int exgcd(int a,int b,int &x,int &y)//求同余方程
{
	if(!b){
		x = 1;
		y = 0;
		return a;
	}
	int gd = exgcd(b , a % b , x , y);
	int temp = x;
	x = y;
	y = temp - (a / b)*y; 
	return gd;
}

void solve()
{
    
}

int main()
{
    int tt = read();
    while(tt --){
        solve();
        if(tt) puts("");
    }
}