Cod sursa(job #1642641)
Utilizator | Data | 9 martie 2016 15:17:52 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
# include <bits/stdc++.h>
# include <unordered_map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
unordered_map <int, int> H;
int i,j,n,m,tip,x;
int main ()
{
f>>n;
for (i=1; i<=n; ++i) {
f>>tip>>x;
if (tip==1) ++H[x];
else if (tip==2) {if (H[x]) --H[x];}
else {
if (H[x]!=0) g<<"1\n";
else g<<"0\n";
}
}
return 0;
}