pku2419.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <stdlib.h>

typedef struct 
{
	int tree[100];
} People;

int p, t;

int cmp(const void *a, const void *b)
{
	People *aa = (People *)a;
	People *bb = (People *)b;	int i;
	for (i = 0; i < t ; i++)
	{
		if (aa->tree[i] != bb->tree[i])
		{
			return aa->tree[i] - bb->tree[i];
		}
	}
	return 0;
}

int main()
{
	int i, j, k;
	People peo[100];

	scanf("%d %d", &p, &t);

	for (i = 0; i < p; i++)
	{
		for (j = 0; j < t; j++)
		{
			peo[i].tree[j] = 0;
		}
	}

	while (scanf("%d%d", &i, &j) != -1)
	{
		peo[i-1].tree[j-1] = 1;
	}

	qsort(peo, p, sizeof(peo[0]), cmp);

	for (i = 1, k = 1; i < p; i++)
	{
		if (cmp(peo + i - 1, peo + i) != 0)
		{
			k++;
		}
	}

	printf("%d\n", k);
	
	return 0;
}