Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
src/template/template.h File Reference
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <stack>
#include <utility>
#include <cmath>
#include <iostream>
#include <list>
#include <set>
#include <map>
Include dependency graph for template.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Defines

#define FOR(q, n)   for(int q = 0; q < (int) n; ++q)
#define FOREACH(it, container)
#define fi   first
#define se   second
#define mp   make_pair
#define pb   push_back

Typedefs

typedef long long int ll
typedef long double ld
typedef pair< int, int > PII

Define Documentation

#define fi   first
#define FOR (   q,
 
)    for(int q = 0; q < (int) n; ++q)
#define FOREACH (   it,
  container 
)
Value:
for( \
        __typeof(container.begin()) it = container.begin(); \
        it != container.end(); ++it)
#define mp   make_pair
#define pb   push_back
#define se   second

Typedef Documentation

typedef long double ld
typedef long long int ll
typedef pair<int,int> PII
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines