0PTS求条，支持壶关

#include<bits/stdc++.h>
using namespace std;
const int p=131009;
const int N=1e4+5;
unsigned long long a[N];
int main()
{
	int n;
	cin>>n;
	int k=1;
	int y=n;
	while(n--)
	{
		string s;		
		cin>>s;
		s='#'+s;
		for(int i=1;i<=s.length();i++)
		{
			a[k]*=p;
			a[k]+=(unsigned long long)s[i];
		}
		k++;
	}
	sort(a+1,a+k+1);
	for(int i=1;i<=y;i++)
	{
		cout<<a[i]<<" ";
	}
	int ans=1;
	for(int i=1;i<y;i++)
	{
		if(a[i]!=a[i+1])
			ans++;
	}
	cout<<ans;
	return 0;
}