模板的日常~。~。。。（持续更新中...）

头文件&吧啦吧啦~

#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <math.h>
#include <time.h>
#include <vector>
#include <stdio.h>
#include <sstream>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
/***************************************/
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<string> VS;
typedef set<int> SI;
typedef set<string> SS;
typedef map<int ,int> MII;
typedef map<string,int> MSI;
typedef pair<int,int> PII;
typedef vector<PII> VII;
typedef vector<VI > VVI;
/***************************************/
#ifdef _WIN32
#define ll __int64
#else
#define ll long long
#endif

#define mem(a,b) memset(a,b,sizeof(a))
#define all(x)  (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define PB push_back
#define MP make_pair
#define LL(x) ((x)<<1)
#define RR(x) ((x)<<1|1)
#define sqr(x) ((x)*(x))
#define pn()  printf("
")
#define sqr(x) ((x)*(x))
/***************************************/
const int INF = 0x7f7f7f7f;
const ll LINF = (1LL<<60);
const double eps = 1e-8;
const double PIE=acos(-1.0);
const int dx[]= {0,-1,0,1};
const int dy[]= {1,0,-1,0};
const int fx[]= {-1,-1,-1,0,0,1,1,1};
const int fy[]= {-1,0,1,-1,1,-1,0,1};
/***************************************/
void openfile()
{
    freopen("data.in","rb",stdin);
    freopen("data.out","wb",stdout);
}
void Scan(int& res)
{
    int flag=0;
    char ch;
    while(!(((ch=getchar())>='0'&&ch<='9')||ch=='-'))
        if(ch==EOF)
            res=INF;
    if(ch=='-')
        flag=1;
    else if(ch>='0'&&ch<='9')
        res=ch-'0';
    while((ch=getchar())>='0'&&ch<='9')
        res=res*10+ch-'0';
    res=flag?-res:res;
}
void Out(int a)
{
    if(a>9)
        Out(a/10);
    putchar(a%10+'0');
}
void Out(ll a)
{
    if(a>9)
        Out(a/10);
    putchar(a%10+'0');
}
/**********************The End OF The Template*****************/

 

+++++++++++++++++++++++++++++++++++++++++++++ 

数论

+++++++++++++++++++++++++++++++++++++++++++++ 

欧几里得算法

long long gcd(long long a,long long b){
    return b==0?a:gcd(b,a%b);
}

扩展欧几里得算法

long long extgcd(long long a,long long b,long long& x,long long& y){
    long long d=a;
    if (b!=0){
        d=extgcd(b,a%b,y,x);
        y-=(a/b)*x;
    }
    else{
        x=1,y=0;
    }
    return d;
}

快速幂取余

typedef long long ll;
ll mod_pow(ll x,ll y,ll mod){
    ll res=1;
    while (n>0){
        if (n&1) res=res*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return res;
}

 

+++++++++++++++++++++++++++++++++++++++++++++++ 

图论

+++++++++++++++++++++++++++++++++++++++++++++++

+++++++++++++++++++++++++++++++++++++++++++++++

计算几何

+++++++++++++++++++++++++++++++++++++++++++++++