Pagini recente » Cod sursa (job #1311759) | Cod sursa (job #1039491)
#include <fstream>
#include <vector>
#define in "dtcsu.in"
#define out "dtcsu.out"
#define MOD 30013
#define LL long long
#define Max_N 276997
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);
}
}
inline void Solve()
{
LL x;
std :: vector < LL > :: iterator it;
int Sol = 0;
f >> Q;
for(int i = 1; i <= Q; ++i)
{
f >> x;
for(it = Hash[x % MOD].begin(); it != Hash[x % MOD].end(); ++it)
if(*it == x) ++Sol;
}
g << Sol << '\n';
}
int main()
{
Read_Data();
Solve();
g.close();
return 0;
}