Pagini recente » Cod sursa (job #2897369) | Cod sursa (job #1494897) | Cod sursa (job #2475126) | Cod sursa (job #2063323) | Cod sursa (job #1890357)
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,i,tip,x,m;
set <int> a[666013];
set <int>::iterator cauta;
#define mod 666013;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
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;
}