Pagini recente » Cod sursa (job #1457101) | Cod sursa (job #3283212) | Cod sursa (job #2969836) | Cod sursa (job #782469) | Cod sursa (job #2911141)
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int h = 100003;
int o,n,x;
vector<int> v[h];
int main()
{
f>>n;
for(; n; n--)
{
f>>o>>x;
int k=x%h;
int m=v[k].size();
int j;
for(j=0;j<m;j++)
if(v[k][j]==x)
break;
if(o==1)
{
if(j==m)
v[k].push_back(x);
}
else if(o==2)
{
if(j<m)
{
swap(v[k][j],v[k][m-1]);
v[k].pop_back();
}
}
else
{
if(j==m)
g<<"0\n";
else
g<<"1\n";
}
}
return 0;
}