wa,总是000-0000 code:
#include <iostream>
#include <map>
#include <string>
#include <vector>
#include <cctype>
#include <algorithm>
#include <cstdio>
using namespace std;
namespace UVa755
{
char qp[]="2223334445556667\077888999\0";
int id(char c)
{
if(isalpha(c))return qp[c-'A']-'0';
else return c-'0';
}
int enter()
{
char s;int q=0;
while(cin>>s&&s!='\n')
{
if(s!='-')q=(q*10+id(s));
}
return q;
}
void out(int i)
{
printf("%03d-%04d",i/10000,i%10000);
}
map<int,int> m;
vector<int> dups;
int T,n;
}using namespace UVa755;
int main()
{
ios::sync_with_stdio(0);
freopen("755.txt","r",stdin);
cin>>T;
while(T--)
{
m.clear();
dups.clear();dups.resize(0);
cin>>n;
for(int i=0;i<n;i++)
{
int temp=enter();
if(m[temp]==1)dups.push_back(temp);
if(m.count(temp))m[temp]++;else m[temp]=1;
}
sort(dups.begin(),dups.end());
for(int i=0;i<dups.size();i++)
{
out(dups[i]);
cout<<' '<<m[dups[i]]<<endl;
}
if(dups.size()==0)cout<<"No duplicates."<<endl;
cout<<endl;
}
}