Pagini recente » Cod sursa (job #1845558) | Cod sursa (job #2655550) | Cod sursa (job #1171580) | Cod sursa (job #2287925) | Cod sursa (job #1367112)
# include <fstream>
# include <algorithm>
# include <vector>
# include <queue>
# include <cstring>
# define NR 200005
# define mod 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[mod+5];
int i,j,n,m,x,M,tip;
int main ()
{
f>>n;
for (i=1; i<=n; ++i)
{
f>>tip>>x; M=x%mod;
if (tip==1)
{
if (find(v[M].begin(), v[M].end(), x)==v[M].end())
v[M].push_back(x);
}
else if (tip==2)
{
if (find(v[M].begin(), v[M].end(), x)!=v[M].end())
v[M].erase(find(v[M].begin(), v[M].end(), x));
}
else {
if (find(v[M].begin(), v[M].end(), x)==v[M].end()) g<<"0\n";
else g<<"1\n";
}
}
return 0;
}