Pagini recente » Cod sursa (job #1639816) | Cod sursa (job #3139746) | Cod sursa (job #1105539) | Cod sursa (job #1694589) | Cod sursa (job #1194418)
#include <cstdio>
#include <unordered_set>
using namespace std;
int NUM=276997;
unordered_set <long long> hashin;
int main()
{
long long x;
freopen("dtcsu.in","r",stdin);
freopen("dtcsu.out","w",stdout);
while(NUM--){
scanf("%lld",&x);
if(x&1)hashin.insert(x);
}
int que;
scanf("%d",&que);
while(que--){
scanf("%lld",&x);
if(x&(-x))x/=x&(-x);
if(x and hashin.find(x)!=hashin.end())++NUM;
}
printf("%d\n",++NUM);
return 0;
}