Peng Wang Totoro97

## qtree4
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <ctime>
#include <cstdlib>
#define R(a) (abs(rand() * rand() + rand()) % (a) + 1)
#define sf(a) { key[a] = R(1000010); }
#define INF (1 << 29)
#define maxn 100100
#define Maxn 3101000

## 计算几何基本运算.cpp
#include <cstdio> //全是对着白书写的。。。。
#include <cstring>
#include <algorithm>
#include <cmath>
#define INF 100000000
#define eps (1e-10)
using namespace std;
struct point {
	double x,y;
	point(double x = 0,double y = 0) {

## 旋转卡壳.cpp
// ps 写了两个旋转卡壳两个凸包 怎么拍都拍不瓦 就是过不了POJ
// update : 已经可以过了！ 把 %lf 改成 %d 就好了。。。 晕死
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define eps (1e-15)
#define maxn 50100
using namespace std;
struct point {

## archery.cpp
#include <cstdio> // nice T_T...
#include <cstring>
#include <cmath>
#include <algorithm>
#define maxn 100100
#define INF 1000010000
#define eps (1e-16)
#define pi 3.1415926535898
#define tpi 6.2831853071796
using namespace std;

## bzoj 1035.cpp
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#define INF 1000000000
#define eps (1e-10)
#define maxn 610
#define maxm 4010

## bzoj 3051.cpp
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
#include <cmath>
#include <set>
#define maxn 100010
#define eps (1e-10)
#define pi 3.1415926535898
#define tpi 6.2831853071796

## bzoj 2818.cpp
#include <cstdio>
#include <cstring>
#include <algorithm>
#define intl long long
#define maxn 10000100
using namespace std;
int i,j,k,l,m,n,top;
int pri[maxn],done[maxn];
intl phi[maxn],ans;
int main() {

## SPOJ VLATTICE.cpp
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 1001000
#define N 1000010
#define intl long long
using namespace std;
int i,j,k,l,m,n,top,T,t;
int mu[maxn],pri[maxn],done[maxn],mark[maxn];
intl ans;

## bzoj 2820.cpp
#include <cstdio>
#include <cstring>
#include <algorithm>
#define intl long long
#define maxn 10000100
#define N 10000000
using namespace std;
int i,j,k,l,m,n,top,t,T,a,b;
int pri[maxn],mu[maxn],mark[maxn];
intl g[maxn],ans;

## WC 2014 space.cpp
#include <cstdio>
#include <cstring>
#include <algorithm>
#define INF (1 << 30)
#define maxm 100200
#define mo 10007
#define M 100100
#define maxn 22
#define N 20
using namespace std;
	#include <cstdio>
	#include <cstring>
	#include <algorithm>
	#include <ctime>
	#include <cstdlib>
	#define R(a) (abs(rand() * rand() + rand()) % (a) + 1)
	#define sf(a) { key[a] = R(1000010); }
	#define INF (1 << 29)
	#define maxn 100100
	#define Maxn 3101000
	#include <cstdio> //全是对着白书写的。。。。
	#include <cstring>
	#include <algorithm>
	#include <cmath>
	#define INF 100000000
	#define eps (1e-10)
	using namespace std;
	struct point {
	double x,y;
	point(double x = 0,double y = 0) {
	// ps 写了两个旋转卡壳两个凸包怎么拍都拍不瓦就是过不了POJ
	// update : 已经可以过了！把 %lf 改成 %d 就好了。。。晕死
	#include <cstdio>
	#include <cstring>
	#include <algorithm>
	#include <cmath>
	#define eps (1e-15)
	#define maxn 50100
	using namespace std;
	struct point {
	#include <cstdio> // nice T_T...
	#include <cstring>
	#include <cmath>
	#include <algorithm>
	#define maxn 100100
	#define INF 1000010000
	#define eps (1e-16)
	#define pi 3.1415926535898
	#define tpi 6.2831853071796
	using namespace std;