Song GUO erjiaqing

## bzoj2243.cpp
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
const int maxn=444444;
const int ls(const int &x){return x<<1;}
const int rs(const int &x){return x<<1|1;}

## bzoj3530.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
struct TrieNode{
	int flag,fail,next[10];
}T[1505];
int f[1205][1505][2];

## bzoj1193.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <utility>
using namespace std;
#define x first
#define y second
const int dx[]={ 1, 1,-1,-1, 2, 2,-2,-2},

## bzoj2330.cpp
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <utility>
#include <queue>
using namespace std;
#define x first
#define y second

## bzoj2300.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;
//-- 浮点数运算
const double eps=1e-8;
bool _l (double a,double b){return a<b-eps;}

## 3109.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
//...
char s[5];
//...
int Big[10][10][10],pos;
//...

## bzoj3108.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=305;
int n,m,k,u,v;
bool Map[maxn][maxn];
bool Check()
{

## bzoj3107.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int f[2][35][35][35][2];
int GetBit1(int x)
{
    int ret=0;
    while (x)

## bzoj3106.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=21;
int f[maxn][maxn][maxn][maxn][maxn*3][2];
int n;
int abs(int a)
{

## bzoj2337.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>

#define v first
#define c second
	#include <algorithm>
	#include <iostream>
	#include <cstdio>
	#include <cstring>
	#include <cmath>
	#include <vector>
	using namespace std;
	const int maxn=444444;
	const int ls(const int &x){return x<<1;}
	const int rs(const int &x){return x<<1\|1;}