重发一遍
```cpp
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
struct mstring
{
char s[110];
} s[100100];
bool comp(mstring a,mstring b)
{
for (long i=1;i<=min(strlen(a.s+1),strlen(b.s+1));i++)
{
if (a.s[i]<b.s[i]) return true;
if (a.s[i]>b.s[i]) return false;
}
return true;
}
int main()
{
long n=0,i=0,t=0;
cin>>n;
for (i=1;i<=n;i++)
{
scanf("%s",s[i].s+1);
sort(s[i].s+1,s[i].s+strlen(s[i].s+1)+1);
}
sort(s+1,s+n+1,comp);
t=1;
for (i=2;i<=n;i++)
{
if (strcmp(s[i].s+1,s[i-1].s+1)) t++;
}
cout<<t<<endl;
return 0;
}
```
by Kingofburningprobs @ 2018-07-26 16:32:01
@Kingofburningprobs虽然我不知道你是什么意思(我是P党),但我可以跟你讲我的思路:
首先,一边读入字符串,一边把字符串的各个字符排个序,形成一个新的字符串,并放在数组中;存放好后,把整个存放字符串的数组排个序,然后判断有几个不同的(注意,排序都用快排)
by wuyutong111 @ 2018-08-31 18:55:37
@[Kingofburningprobs](/space/show?uid=26763)
by wuyutong111 @ 2018-08-31 18:55:54
@[wuyutong111](/space/show?uid=117229) 谢谢,我也是这个思路。
by Kingofburningprobs @ 2018-08-31 19:11:53
是RE吗?
@[Kingofburningprobs](/space/show?uid=26763)
by wuyutong111 @ 2018-08-31 20:21:20
@[Kingofburningprobs](/space/show?uid=26763)
我们加个QQ,里面说
by wuyutong111 @ 2018-08-31 20:24:20
是的第九个点RE,其它点A了
by Kingofburningprobs @ 2018-08-31 20:44:33