Pagini recente » Cod sursa (job #2895502) | Cod sursa (job #2766182) | Cod sursa (job #65988) | Cod sursa (job #3181204) | Cod sursa (job #3283394)
#include <iostream>
#include <fstream>
#include <unordered_map>
#include <set>
#include <iomanip>
#include <algorithm>
#include <bitset>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
set<long long> s;
int main() {
ios_base::sync_with_stdio(false);
fin.tie(NULL);
for (int i = 1; i <= 276997; ++i) {
long long number;
fin >> number;
s.insert(number);
}
int q;
fin >> q;
int ans = 0;
for (int i = 1; i <= q; ++i) {
long long number;
fin >> number;
if (s.count(number)) {
++ans;
// fr.erase(number);
}
}
fout << ans;
return 0;
}