1002.cpp

非常好的C++学习源码,里面包括各种算法的实现,二叉的的前中后序遍历等

#include<iostream>
#include<cstring>
#include<iomanip>
using namespace std;
char a[2000];
int c[100001]={0};

int Compare( const void *elem1, const void *elem2 )
{   
	int *p1, *p2;
	p1 = (int *)elem1;		 
	p2 = (int *)elem2;		 
	return  (*p1-(*p2)); 
}

int main()
{
	int i,j,n,k=0,d[1000]={0},m=0,e[1000]={0},x,y,p=0;
	cin>>n;
	for (i=0;i<n;i++)
	{
		k=0;
		cin>>a;
		for (j=0;j<strlen(a);j++)
		{
			if ((a[j]>='A')&&(a[j]<='C'))
			{
				c[i]=c[i]*10+2;
				continue;
			}
			if ((a[j]>='D')&&(a[j]<='F'))
			{
				c[i]=c[i]*10+3;
				continue;
			}
			if ((a[j]>='G')&&(a[j]<='I'))
			{
				c[i]=c[i]*10+4;
				continue;
			}
			if ((a[j]>='J')&&(a[j]<='L'))
			{
				c[i]=c[i]*10+5;
				continue;
			}
			if ((a[j]>='M')&&(a[j]<='O'))
			{
				c[i]=c[i]*10+6;
				continue;
			}
			if ((a[j]=='P')||(a[j]=='R')||(a[j]=='S'))
			{
				c[i]=c[i]*10+7;
				continue;
			}
			if ((a[j]>='T')&&(a[j]<='V'))
			{
				c[i]=c[i]*10+8;
				continue;
			}
			if ((a[j]>='W')&&(a[j]<='Y'))
			{
				c[i]=c[i]*10+9;
				continue;
			}
			if ((a[j]>='0')&&(a[j]<='9'))
			{
				c[i]=c[i]*10+(a[j]-'0');
				continue;
			}
			if (c[i]>=1000000)
				break;
		}
	}
	qsort(c,n,sizeof(int),Compare);  
	cout<<setfill('0');
	for (i=0;i<n;i++)
	{
		m=i;
		while ((c[m]==c[i])&&(i<n))
			i++;
		if (i>m+1)
		{
			p=1;
			x=c[m]/10000;
			y=c[m]%10000;
			cout<<setw(3)<<x;
			cout<<"-";
			cout<<setw(4)<<y;
			cout<<" "<<i-m<<endl;
		}
		i--;
	}
    if (p==0)
		cout<<"No duplicates."<<endl;
	return 0;
}