Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
00001 #ifndef H_TEMPLATE 00002 #define H_TEMPLATE 00003 00006 00007 #include <stdio.h> 00008 #include <algorithm> 00009 #include <queue> 00010 #include <stack> 00011 #include <utility> 00012 #include <cmath> 00013 #include <iostream> 00014 00015 #include <list> 00016 #include <set> 00017 #include <map> 00018 00019 using namespace std; 00020 00021 typedef long long int ll; 00022 typedef long double ld; 00023 00024 typedef pair<int,int> PII; 00025 00026 #define FOR(q,n) for(int q = 0; q < (int) n; ++q) 00027 #define FOREACH(it, container) for( \ 00028 __typeof(container.begin()) it = container.begin(); \ 00029 it != container.end(); ++it) 00030 00031 // shorthands 00032 #define fi first 00033 #define se second 00034 #define mp make_pair 00035 #define pb push_back 00036 00038 #endif