Pagini recente » Cod sursa (job #2738451) | Cod sursa (job #1756485) | Cod sursa (job #3176085) | Cod sursa (job #824136) | Cod sursa (job #2390320)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
int n;
struct Cuvant
{
char c[20];
};
Cuvant a[36003];
inline bool CMP(Cuvant A, Cuvant B)
{
int i;
i = 0;
while(A.c[i] && B.c[i]){
if(A.c[i] < B.c[i]) return true;
i++;
}
return false;
}
int main()
{
int i,x,sol;
fin>>n;
for(i = 1; i <= n; i++)
{
fin>>a[i].c;
x = strlen(a[i].c);
sort(a[i].c,a[i].c+x);
}
sort(a+1,a+n+1,CMP);
sol = 0;
for(i = 2; i <= n; i++)
if(CMP(a[i],a[i-1]) == false)
sol++;
fout<<sol<<"\n";
fin.close();
fout.close();
return 0;
}