Pagini recente » Cod sursa (job #2437540) | Monitorul de evaluare | Istoria paginii template/jc2012 | template/preoni-2008/header | Cod sursa (job #1065745)
#include <fstream>
#include <vector>
#define Nrlinii 276997
#define P 40039
using namespace std;
vector <int> H[P+2];
inline void AdaugaHash(int x)
{
int i=x%P;
H[i].push_back(x);
}
inline int CautaHash(int x)
{
int i=x%P,len,j;
len=H[i].size();
for(j=0;j<len;++j)
if(H[i][j]==x)
return 1;
return -1;
}
int main()
{
int sol=0,x,Q,i;
ifstream fin("dtcsu.in");
for(i=1;i<=Nrlinii;++i)
{
fin>>x;
AdaugaHash(x);
}
fin>>Q;
while(Q--)
{
fin>>x;
if(CautaHash(x)!=-1)
++sol;
}
ofstream fout("dtcsu.out");
fout<<sol<<"\n";
fout.close();
return 0;
}