poj 487-3279 （方便记忆的电话号码）

渣扎一枚……hiahia

不过，能ac的代码都是好代码（考试而言）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
typedef pair<string,int> psi;
int Map[30] = {2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,9,0};
int HashTable[10][10][10][10][10][10][10];
map<string,int> Telefonnummer;
int main() {
	int n; scanf("%d",&n);
	while (n--) {
		int t[7]; int ptr = 0;
		string str; cin >> str;
		int len = str.length();
		for (int i = 0; i < len; i++) {
			if (str[i] == '-') continue;
			else if (str[i] >= 'A' && str[i] <= 'Z')
				t[ptr++] = Map[str[i] - 'A'];
			else if (str[i] >= 'a' && str[i] <= 'z')
				t[ptr++] = Map[st