> #include<iostream>
> #include<map>
> #include<string>
> using namespace std;
> char tmp[10000];
> string s="1234567";
> map<string,int> inch;
> map<string,int>::const_iterator iter,begin,end;
> int n,i,len;
> int key[26] = {'2','2','2','3','3','3','4','4','4',
>          '5','5','5','6','6','6','7','7','7','7','8','8','8','9','9','9','9'};
> int main()
> {
>     cin>>n;
>     while(n--)
>     {
>         cin>>tmp;
>         len = 0;
>         for(i=0; tmp[i]!=0; i++)
>             if(tmp[i]<='9'&&tmp[i]>='0')
>                 s[len++] = tmp[i];
>             else
>                 if(tmp[i]<'Z'&&tmp[i]>='A')
>                     s[len++] = key[tmp[i]-'A'];
>         if(inch.find(s)==inch.end())
>             inch[s] = 1;
>         else
>             inch[s] += 1;    
>     }
>     begin = inch.begin();
>     end = inch.end();
>     while(begin!=end)
>     {
>         if(begin->second>1)
>         {   
>             cout<<begin->first[0]<<begin->first[1]<<begin->first[2]<<"-"
>                 <<begin->first[3]<<begin->first[4]<<begin->first[5]<<begin->first[6];
>             cout<<" "<<begin->second<<endl;
>         }    
>         begin++;
>     }
>   //  system("pause");        
>     return 0;
> }  

• 什么意思？还是WA,仿佛在最后一个数据WA (1011) sunmoonstar_love 2005-08-08 00:45:37
  • If there are no duplicates in the input print the line: no duplicates (1099) fffggg 2005-08-08 00:47:19
    • 。。。。。。。。。无语，读题不仔细，又栽跟头了 (0) sunmoonstar_love 2005-08-08 00:48:15
      • 谢谢，终于改成TLE了，不容易 (0) sunmoonstar_love 2005-08-08 00:50:33
  • 某人快来帮我调 (1099) sunmoonstar_love 2005-08-08 00:47:36
    • good (0) frkstyc 2005-08-08 00:57:21
    • 你不加排序怎么可能过？可怜我陪你一起写到这么晚。下面是我的，共参考。 (1720) tengshengbo 2005-08-08 01:11:22
      • 字符串排序会慢的…… (1878) frkstyc 2005-08-08 01:14:51
    • 我突然想起，map是自动排序的。不好意思，我先睡了。 (0) tengshengbo 2005-08-08 01:14:43
      • .... (0) sunmoonstar_love 2005-08-08 01:16:24