Pagini recente » Cod sursa (job #3250457) | Cod sursa (job #51169) | Cod sursa (job #119051) | Cod sursa (job #254318) | Cod sursa (job #1551993)
#include <cstdio>
#include <map>
#include <algorithm>
using namespace std;
#define MaxN 360000
#define MaxL 16
#define Sigma 26
#define BASE 37
char s[MaxL + 1];
unsigned short freq[Sigma];
map <unsigned long long, unsigned short> H;
int main(void) {
freopen("restante.in", "r", stdin);
freopen("restante.out", "w", stdout);
int N, ans;
char c;
unsigned long long q;
scanf("%d\n", &N);
for (int i = 0; i < N; i++) {
while ((c = getchar_unlocked()) != '\n') {
freq[c - 'a']++;
}
q = 0;
for (int j = 0; j < Sigma; j++) {
while (freq[j] > 0) {
q = (q * BASE + j);
freq[j]--;
}
}
H[q]++;
}
fseek(stdin, 0, SEEK_SET);
scanf("%d\n", &N);
ans = 0;
for (int i = 0; i < N; i++) {
while ((c = getchar_unlocked()) != '\n') {
freq[c - 'a']++;
}
q = 0;
for (int j = 0; j < Sigma; j++) {
while (freq[j] > 0) {
q = (q * BASE + j);
freq[j]--;
}
}
ans += (H[q] == 1);
}
printf("%d\n", ans);
fclose(stdout);
return 0;
}