Cod sursa(job #3319018)
| Utilizator | Data | 30 octombrie 2025 12:01:13 | |
|---|---|---|---|
| Problema | Dtcsu | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("dtcsu.in");
ofstream fout ("dtcsu.out");
long long n, q, nr;
unordered_map <long long, bool> fr;
int main()
{
while(nr < 276997){
fin >> n;
fr[n] = 1;
nr++;
}
nr = 0;
fin >> q;
for(int i = 1; i <= q; i++){
fin >> n;
if(fr[n] == 1){
nr++;
}
}
fout << nr;
return 0;
}
