本文旨在提供ACM算法竞赛的一些头文件和预处理模版, 也请大家留言添加
#include <bits/stdc++.h> #define mem(ar,num) memset(ar,num,sizeof(ar)) #define me(ar) memset(ar,0,sizeof(ar)) #define lowbit(x) (x&(-x)) #define Pb push_back #define FI first #define SE second #define For(i,a,b) for(int i = a; i < b; ++i) #define IOS ios::sync_with_stdio(false) using namespace std; typedef long long LL; typedef unsigned long long ULL; const int prime = 999983; const int INF = 0x7FFFFFFF; const LL INFF =0x7FFFFFFFFFFFFFFF; const double pi = acos(-1.0); const double inf = 1e18; const double eps = 1e-6; const LL mod = 1e9 + 7; LL qpow(LL a,LL b){LL s=1;while(b>0){if(b&1)s=s*a%mod;a=a*a%mod;b>>=1;}return s;} LL gcd(LL a,LL b) {return b?gcd(b,a%b):a;} int dr[2][4] = {1,-1,0,0,0,0,-1,1}; typedef pair<int,int> P; int main(void) { return 0; }或者有一些oj不支持万能头文件
//#include<bits/stdc++.h> #include <cstdio>//C语言io #include <cstring>//以下是c语言常用头文件 #include <cmath> #include <cstdlib> #include <ctime> #include <cctype> #include <cstring> #include <cmath> #include <iostream>//c++IO #include <sstream> #include <string> #include <list>//c++常用容器 #include <vector> #include <set> #include <map> #include <queue> #include <stack> #include <algorithm>//c++泛型的一些函数 #include <functional>//用来提供一些模版 #define mem(ar,num) memset(ar,num,sizeof(ar)) #define me(ar) memset(ar,0,sizeof(ar)) #define lowbit(x) (x&(-x)) using namespace std; typedef long long LL; typedef unsigned long long ULL; const int prime = 999983; const int INF = 0x7FFFFFFF; const LL INFF =0x7FFFFFFFFFFFFFFF; const double pi = acos(-1.0); const double inf = 1e18; const double eps = 1e-6; const LL mod = 1e9 + 7; //...................................................... int main(void) { std::ios::sync_with_stdio(false); printf("Strive.for.excellence"); return 0; }