Pagini recente » Cod sursa (job #2877663) | Cod sursa (job #2224209) | Cod sursa (job #2856752) | Cod sursa (job #2047119) | Cod sursa (job #2963638)
#include <fstream>
#include <list>
#include <set>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n;
int op;
int x;
set <int> v[100005];
inline int hash_v(int value)
{
return value%100001;
}
void add_value(int value)
{
int key = hash_v(value);
v[key].insert(value);
}
bool find_value(int value)
{
int key = hash_v(value);
return v[key].find(value)!=v[key].end();
}
void delete_value(int value)
{
int key = hash_v(value);
v[key].erase(value);
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>op;
fin>>x;
if(op==1)
{
add_value(x);
}
else if(op==2)
{
delete_value(x);
}
else
fout<<find_value(x)<<'\n';
}
}