Pagini recente » Cod sursa (job #1707008) | Cod sursa (job #328416) | Cod sursa (job #1325453) | Cod sursa (job #234585) | Cod sursa (job #2397578)
#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
int v[37000];
char m[3700][50];
int mark[3700],i,j,s,n,l,x;
bool cmp(int a, int b){
x=strcmp(m[a], m[b]);
if(x>=0) return 0;
return 1;
}
int main()
{
f>>n;
for(i=1;i<=n;i++){
f>>m[i];
l=strlen(m[i]);
sort(m[i],m[i]+l);
v[i]=i;
}
sort(v+1, v+n+1, cmp);
for(i=2;i<=n;i++){
x=strcmp(m[v[i]], m[v[i-1]]);
if(x==0)
mark[i]=mark[i-1]=1;
}
for(i=1;i<=n;i++) if(mark[i]==0) s++;
g<<s;
return 0;
}