Pagini recente » Cod sursa (job #1996240) | Cod sursa (job #2437168) | Cod sursa (job #365972) | Cod sursa (job #1628016) | Cod sursa (job #2141037)
#include <fstream>
#include <algorithm>
using namespace std;
string s[36001];
int main()
{ int n,i,j,nr,sum=0;
ifstream f("restante.in");
ofstream g("restante.out");
f>>n;
for (i=1;i<=n;++i)
f>>s[i],sort(s[i].begin(),s[i].end());
sort(s+1,s+n+1);
i=1;j=2;
while (i<=n) {
nr=0;
while (s[i]==s[j] && j<=n)
++nr,++j;
if (nr>0) sum+=nr+1;
i=j,++j;
}
g<<n-sum;
return 0;
}