Pagini recente » Borderou de evaluare (job #2602504) | Borderou de evaluare (job #3281814) | Borderou de evaluare (job #3121253) | Borderou de evaluare (job #1300362) | Cod sursa (job #1600533)
#include <fstream>
#include<set>
#include<unordered_set>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
unordered_set<long long int> Set;
long long int n,i,sol,x;
int main()
{
for(i=1;i<=276997;++i)
{
fin>>x;
Set.insert(x);
}
fin>>n;
for(i=1;i<=n;++i)
{
fin>>x;
if(Set.find(x)!=Set.end()) sol++;
}
fout<<sol;
return 0;
}