oj头文件

转自：
http://blog.csdn.net/weizhuwyzc000/article/details/49469999

#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<string>#include<vector>#include<stack>#include<bitset>#include<cstdlib>#include<cmath>#include<set>#include<list>#include<deque>#include<map>#include<queue>using namespace std;typedef long long ll;const double PI = acos(-1.0);const double eps = 1e-6;const int INF = 1000000000;const int maxn = 100;int T,n,m;int main() {    scanf("%d",&T);    while(T--) {    }    return 0;}