Cod sursa(job #1032128)

Utilizator laurionLaurentiu Ion laurion Data 15 noiembrie 2013 18:57:08
Problema Dtcsu Scor 0
Compilator cpp Status done
Runda FMI No Stress 4 Marime 1.19 kb
//#define DBG
//
//  main.cpp
//  FMINoStress
//
//  Created by Laur Ion on 11/15/13.
//  Copyright (c) 2013 Laur Ion. All rights reserved.

#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#include <unordered_set>
std::unordered_set<unsigned long long> numbers;
using namespace std;

ofstream fout("melodii.out");
 

#define DIM 8192
char ax[DIM+16];
int _idx;
template<class T>
inline void cit(T& x)
{
    x=0;
    while((ax[_idx]<'0' || ax[_idx]>'9') && (ax[_idx]!='-'))
        if(++_idx==DIM)fread(ax, 1, DIM, stdin), _idx=0;
    
    int neg=0;
    if(ax[_idx]=='-') {
        neg=1;
        if(++_idx==DIM)fread(ax, 1, DIM, stdin),_idx=0;
    }
    
    while(ax[_idx]>='0' && ax[_idx]<='9') {
        x=x*10+ax[_idx]-'0';
        if(++_idx==DIM)fread(ax,1, DIM, stdin),_idx=0;
    }
    if(neg) x=-x;
}



int main(){
    freopen("dtcsu.in", "r", stdin);
    int t = 276997;
    for (; t; --t) {
        unsigned long long x;
        cit(x);
        numbers.insert(x);
    }
    int q = 0,sol = 0;
    cit(q);
    for(int i=0;i<q;++i){
        unsigned long long x;
        cit(x);
        if(numbers.find(x) != numbers.end())
            sol++;
    }
    fout<<sol<<'\n';
    return 0;
}