Cod sursa(job #894054)
Utilizator | Data | 26 februarie 2013 19:25:43 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include<fstream>
#include<set>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
multiset <long int> hs;
int main (void)
{
int nop,op,x;
in>>nop;
for(int i=1; i<=nop; ++i)
{
in>>op>>x;
if(op==1)
hs.insert(x) ;
if(op==2)
hs.erase(x);
if(op==3)
if(hs.find(x)!=hs.end())
out<<1<<'\n';
else
out<<0<<'\n';
}
in.close();
out.close();
return 0;
}