还记得这道题折磨我好久,答案对的,但是却一直过不了,郁闷死了。原来最后还是要排一下序的,不然总是Time out limited。
题意比较简单,将字符转换为相印的数字即可,解决存储问题和输出问题就OK了。排序用到了<algorithm>中的sort,比较高效的排序方法。这一题还可以用<map>类。
#include <iostream>
#include <iomanip>
#include <algorithm>
using namespace std;
#define N 100010
int number[N];
int main()
{
char words[200];
int word[10];
int n,k,sum;
scanf("%d/n",&n);
for(int i=0;i<n;i++)
{
gets(words);
k=0;
for(int j=0;j<strlen(words) && k!=7;j++)
{
if(words[j]>='0' && words[j]<='9') {word[k]=words[j]-'0';k++;}
else if(words[j]=='A' || words[j]=='B' || words[j]=='C' ) {word[k]=2 ;k++;}
else if( words[j]=='D'||words[j]=='E'||words[j]=='F' ){word[k]=3 ;k++;}
else if( words[j]=='G'||words[j]== 'H'||words[j]== 'I' ) {word[k]=4 ;k++;}
else if( words[j]=='J'||words[j]== 'K'||words[j]== 'L' ) {word[k]=5 ;k++;}
else if( words[j]=='M'||words[j]=='N'||words[j]=='O') {word[k]=6 ;k++;}
else if( words[j]=='P'||words[j]=='R'||words[j]=='S' ) {word[k]=7 ;k++;}
else if( words[j]=='T'||words[j]=='U'||words[j]=='V' ) {word[k]=8 ;k++;}
else if( words[j]=='W'||words[j]=='X'||words[j]=='Y') {word[k]=9 ;k++;}
}
sum=word[0]*1000000
+word[1]*100000
+word[2]*10000
+word[3]*1000
+word[4]*100
+word[5]*10
+word[6];
number[i]=sum;
}
sort(number,number+n);//排序
int save=-1;
int oo;
bool J=false;
k=0;
for(int i=0;i<=n;i++)
{
if(save!=number[i])
{
if(k>=2)
{
J=true;
oo=(int) (save/10000);
cout<<setw(3)<<setfill('0')<<oo<<'-';
oo=save-oo*10000;
cout<<setw(4)<<setfill('0')<<oo<<' '<<k<<endl;
}
save=number[i];
k=1;
}
else
{
k++;
}
}
if(J==false)
cout<<"No duplicates."<<endl;
//system("pause");
return 0;
}