TopCoder C++ template

$BEGINCUT$
#define _CRT_SECURE_NO_DEPRECATE
#include <ctime>
$ENDCUT$

#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <map>
#include <set>
using namespace std;

#define sz(x) int((x).size())
#define FOR(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define ROF(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define rep(i,n) for (int (i) = 0; (i) < (n); ++(i))
#define fe(i,a) for (int (i) = 0; (i) < int((a).size()); ++(i))
#define C(a) memset((a),0,sizeof(a))
#define inf 1000000000
#define pb push_back
#define ppb pop_back
#define all(c) (c).begin(), (c).end()
#define pi 2*acos(0.0)
#define sqr(a) (a)*(a)
#define mp(a,b) make_pair((a), (b))
#define X first
#define Y second

typedef vector<int> vint;
typedef long long ll;
typedef pair<int, int> pii;

class $CLASSNAME$
     {
          public:
             $RC$ $METHODNAME$( $METHODPARMS$ )
           {

              }
     };

$BEGINCUT$

#include <limits>
inline bool isnan(double a)
{
    return (std::numeric_limits<double>::quiet_NaN() == a);
    // return a!=a;
}
inline bool isinf(double a)
{
    return (std::numeric_limits<double>::infinity() == a);
}

$TESTCODE$

$DEFAULTMAIN$
$ENDCUT$