Pagini recente » Cod sursa (job #2311939) | Cod sursa (job #2117204) | Cod sursa (job #365910) | Cod sursa (job #836125) | Cod sursa (job #579343)
Cod sursa(job #579343)
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
FILE*f=fopen("restante.in","r");
FILE*g=fopen("restante.out","w");
char ok,a[36001][20];
int n,i,x,sol,P[36001];
int cmp(int i, int j) {
return strcmp(a[i],a[j]) < 0;
}
int main() {
fscanf(f,"%d\n",&n);
for(i=1;i<=n;++i){
fscanf(f,"%s\n",a[i]);
x=strlen(a[i]);
sort(a[i],a[i]+x);
P[i] = i;
}
sort(P+1, P+n+1, cmp);
sol=n;
for(i=2;i<=n;++i){
ok=0;
while(strcmp(a[P[i]],a[P[i-1]])==0){
++i;
sol--;
ok=1;
}
if (ok)
sol--;
}
fprintf(g,"%d",sol);
fclose(g);
fclose(f);
return 0;
}