Pagini recente » Cod sursa (job #2786835) | Cod sursa (job #2535088) | Cod sursa (job #2474207) | Cod sursa (job #2954601) | Cod sursa (job #357704)
Cod sursa(job #357704)
#include <fstream>
#include <vector>
#include <set>
using namespace std;
const int prim=30469 ;
int main(){
vector<int> v[prim];
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int n;in>>n;
for(int i=0;i<n;i++){
int c,x;in>>c>>x;
if(c==1){
bool gasit=false;
for(int i=0;i<v[x%prim].size();i++){
if(v[x%prim][i]==x){
gasit=true;
break;
}
}
if(!gasit) v[x%prim].push_back(x);
}
else if(c==2){
for(int i=0;i<v[x%prim].size();i++){
if(v[x%prim][i]==x){
v[x%prim].erase(v[x%prim].begin()+i);
break;
}
}
}
else if(c==3){
bool gasit=false;
for(int i=0;i<v[x%prim].size();i++){
if(v[x%prim][i]==x){
gasit=true;
break;
}
}
if(!gasit) out<<1<<"\n";
else out<<0<<"\n";
}
}
}