Pagini recente » Cod sursa (job #863973) | Cod sursa (job #547891) | Istoria paginii utilizator/sloan | Istoria paginii preoji-2004/clasament-9-10 | Cod sursa (job #1891290)
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int mod=666013;
int n,tip,x,m;
set <int> a[mod];
set <int>::iterator cauta;
int main()
{
f>>n;
while(n--)
{
f>>tip>>x;
m=x%mod;
cauta=a[m].find(x);
if(tip==1&&cauta==a[m].end())
a[m].insert(x);
else if(tip==2&&cauta!=a[m].end())
a[m].erase(cauta);
else if(tip==3)
g<<(cauta!=a[m].end())<<endl;
}
return 0;
}