Pagini recente » Cod sursa (job #1765496) | Borderou de evaluare (job #1800505) | Cod sursa (job #2731793) | Cod sursa (job #2225755) | Cod sursa (job #3315456)
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
const int N=9973;
vector<int> v[N];
int main()
{
int n;
for(cin>>n;n--;) {
int i,j;
cin>>i>>j;
auto k=find(v[j%N].begin(),v[j%N].end(),j);
if(i<2&&k==v[j%N].end())
v[j%N].push_back(j);
else if(i==2&&k!=v[j%N].end())
v[j%N].erase(k);
else if(i>2)
cout<<(k!=v[j%N].end())<<'\n';
}
return 0;
}