Pagini recente » Clasament ooni | Cod sursa (job #883482) | Cod sursa (job #1194381) | Cod sursa (job #1720021) | Cod sursa (job #1684431)
#include<fstream>
#include<cstring>
#include<algorithm>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
int N,i,j,s,k,nr,n,Z;
char v[20];
int V[36010];
int main(){
fin>>N;
for(i=1;i<=N;i++){
fin>>v+1;
n=strlen(v+1);
sort(v+1,v+n+1);
s=0;
for(j=1;j<=n;j++){
Z=v[j]-'a';
if(Z<=9)
s=s*10+Z;
else
s+=Z;
}
V[++k]=s;
}
sort(V+1,V+k+1);
s=0;
for(i=2;i<=k;i++){
if(V[k]==V[k-1]){
s++;
}
else{
if(s==1)
nr++;
s=1;
}
}
fout<<nr;
return 0;
}