Pagini recente » Cod sursa (job #1100227) | Cod sursa (job #2668915) | Cod sursa (job #2708808) | Cod sursa (job #51310) | Cod sursa (job #654193)
Cod sursa(job #654193)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
int n,d[36001];
string a[36001];
int main(void){
register int i,j;
f>>n;
f.get();
for(i=1;i<=n;i++){
f>>a[i];
sort(a[i].begin(),a[i].end());
}
sort(a+1,a+n+1);
int nr=0;
for(i=2;i<=n;i++)
if(a[i]!=a[i-1] && a[i]!=a[i+1])
nr++;
g<<nr<<"\n";
f.close();
g.close();
return 0;
}