Pagini recente » Cod sursa (job #44010) | Cod sursa (job #416104) | Cod sursa (job #2775980) | Cod sursa (job #3217344) | Cod sursa (job #2091916)
#include <bits/stdc++.h>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
const int mod=666013;
vector < int > v[mod+1];
int n, x , op;
int main()
{
for(in>>n;n;n--)
{
in>>op>>x;
int loc=x%mod;
vector < int > :: iterator it=find(v[loc].begin(),v[loc].end(),x);
if(op==1)
{
if(it==v[loc].end())
v[loc].push_back(x);
}
else if (op==2)
{
if(it!=v[loc].end())
v[loc].erase(it);
}
else if(op==3)
out<<(it!=v[loc].end()? 1:0)<<'\n';
}
return 0;
}