1532.cpp

另外一部分在nankai上面写的题目

#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define max 1001
int sign[max],tot,n;
int main()
{
	int temp,i;
	vector<int>number;
	memset(sign,0,sizeof(sign));
	while (scanf("%d",&n)!=EOF)
    {
		tot=0;
		while (n--)
		{
			scanf("%d",&temp);
			if (sign[temp]!=1)
			{
				sign[temp]=1;
				number.push_back(temp);
				tot++;
			}
		}
		sort(number.begin(),number.end());
		printf("%d\n",tot);
		for (i=0;i<tot-1;i++) printf("%d ",number[i]);printf("%d ",number[tot-1]);printf("\n");
		number.clear();
	}
	return 1;
}