POJ_1002

#include <cstdlib>#include <iostream>#include <string>#include <vector>#include <algorithm>#include <stdio.h>#include <string.h>using namespace std;char charToNum(char c){ switch(c) { case 'A': case 'B': case 'C': return '2'; case 'D': case 'E': case 'F': return '3'; case 'G': case 'H': case 'I': return '4'; case 'J': case 'K': case 'L': return '5'; case 'M': case 'N': case 'O': return '6'; case 'P': case 'R': case 'S': return '7'; case 'T': case 'U': case 'V': return '8'; case 'W': case 'X': case 'Y': return '9'; default: return ' '; }}int main(int argc, char *argv[]){ //freopen("input.txt", "rt", stdin); //freopen("output.txt", "wt", stdout); int caseCount, tempCount; scanf("%d", &caseCount); tempCount = caseCount; vector<string> inputStr; vector<string> result; //char perStr[50] = {'/0'}; string perStr; while(tempCount-- > 0) { //memset(perStr, '/0', 50); //scanf("%s", perStr); cin >> perStr; int i = 0; //int count = strlen(perStr); string temp; for(; i < perStr.size(); i++) { if(isdigit(perStr[i])) temp += perStr[i]; else if(isalpha(perStr[i])) temp += charToNum(perStr[i]); } result.push_back(temp); } sort(result.begin(), result.end()); vector<string>::iterator it = result.begin(); int count = 1; int hasResult = 0; while(it != result.end()) { if((it + 1 ) != result.end() && *it == *(it + 1)) count++; else { if(count > 1) { //printf("%s-%s %d/n", (*it).substr(0, 3).c_str(), (*it).substr(3,4).c_str(), // count); cout << (*it).substr(0, 3) << "-" << (*it).substr(3, 4) << " " << count << endl; hasResult = 1; } count = 1; } it++; } if(hasResult == 0) printf("No duplicates./n"); return EXIT_SUCCESS;} 

实现不难， 就是用G++提交TLE, 用C++提交AC了...

 

先把输入的字符串根据规则处理成数字串， 然后sort下， 在对sort后的数组输出统计的结果就行了...