Pagini recente » nush_chare | Cod sursa (job #381040) | Cod sursa (job #2149643) | Monitorul de evaluare | Cod sursa (job #1298876)
#include<fstream>
#include<algorithm>
#include<cstring>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
long long v[36005],x[36005];
char s[20];
long long i,n,m,y,j,k,nr;
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>s;
m=strlen(s);
sort(s,s+m);
y=0;
for(j=0;j<m;j++){
y*=10;
y+=((int)s[j]-96);
}
v[i]=y;
x[i]=y;
}
sort(v+1,v+n+1);
k=1;
nr=0;
for(i=2;i<=n;i++){
if(v[i]!=v[k]){
if(k==i-1){
nr++;
}
k++;
v[k]=v[i];
}
}
if(x[n]!=x[n-1]){
nr++;
}
fout<<nr;
return 0;
}