Pagini recente » Cod sursa (job #724792) | Cod sursa (job #227982) | Cod sursa (job #1230954) | Cod sursa (job #2289333) | Cod sursa (job #2747339)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int p = 500000;
vector <int> v[p];
int main() {
int n,x,y;
f>>n;
for(int i = 0 ; i < n ; ++i)
{
f>>x>>y;
if(x==1)
{
v[y%p].push_back(y);
}
if(x==2)
{
for(int j = 0 ; j < v[y%p].size() ; ++j)
if(y==v[y%p][j])
{
v[y%p].erase(v[y%p].begin()+j);
}
}
if(x==3)
{
bool ok =true;
for(int j = 0 ; j < v[y%p].size() && ok ; ++j)
if(y==v[y%p][j])
{
ok=false;
g<<1<<endl;
}
if(ok)
g<<0<<endl;
}
}
return 0;
}