Pagini recente » Cod sursa (job #1583477) | Cod sursa (job #1344135) | Cod sursa (job #2453054) | Cod sursa (job #2169239) | Cod sursa (job #486178)
Cod sursa(job #486178)
#include<fstream>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
vector<string>cuv;
bool comp(string a,string b)
{ if(a<b) return 1;
return 0;
}
int main()
{ int N,i,j;
f>>N;
cuv.resize(N+2);
for(i=1;i<=N;i++)
{ f>>cuv[i];
sort(cuv[i].begin(),cuv[i].end());
}
sort(cuv.begin(),cuv.end());
i=1; j=0;
while(i<=N)
{ if(cuv[i]==cuv[i+1])
for(i;i<=N && cuv[i]==cuv[i+1];i++);
else
j++;
i++;
}
g<<j;
f.close();
g.close();
return 0;
}