Pagini recente » Cod sursa (job #919191) | Cod sursa (job #2429325) | Cod sursa (job #2502513) | Cod sursa (job #1118160) | Cod sursa (job #700142)
Cod sursa(job #700142)
#include <vector>
#include <fstream>
using namespace std;
vector<int> v[1000000];
int mod=1000000,n,y,x,r,i;
int main ()
{ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
while(n)
{f>>x>>y;
if(x==1)
{r=y%mod;
for(i=0;i<v[r].size()&&v[r][i]!=y;i++);
if(i==v[r].size())
v[r].push_back(y);
}
else
if(x==2)
{r=y%mod;
for(i=0;i<v[r].size()&&v[r][i]!=y;i++);
if(!(i==v[r].size()))
v[r].erase(v[r].begin()+i);
}
else
{r=y%mod;
for(i=0;i<v[r].size()&&v[r][i]!=y;i++);
if(i==v[r].size())
g<<"0\n";
else
g<<1<<'\n';}
n--;}
f.close(); g.close();
return 0;
}