Pagini recente » Cod sursa (job #1888258) | Cod sursa (job #1888166) | Cod sursa (job #1997535) | Cod sursa (job #1153984) | Cod sursa (job #1392289)
#include<fstream>
#include<vector>
#define mod 666013
using namespace std;
int T, op, x;
vector<int> G[mod];
vector<int>::iterator find_value(int x){
int listt=x%mod;
vector<int>::iterator it;
for(it=G[listt].begin(); it!=G[listt].end(); ++it)
if(*it==x)
return it;
return G[listt].end();
}
void insert_value(int x){
int listt=x%mod;
if(find_value(x)==G[listt].end())
G[listt].push_back(x);
}
void erase_value(int x){
int listt=x%mod;
vector<int>::iterator it=find_value(x);
if(it!=G[listt].end())
G[listt].erase(it);
}
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int main(){
in>>T;
for(;T--;){
in>>op>>x;
if(op==1){
insert_value(x);
continue;
}
if(op==2){
erase_value(x);
continue;
}
find_value(x)!=G[x%mod].end()?out<<"1\n":out<<"0\n";
}
return 0;
}