Pagini recente » Cod sursa (job #1704980) | Cod sursa (job #2560048) | Cod sursa (job #2849046) | Cod sursa (job #2031928) | Cod sursa (job #2283270)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <int> v[666013];
vector <int> :: iterator it;
int n,i,p;
long long x,x1;
int main()
{
fin >> n;
for (i=1;i<=n;i++)
{
fin >> p >> x;
x1=x%666013;
it=find(v[x1].begin(),v[x1].end(),x);
if (p==1)
{
if (it==v[x1].end()) v[x1].push_back(x);
continue;
}
if (p==2)
{
if (it!=v[x1].end()) v[x1].erase(it);
continue;
}
if (it!=v[x1].end()) fout << 1;
else fout << 0;
fout << "\n";
}
return 0;
}