Pagini recente » Cod sursa (job #312981) | Cod sursa (job #311920) | Cod sursa (job #160582) | Cod sursa (job #2009011) | Cod sursa (job #2283269)
#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;
int main()
{
fin >> n;
for (i=1;i<=n;i++)
{
fin >> p >> x;
x=x%666013;
it=find(v[x].begin(),v[x].end(),x);
if (p==1)
{
if (it==v[x].end()) v[x].push_back(x);
continue;
}
if (p==2)
{
if (it!=v[x].end()) v[x].erase(it);
continue;
}
if (it!=v[x].end()) fout << 1;
else fout << 0;
fout << "\n";
}
return 0;
}