POJ 1002

Description

Sample Input
12
4873279
ITS-EASY
888-4567
3-10-10-10
888-GLOP
TUT-GLOP
967-11-11
310-GINO
F101010
888-1200
-4-8-7-3-2-7-9-
487-3279

Sample Output
310-1010 2
487-3279 4
888-4567 3

在POJ的discuss处发现一位大佬的代码，非常赏心悦目：

#include<iostream>
#include<cstring>
#include <cstdio>
#include<stdio.h>
#include <algorithm>
using namespace std;
char s[31];
int Hash()
{
 int sum = 0;
 for (int i = 0, k = 0; k < 7; i++)
 {
  if (s[i] >= '0'&&s[i] <= '9')
  {
   sum *= 10; k++;
   sum += (s[i] - '0');
  }
  else if (s[i] >= 'A'&&s[i] < 'Z')
  {
   sum *= 10; k++;
   sum += ((s[i] - 'A' - (s[i] > 'Q')) / 3 + 2);
  }
 }
 return sum;
}

``

int main()
{
 int n; cin>>n;
 int *data=new int[n]; getchar();
 for (int tmp = 0; tmp < n; tmp++)
 {
  gets_s(s);
  data[tmp] = Hash();
 }
 sort(data, data + n);
 bool p = false; n--;
 for (int i = 0, num = 1; i < n; i += num = 1)
 {
  while (data[i] == data[i + 1])
  {
   num++;
   i++;
  }
  if (num > 1)
  {
   printf("%03d-%04d %d\n", data[i] / 10000, data[i] % 10000, num);
   p = true;
  }
 }
 if (!p)printf("No duplicates.\n");
 return 0;
}