POJ1002

C++源代码：

// POJ1002.cpp

// 487-3279

// 2017.03.15by wyj

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <set>  
#include <map>  

using namespace std;

int num[] =
{
	2, 2, 2,
	3, 3, 3,
	4, 4, 4,
	5, 5, 5,
	6, 6, 6,
	7, 0, 7, 7,
	8, 8, 8,
	9, 9, 9
};

map<int, int> s;
char buf[128];

int main()
{
	int t;
	scanf_s("%d", &t);
	bool flag = false;
	for (int i = 0; i < t; i++)
	{
		scanf_s("%s", &buf,128);
		int c = 0;
		for (int j = 0; buf[j]; j++)
		{
			if (isdigit(buf[j]))
				c = c * 10 + buf[j] - '0';
			else if (isalpha(buf[j]))
				c = c * 10 + num[buf[j] - 'A'];
		}
		s[c]++;
	}
	for (map<int, int>::iterator it = s.begin(); it != s.end(); it++)
		if (it->second > 1)
		{
			flag = true;
			printf("%03d-%04d %d\n", it->first / 10000, it->first % 10000, it->second);
		}
	if (!flag)
		puts("No duplicates.");
	return 0;
}