Pagini recente » Cod sursa (job #2950631) | Cod sursa (job #1850741) | Cod sursa (job #349324) | Cod sursa (job #939497) | Cod sursa (job #2102909)
#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, op, x;
int main()
{
for(in>>n;n;n--)
{
in>>op>>x;
int poz=x%mod;
vector < int > :: iterator prez=find(v[poz].begin(),v[poz].end(),x);
if(op==1)
{
if(prez==v[poz].end())
v[poz].push_back(x);
}
else if(op==2)
{
if(prez!=v[poz].end())
v[poz].erase(prez);
}
else if(op==3)
out<<(prez!=v[poz].end())<<'\n';
}
return 0;
}