C++ Coding Problem Template

template.cpp

#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<cstring>
#include<vector>
#include<list>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<utility>
#include<algorithm>
#include<map>
#include<numeric>
#include<limits>
#include<iomanip>
// for read file
// ifstream pfile; pfile.open("primes.txt"); while(!pfile.eof()){ long long val=0; pfile>>val; }
#include<fstream>
// for print binary
// char a = -58; bitset<8> x(a); cout<< x;
#include<bitset>
// to use limit -> numeric_limits<type>::max()

// to set precision after decimal point -->  cout.setf(ios::fixed,ios::floatfield);
using namespace std;

template <typename T, size_t N>
T* begin(T(&arr)[N]) { return &arr[0]; }
template <typename T, size_t N>
T* end(T(&arr)[N]) { return &arr[0]+N; }

typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef vector<int> VI;
// initialise -> VVI a(size,VI(subsize,0));
typedef vector<vector<int> > VVI;
typedef vector<double> VD;

#define IFOR(i, a, b) for(int i = (a); i < (b); ++i)
#define DFOR(i, a, b) for(int i = (a)-1; i>=(b);--i)
#define EFOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define RESET(a, b) memset(a, b, sizeof(a))
// for sorting --> sort(ALL(a))
#define ALL(a) (a).begin(), (a).end()
#define PB push_back
#define MP make_pair
#define REVERSE_INT greater<int>()

// find great common divisors
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) :a;}

int main(){
  int T;
  cin>>T;
  IFOR(t, 0, T){
    // get inputs
    // solution
    // print answers
    cout<< "Case #"<<t+1<<": impossible\n";
  }


  return 0;
}