google code jam template

gistfile1.cpp

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <list>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cstdio>

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int, int> PII;
typedef long long ll;
#define PB push_back
#define SZ(a) int((a).size())
#define ALL(c) (c).begin(), (c).end()
#define TR(c, i) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(ALL(c),x) != (c).end())
#define debug(var) cout<<#var<<"="<<(var)<<endl


void func()
{
}

int main()
{
    int t;
    cin >> t;
    for(int ti = 1; ti <= t; ti++)
    {
        cout << "Case #" << ti << ":";
        func();
    }
}