#include <cstdio> #include <cstring> #include <iostream> #include <cmath> #include <ctime> #include <cstdlib> #include <map> #include <set> #include <algorithm> #include <queue> #include <deque> #include <bitset> #include <string> #include <vector> #include <sstream> #define zero(a) (abs(a)<eps) #define lowbit(a) ((a)&(-(a))) #define abs(a) ((a)>0?(a):(-(a))) #define dj(x1,y1,x2,y2) ((x1)*(x2)+(y1)*(y2)) #define cj(x1,y1,x2,y2) ((x1)*(y2)-(x2)*(y1)) #define dis(x1,y1,x2,y2) (((x2)-(x1))*((x2)-(x1))+((y2)-(y1))*((y2)-(y1))) #define REP(i,n) for(int i=0;i<n;i++) #define TR(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++) #define SORT(x) sort(ALL(x)) #define CLEAR(x) memset(x,0,sizeof(x)) #define FILL(x,c) memset(x,c,sizeof(x)) #define FOR(i, a, b) for(int i =(a); i <=(b); ++i) #define FORD(i, a, b) for(int i = (a); i >= (b); --i) #define fup FOR #define fdo FORD #define REP(i, n) for(int i = 0;i <(n); ++i) #define VAR(v, i) __typeof(i) v=(i) #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((int)(x).size()) #define siz SZ #define CLR(x) memset((x), 0, sizeof(x)) #define PB push_back #define MP make_pair #define SQR(a) ((a)*(a)) #define DEBUG 1 #define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; } #define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FORE(it, (x)) cerr <<*it <<", "; cout <<endl; }} using namespace std; typedef long long LL; typedef long double LD; typedef pair<int, int>P; typedef vector<int>VI; const int INF=1E9+7; template<class C> void mini(C&a4, C b4){a4=min(a4, b4); } template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); } const double eps = 1e-9; const double pi = acos(-1); const int oo = 1000000000; const int mod = 1000000007; const double E = 2.7182818284590452353602874713527; int main(){ freon("file.in","r",stdin); freon("file.out","w",stdout); }
C++ 头文件 宏定义
最新推荐文章于 2024-02-01 17:10:53 发布