Pagini recente » Cod sursa (job #2719871) | Cod sursa (job #2196167) | Cod sursa (job #819347) | Cod sursa (job #1506962) | Cod sursa (job #1037393)
#include <fstream>
#include <vector>
#define in "dtcsu.in"
#define out "dtcsu.out"
#define MOD 10013
#define Max_N 276997
#define LL long long
std :: ifstream f(in);
std :: ofstream g(out);
int Q;
std :: vector < LL > Hash[MOD];
inline void Read_Data()
{
LL x;
for(int i = 1; i <= Max_N; ++i)
{
f >> x;
Hash[x % MOD].push_back(x);
}
}
int main()
{
Read_Data();
f >> Q;
std :: vector < LL > :: iterator it;
int sol = 0;
for(int i = 1; i <= Q; ++i)
{
LL x;
f >> x;
for(it = Hash[x % MOD].begin(); it != Hash[x % MOD].end(); ++it)
if(*it == x)
{
++sol;
break;
}
}
g << sol << '\n';
g.close();
return 0;
}