Cod sursa(job #771011)
Utilizator | Persa Paul RoPaul | Data | 24 iulie 2012 15:50:46 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <set>
#define MAX 10013
using namespace std;
ifstream fi("hashuri.in");
ofstream fo("hashuri.out");
int N,i;
int tip,v;
int k;
set <int> H[MAX];
set <int> :: iterator it;
int main()
{
fi>>N;
for (i=1;i<=N;i++)
{
fi>>tip>>v;
k=v%MAX;
if (tip==1)
H[k].insert(v);
else
if (tip==2)
H[k].erase(v);
else
{
it=H[k].find(v);
if (it!=H[k].end())
fo<<1<<"\n";
else
fo<<0<<"\n";
}
}
fi.close();
fo.close();
return 0;
}