SF-Zhou

## cf.449B.cpp
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;

#define ff(i, n) for (int i = 0, END = (n); i < END; i ++)
#define fff(i, n, m) for (int i = (n), END = (m); i <= END; i ++)
#define dff(i, n, m) for (int i = (n), END = (m); i >= END; i --)

## 2017.netease.distribute.biscuit.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <unordered_map>
using namespace std;

## 2017.netease.dual.core.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <unordered_map>
using namespace std;

## 2017.netease.to.company.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <unordered_map>
using namespace std;

## 2017.netease.clear.redundancy.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <unordered_map>
using namespace std;

## 2017.netease.distribute.work.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <unordered_map>
using namespace std;

## 2017.netease.set.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>

## 2017.netease.expression.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>

## 2017.netease.brick.cpp
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>

## HashTable.hpp
// Copyright [2018] <Copyright SF-Zhou>
// Author: SF-Zhou
// Email: sfzhou.scut@gmail.com

#ifndef HASHTABLE_HPP_
#define HASHTABLE_HPP_

#include <cstring>

namespace Utils {
	#include <iostream>
	#include <cstdio>
	#include <cstring>
	#include <vector>
	#include <queue>
	using namespace std;

	#define ff(i, n) for (int i = 0, END = (n); i < END; i ++)
	#define fff(i, n, m) for (int i = (n), END = (m); i <= END; i ++)
	#define dff(i, n, m) for (int i = (n), END = (m); i >= END; i --)
	#include <iostream>
	#include <string>
	#include <cstdio>
	#include <cstring>
	#include <vector>
	#include <queue>
	#include <cmath>
	#include <unordered_map>
	using namespace std;
	// Copyright [2018] <Copyright SF-Zhou>
	// Author: SF-Zhou
	// Email: sfzhou.scut@gmail.com

	#ifndef HASHTABLE_HPP_
	#define HASHTABLE_HPP_

	#include <cstring>

	namespace Utils {