Pagini recente » Cod sursa (job #1516273) | Cod sursa (job #815708) | Cod sursa (job #2791800) | Cod sursa (job #3292522) | Cod sursa (job #1000516)
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
const int NMAX = 36005;
string S[NMAX];
int N, Ans;
int main()
{
ifstream fin("restante.in");
ofstream fout("restante.out");
fin >> N;
for(int i = 1; i <= N; ++ i)
{
fin >> S[i];
sort(S[i].begin(), S[i].end());
}
sort(S + 1, S + N + 1);
for(int i = 1; i <= N; )
{
int Right = i;
while(S[i] == S[Right]) Right ++;
if(Right == i + 1) Ans ++;
i = Right;
}
fout << Ans;
}