Pagini recente » Borderou de evaluare (job #1317106) | Borderou de evaluare (job #1723234) | Borderou de evaluare (job #3289171) | Borderou de evaluare (job #2705311) | Cod sursa (job #1600539)
#include <fstream>
#include<set>
#include<unordered_set>
using namespace std;
ifstream fin("dtcsu.in");
ofstream fout("dtcsu.out");
//unordered_set<int> Set;
bool v[666014];
int mod=666013;
int n,i,sol;
long long int x;
int main()
{
for(i=1;i<=276997;++i)
{
fin>>x;
//Set.insert(x%mod);
v[x%mod]=true;
}
fin>>n;
for(i=1;i<=n;++i)
{
fin>>x;
//if(Set.find(x%mod)!=Set.end()) sol++;
if(v[x%mod]==true)
sol++;
}
fout<<sol;
return 0;
}