Cod sursa(job #2150214)
Utilizator | Data | 3 martie 2018 12:47:32 | |
---|---|---|---|
Problema | Dtcsu | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream in("dtcsu.in");
ofstream out("dtcsu.out");
unordered_set <long long> mySet;
int nr;
int main()
{
for(int i = 1; i <= 276997; i++)
{
int x;
in>>x;
mySet.insert(x);
}
int m;
in>>m;
while(m--){
int n;
in>>n;
if(mySet.find(n) != mySet.end())
nr++;
}
out<<nr;
return 0;
}