Pagini recente » Borderou de evaluare (job #61409) | Cod sursa (job #2804315) | Cod sursa (job #1041930) | Cod sursa (job #1045953)
#include<fstream>
#include<vector>
#include<iterator>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> x[666014];
vector<int>:: iterator it;
int n,op,a;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>op>>a;
int e=0;
switch(op)
{
case 1:
x[a%666013].push_back(a);
break;
case 2:
for(int j=0;j<x[a%666013].size();j++)
{
if(x[a%666013][j]==a)
{
x[a%666013][j]=x[a%666013].back();
x[a%666013].pop_back();
break;
}
}
break;
case 3:
for(it=x[a%666013].begin();it!=x[a%666013].end();it++)
{
if(*it==a)
{
e=1;
break;
}
}
g<<e<<'\n';
break;
}
}
return 0;
}