Pagini recente » Cod sursa (job #1767132) | Cod sursa (job #2728683) | Cod sursa (job #1417327) | Cod sursa (job #1253825) | Cod sursa (job #2747345)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int p = 400000;
int k;
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)
{k=y%p;
for(int j = 0 ; j < v[k].size() ; ++j)
if(y==v[k][j])
{
v[k].erase(v[k].begin()+j);
}
}
if(x==3)
{
k=y%p;
bool ok =true;
for(int j = 0 ; j < v[k].size() && ok ; ++j)
if(y==v[k][j])
{
ok=false;
g<<1<<endl;
}
if(ok)
g<<0<<endl;
}
}
return 0;
}