4524889_wa.cpp

部分PKU上的源码

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int phone[10][10][10][10][10][10][10];
vector<string> result;
string change(string input)
{
	string temp;
	for(int count=0;count<input.length();count++)
	{
		if(input[count]=='-') continue;
		if(input[count]=='Q'||input[count]=='Z') return temp;
		if(input[count]>='0'&&input[count]<='9') {temp+=input[count];continue;}
		if(input[count]>='A'&&input[count]<='C') temp+='2';
 else  if(input[count]>='D'&&input[count]<='F') temp+='3';
 else  if(input[count]>='G'&&input[count]<='I') temp+='4';
 else  if(input[count]>='J'&&input[count]<='L') temp+='5';
 else  if(input[count]>='M'&&input[count]<='O')temp+='6';
 else  if(input[count]>='P'&&input[count]<='S') temp+='7';
 else  if(input[count]>='T'&&input[count]<='V')temp+='8';
 else  if(input[count]>='W'&&input[count]<='Y') temp+='9';
	}
	return temp;
}
void pp(string a)
{
	if(a.length()<7) return;
	phone[a[0]-'0'][a[1]-'0'][a[2]-'0'][a[3]-'0'][a[4]-'0'][a[5]-'0'][a[6]-'0']++;
	if(phone[a[0]-'0'][a[1]-'0'][a[2]-'0'][a[3]-'0'][a[4]-'0'][a[5]-'0'][a[6]-'0']>=2) result.push_back(a);
}
void output()
{
	if(result.size()==0) {cout<<"No duplicates.";return;}
	sort(result.begin(),result.end());
	for(int count=0;count<result.size();count++)
	{
		string a=result[count];
		if(count!=0) cout<<endl;
		cout<<a[0]
			<<a[1]
			<<a[2]<<'-'
			<<a[3]
			<<a[4]
			<<a[5]
			<<a[6]<<" "<<phone[a[0]-'0'][a[1]-'0'][a[2]-'0'][a[3]-'0'][a[4]-'0'][a[5]-'0'][a[6]-'0'];
	}

}
int main()
{
	int number;
	cin>>number;
	memset(phone,0,sizeof(phone));
	for(int count=0;count<number;count++)
	{
		string input;
		cin>>input;
		pp(change(input));
	}
	output();
	return 0;
}