Pagini recente » Cod sursa (job #1416430) | Cod sursa (job #483815) | Cod sursa (job #966681) | Cod sursa (job #2237499) | Cod sursa (job #1031900)
//#include <algorithm>
#include <stdio.h>
using namespace std;
#define file_in "dtcsu.in", "r"
#define file_out "dtcsu.out", "w"
int main()
{
FILE* _in = fopen(file_in),
* _out = fopen(file_out);
int aLen = 262100;
int *A = new int[aLen];
int q, w, c = 0;
for(int i = 0; i < 276997; i++)
{
fscanf(_in, "%d", &w);
if(i < aLen) A[i] = w;
}
//sort(A, A + 276997);
fscanf(_in, "%d", &q);
for(int i = 0; i < q; i++)
{
fscanf(_in, "%d", &w);
int p = 229376;
int pos = 0;
for( ; p > 0; p<<=1 )
if(w < A[pos])
pos += p;
if(A[pos] == w) c++;
}
fprintf(_out, "%d \n", c);
return 0;
}