Pagini recente » Cod sursa (job #2849087) | Cod sursa (job #2290764) | Cod sursa (job #1820740) | Cod sursa (job #1652425) | Cod sursa (job #2002225)
#include <cstdio>
#include <unordered_set>
#define LL long long
using namespace std;
unordered_set<LL>ap;
const int DIM=50000;
int poz=DIM-1;
char buff[DIM];
void citeste(LL &nr)
{
nr=0;
while(!('0'<=buff[poz]&&buff[poz]<='9'))
{
if(++poz==DIM) fread(buff,1,DIM,stdin),poz=0;
}
while('0'<=buff[poz]&&buff[poz]<='9')
{
nr=nr*10 + buff[poz]-'0';
if(++poz==DIM) fread(buff,1,DIM,stdin),poz=0;
}
}
int main()
{
freopen ("dtcsu.in","r",stdin);
freopen ("dtcsu.out","w",stdout);
LL val;
for(int i=1;i<=276997;i++)
{
citeste(val);
ap.insert(val);
}
LL q;
citeste(q);
int ct=0;
for(;q>0;--q)
{
citeste(val);
if(ap.find(val)!=ap.end()) ++ct;
}
printf("%d\n",ct);
}