Cod sursa(job #1030181)
| Utilizator | Data | 15 noiembrie 2013 15:54:52 | |
|---|---|---|---|
| Problema | Dtcsu | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | FMI No Stress 4 | Marime | 0.35 kb |
#include <fstream>
#include<map>
using namespace std;
map<long long,long long>v;
long long nr=1,i,n,x,cont;
int main()
{
ifstream f("dtcsu.in");
ofstream g("dtcsu.out");
for(i=1;i<=276997;i++)
f>>v[nr++];
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(v.find(x)!=v.end()) cont++;
}
g<<cont;
}
